Comprehensive Study Guide for 1st Year PC-TECHNO Mathematics

Pedagogical Framework and Mathematical Logic

• Objectives of the Program: The curriculum for the first semester is designed to facilitate the transition from secondary to higher education by consolidating high school knowledge. It focuses on strengthening logic, reasoning, and calculation techniques essential for mathematics and other scientific disciplines while introducing new concepts.

• Mathematical Language and Notations: Students must master vocabulary and notations for effective mathematical proof writing. Required elements include:

  • The use of quantifiers: Universal ($\forall$) and Existential ($\exists$).

  • Logical operations: Implication, contraposition, equivalence, and negation of propositions.

• Modes of Reasoning: Proficiency is required in several reasoning methods:

  • Reasoning by induction (weak and strong recurrence).

  • Reasoning by contraposition.

  • Reductio ad absurdum (proof by contradiction).

  • Analysis-synthesis method.

• Scope Note: Systematic study of formal logic or set theory foundations remains outside the program's scope.

Fundamental Calculation Techniques in Analysis

• General Context: This practical chapter emphasizes analysis techniques, particularly inequalities and upper/lower bounds. Rigorous constructions for differential or integral calculus are deferred to later chapters to facilitate initial learning.

• Inequalities in $\mathbb{R}$:

  • Order properties on $\mathbb{R}$ and compatibility with arithmetic operations.

  • Absolute values: Interpretation of the distance $|x - a| \le b$ on the real line; the triangular inequality $|x + y| \le |x| + |y|$.

  • Bounded sets: Definitions of upper bounds (majorants), lower bounds (minorants), maximums, and minimums.

• Function Generalities:

  • Domain of definition, graphical representations, parity (even/odd), and periodicity.

  • Operations: Sum, product, composition, and monotonicity (narrow or strict).

  • Graphical transformations: Shifting or scaling graphs for types such as $f(x) + a$, $f(x + a)$, $f(a - x)$, $f(ax)$, and $af(x)$.

  • Bijectivity and inverse functions ($f^{-1}$): Graphical interpretation and symmetry relative to $y = x$.

  • Bounded functions: Function $f$ is bounded if and only if $|f|$ is majorized.

• Differentiation Rules:

  • Tangent line equations at a point.

  • Rules for linear combinations, products, quotients, and compositions of derivatives.

  • Derivative of an inverse function: Geometric interpretation of the calculation of the derivative of $f^{-1}$.

  • Higher-order derivatives.

• Standard Functions:

  • Exponential, natural logarithm ($\ln$), power functions, and the decimal logarithm ($\log_{10}$).

  • Hyperbolic functions: Hyperbolic cosine ($\cosh(x)$) and sine ($\sinh(x)$). Tangent hyperbolic and reciprocal hyperbolic functions are excluded.

  • Circular functions: Sine ($\sin(x)$), cosine ($\cos(x)$), and tangent ($\tan(x)$).

  • Reciprocal circular functions: $\text{Arcsin}$, $\text{Arccos}$, and $\text{Arctan}$.

  • Growth comparisons between logarithms, powers, and exponentials.

• Complex-Valued Functions: Definition of the derivative of a complex function via its real and imaginary parts. Extension of basic real derivation results to functions like $e^{\phi}$ where $\phi$ is complex-valued.

Primitives and Linear Differential Equations

• Primitive Calculation:

  • Identification of primitives for powers, trigonometric, exponential, and inverse functions (e.g., $\frac{1}{1+x^2}$, $\frac{1}{\sqrt{1-x^2}}$).

  • Use of $e^{\lambda x}$ to calculate primitives of products like $e^{ax} \cos(bx)$ or $e^{ax} \sin(bx)$.

  • Fundamental Theorem: Every continuous function on an interval possesses a primitive.

  • Integration techniques: Integration by parts and change of variables for $C^1$ functions.

• First-Order Linear ODEs: Equations of the form $y' + a(x)y = b(x)$.

  • Homogeneous resolution and particular solutions.

  • General solution = Homogeneous solution + Particular solution.

  • Principle of superposition and the Method of Variation of Constants.

  • Cauchy Problem: Existence and uniqueness of solutions.

• Second-Order Linear ODEs with Constant Coefficients:

  • General form: $y'' + ay' + by = f(x)$.

  • Homogeneous resolution based on the characteristic equation.

  • Technique for particular solutions when the second member is of the form $Ae^{\lambda x}$, $B \cos(\omega x)$, or $B \sin(\omega x)$.

Real Numbers and Numerical Sequences

• Properties of $\mathbb{R}$:

  • The construction of $\mathbb{R}$ is excluded.

  • Upper and lower bounds for non-empty majorized/minorized subsets.

  • Floor function ($[x]$) and decimal approximations to precision $10^{-n}$.

  • Interval characterization: A subset $X$ is an interval if and only if for all $a, b \in X$, the segment $[a, b] \subset X$.

• Sequences:

  • Definition: Explicit, implicit, or recursive ($u_{n+1} = f(u_n)$).

  • Convergence: Definition with large inequalities for $|u_n - L| \le \epsilon$. Uniqueness of the limit.

  • Algebra of limits: Linear combinations, products, and quotients.

  • Stability of large inequalities when passing to the limit.

• Theorems of Convergence:

  • Squeeze theorem (Sandwich theorem).

  • Divergence by minoration or majoration.

  • Monotone Limit Theorem: Every monotone sequence has a limit. Bounded monotone sequences converge.

  • Adjacent sequences theorem.

• Extracted Sequences (Subsequences):

  • If a sequence has a limit, all its subsequences share that limit.

  • Used to prove divergence (e.g., finding two subsequences with different limits).

  • The Bolzano-Weierstrass theorem is excluded.

• Complex Sequences: Convergence is determined by the separate convergence of real and imaginary parts.

Limits, Continuity, and Differentiability

• Limits of Functions:

  • Definition at a point, at infinity, and left/right limits.

  • Uniqueness of the limit. If a limit is finite, the function is bounded in the neighborhood of that point.

  • Sequential characterization: Link between function limits and sequence limits.

• Continuity:

  • Definition: Continuity at a point involves the existence of a finite limit equal to the function's value.

  • Extension by continuity at boundary points.

  • Intermediate Value Theorem (IVT): Image of an interval by a continuous function is an interval.

  • Heine-Borel property (admitted): A continuous function on a closed bounded segment is bounded and reaches its bounds.

  • Monotone Bijection Theorem: A continuous strictly monotone function on an interval $I$ realizes a bijection towards $f(I)$, with a continuous inverse of the same monotonicity.

• Differentiability:

  • Order-1 Taylor expansion (linearization).

  • Relation: Differentiability implies continuity.

  • Rolle's Theorem: If $f(a) = f(b)$, there exists $c \in ]a, b[$ such that $f'(c) = 0$.

  • Mean Value Equality and Inequality: If $|f'| \le k$, then $f$ is $k$-Lipschitz.

  • Therorem of the Limit of the Derivative: Used to prove differentiability and $\mathcal{C}^1$ class at a point.

  • Classes $\mathcal{C}^k$ and $\mathcal{C}^{\infty}$: Rules for combination, product (Leibniz formula), and composition.

Asymptotic Analysis

• Comparison Relations:

  • Dominance ($O$), negligibility ($o$), and equivalence ($\sim$).

  • Operations: Products, quotients, and powers are preserved by equivalence.

  • Equivalence preserves sign and limit behavior.

• Taylor (Limited) Expansions:

  • Uniqueness of coefficients and truncation rules.

  • Parity properties: DL of an even function has only even powers; an odd function has only odd powers.

  • Taylor-Young Formula: General expansion at order $n$ for $\mathcal{C}^n$ functions.

  • Standard expansions at 0: $e^x$, $\cos(x)$, $\sin(x)$, $\ln(1+x)$, $(1+x)^{\alpha}$, $\text{Arctan}(x)$, and $\tan(x)$ (to order 3).

  • Operations: Combinations, products, quotients, and primitivation.

Integration and Numerical Series

• Integral Calculus:

  • Step functions and piecewise continuous functions.

  • Riemann Sums: Determination of the limit $\lim_{n \to +\infty} \frac{b-a}{n} \sum_{k=0}^{n-1} f(a + k \frac{b-a}{n}) = \int_a^b f(t)dt$.

  • Integral Properties: Linearity, positivity, growth, and the Chasles relation.

  • Mean Value Inequality for integrals: $| \int f | \le \int |f |$.

  • Taylor Formula with Integral Remainder and the Taylor-Lagrange Inequality.

• Numerical Series:

  • Convergence of partial sums. Convergence of $\sum u_n$ implies $\lim u_n = 0$ (gross divergence if not).

  • Geometric series convergence conditions.

  • Link between sequences and series: $(u_n)$ converges iff $\sum (u_{n+1} - u_n)$ converges.

  • Tests for positive series: Comparison, Riemann series ($\sum \frac{1}{n^{\alpha}}$), and the integral test (rectangles method).

  • Absolute convergence: Convergence of $\sum |u_n|$ implies convergence of $\sum u_n$.

Combinatorics and Probability

• Counting (Dénombrement):

  • Cardinality of finite sets; cardinality of power sets ($2^n$).

  • P-lists (tuples), permutations ($n!$), p-arrangements, and p-combinations ($\binom{n}{p}$).

  • Pascal's Formula and the Binomial Theorem.

• Probability Theory:

  • Events: Elementary, contrary, impossible, incompatible, and complete systems.

  • Axioms: $P(\Omega) = 1$, $P(A \cup B) = P(A) + P(B)$ for disjoint events.

  • Conditional Probability: $P(A|B) = \frac{P(A \cap B)}{P(B)}$.

  • Total Probability Formula and Bayes' Theorem.

  • Independence: Pairwise vs. mutual independence.

• Random Variables:

  • Probability Law ($P_X$).

  • Standard Laws: Bernoulli ($\mathcal{B}(p)$), Binomial ($\mathcal{B}(n, p)$), and Uniform law.

  • Joint and Marginal Laws for pairs of variables.

  • Expectation ($E(X)$) properties: Linearity, Transfer Formula ($E(f(X)) = \sum f(x)P(X=x)$).

  • Variance ($V(X)$) and Standard Deviation: $V(X) = E(X^2) - (E(X))^2$, $V(aX+b) = a^2V(X)$.

  • Bienaymé-Chebyshev Inequality.

Complex Numbers and Algebraic Calculus

• Algebraic Structure of $\mathbb{C}$:

  • Real and imaginary parts, conjugation, and modulus ($|z|^2 = z \bar{z}$).

  • Complex Exponential: $e^{it} = \cos(t) + i \sin(t)$.

  • Roots: Resolution of second-degree equations and $n$-th roots of unity ($U_n$).

• Trigonometry:

  • Euler Formulas and Moivre's Formula.

  • Linearization of trigonometric expressions.

  • Factorization of $1 \pm e^{it}$.

• Algebraic Computation:

  • Finites sums ($\sum$) and products ($\prod$). Double sums and triangular sums.

  • Arithmetical and geometrical progression sum formulas.

  • Factorization of $a^n - b^n$.

• Arithmetic in $\mathbb{Z}$:

  • Euclidean division, GCD (PGCD), and LCM (PPCM).

  • Primes: Fundamental theorem of arithmetic (existence and uniqueness of prime decomposition).

Linear Systems and Matrix Calculus

• Linear Systems:

  • Augmented matrices and elementary row operations (swapping, scaling, addition).

  • Gauss-Jordan elimination: Echelon and reduced echelon forms.

  • Rank of a system: Number of pivots in the reduced form.

• Matrix Algebra:

  • Operations: Sum, scalar multiplication, matrix multiplication (non-commutative).

  • Square matrices ($M_n(\mathbb{K})$), identity matrix ($I_n$), diagonal, and triangular matrices.

  • Inverse matrices ($GL_n(\mathbb{K})$): Found via Gauss-Jordan or solving $AX = B$.

  • Elementary matrices: Transvection, transposition, and dilation.

  • Transposition: Properties of ${}^tA$.

Polynomials and Rational Fractions

• Polynomials ($\mathbb{K}[X]$):

  • Degree properties ($\text{deg}(PQ) = \text{deg}(P) + \text{deg}(Q)$).

  • Euclidean division and divisibility.

  • Roots and multiplicity: Characterization via successive derivatives.

  • Scinded polynomials and the D'Alembert-Gauss Theorem (every non-constant complex polynomial is scinded).

  • Viet's formulas: Relations between coefficients and roots (sum and product).

• Rational Fractions:

  • Irreducible form, poles, and their multiplicities.

  • Partial fraction decomposition in $\mathbb{C}$ and $\mathbb{R}$.

Vector Spaces and Linear Maps

• Concepts of Vector Spaces:

  • Subspaces (SSV) and linear combinations.

  • Subspace generated by a family ($\text{Vect}$).

  • Direct sums ($E_1 \oplus E_2$) and supplementary subspaces.

• Dimension and Bases:

  • Family properties: Free (independent), generating, and bases.

  • Finite dimension definition: Existence of a finite generating family.

  • Steinitz Exchange Lemma (implied): In an $n$-dimension space, more than $n$ vectors are linearly dependent.

  • Incomplete Basis Theorem and Base Extraction Theorem.

• Linear Maps:

  • Kernel ($\text{Ker}(u)$) and Image ($\text{Im}(u)$).

  • Rank-Nullity Theorem: $\text{dim}(E) = \text{rg}(u) + \text{dim}(\text{Ker}(u))$.

  • Isomorphisms: Linear bijections; spaces are isomorphic if they share the same dimension.

  • Projectors ($p^2 = p$) and symmetries ($s^2 = \text{Id}$).

Matrices, Determinants, and Euclidean Spaces

• Matrix Representation of Linear Maps:

  • Matrix relative to a pair of bases.

  • Change of base formula for vectors and endomorphisms.

  • The rank of a matrix is equal to the rank of its column (or row) vectors.

• Determinants:

  • Definition: Unique alternating multilinear form such that $\text{det}(I_n) = 1$.

  • Characterization of invertibility: $A$ is invertible iff $\text{det}(A) \neq 0$.

  • Properties: $\text{det}(AB) = \text{det}(A)\text{det}(B)$, $\text{det}({}^tA) = \text{det}(A)$.

  • Computation: Expansion along rows/columns and the effect of pivot operations.

• Euclidean Spaces:

  • Inner product (scalar product) properties: Bilinearity, symmetry, and positive definiteness.

  • Norm ($||x|| = \sqrt{\langle x, x \rangle}$) and the Cauchy-Schwarz inequality ($| \langle x, y \rangle | \le ||x|| \cdot ||y||$).

  • Orthogonality: Families, orthonormal bases, and the Pythogorean Theorem.

  • Gram-Schmidt Process: Algorithm to produce an orthonormal basis.

  • Orthogonal Projection: Best approximation property where $||x - p_V(x)|| = \text{inf}_{y \in V} ||x - y||$.