1/32
Vocabulary flashcards created from the summary notes of the MPSI/MP Mathematics course covering Analysis, General Algebra, Linear Algebra, and Geometry.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai | Chat |
|---|
No analytics yet
Send a link to your students to track their progress
Ordered Field
The set ℑ of real numbers equipped with two operations + and × compatible with the order relation ⩽, satisfying ∀a,b,c∈R,a⩽b⟹a+c⩽b+c and ∀a,b∈R,∀c⩾0,a⩽b⟹ac⩽bc.
Archimedean Property
The property of real numbers stating that for any a∈R and b>0, there exists an integer k∈N such that bk>a.
Neighborhood of a Point
A subset V of R that contains an open interval centered at a∈R.
Supremum (Borne sup erieure)
The smallest element (if it exists) of the set of upper bounds (majorants) of a subset A⊂R.
Floor Function (Partie entiere)
For a real number x, the unique largest relative integer denoted E(x) or [x] satisfying E(x)⩽x<E(x)+1.
Lipschitz Function
A function f defined on D such that there exists k⩾0 satisfying ∀x,y∈D,∣f(x)−f(y)∣⩽k∣x−y∣. It is called contracting when k<1.
Uniform Continuity
A property of a function f on D defined by ∀ε>0,∃α>0,∀x,x′∈D,∣x−x′∣⩽α⟹∣f(x)−f(x′)∣⩽ε, where α depends on ε but not on x.
Heine's Theorem
The theorem stating that every continuous function on a closed bounded interval (segment) is uniformly continuous on that segment.
Rolle's Theorem
The theorem stating that if a function f is continuous on [a,b], differentiable on ]a,b[, and satisfies f(a)=f(b), then there exists at least one point c∈]a,b[ such that f′(c)=0.
Convex Function
A function f defined on an interval I such that any arc of its representative curve lies below the corresponding chord, satisfying ∀x1,x2∈I,∀k∈[0,1],f(kx1+(1−k)x2)⩽kf(x1)+(1−k)f(x2).
Piecewise Continuous Function
A function f defined on [a,b] for which there exists a subdivision (xi)0⩽i⩽n such that f is continuous on each open interval ]xi,xi+1[ and admits finite left and right limits at every subdivision point.
Norm
A map N from a vector space E into R satisfying positivity and definiteness (N(x)⩾0 and N(x)=0⟺x=0), absolute homogeneity (N(λx)=∣λ∣N(x)), and the triangle inequality (N(x+y)⩽N(x)+N(y)).
Open Set
A subset A of a normed vector space E that is a neighborhood of each of its points, satisfying ∀a∈A,∃ra>0,B(a,ra)⊂A.
Compact Set
In a normed space E, a subset A such that from every sequence of elements of A, one can extract a subsequence that converges to a limit in A. In finite dimension, it is equivalent to being closed and bounded.
Banach Space
A normed vector space E that is complete, meaning that every Cauchy sequence in E converges to an element of E.
Schwarz's Theorem
The theorem stating that if at least one of the second partial derivatives ∂xi∂xj∂2f or ∂xj∂xi∂2f of a function f is continuous at point a, then ∂xi∂xj∂2f(a)=∂xj∂xi∂2f(a).
Jacobian Matrix
For a function f=(f1,…,fp):D⊂Rn→Rp of class C1 at a, the p×n matrix Jf(a) whose (i,j)-th entry is the partial derivative ∂xj∂fi(a).
Exact Differential Form
A differential form ω of degree 1 on an open set U for which there exists a scalar function f:U→R such that df=ω.
Normal Convergence
A mode of convergence for a function series ∑un on an interval I defined by the convergence of the numerical series of supremum norms ∑∥un∥∞.
Radius of Convergence
For a power series ∑anzn, the number R∈[0,+∞] such that the series converges absolutely for all ∣z∣<R and diverges for all ∣z∣>R.
Dirichlet's Theorem
The theorem stating that if f is T-periodic and piecewise C1 on a segment of length T, its Fourier series converges at every point t∈R to its regularized value 2f(t+)+f(t−).
Injective Application
An application f:E→F satisfying ∀x,x′∈E,f(x)=f(x′)⟹x=x′.
Group
A non-empty set G equipped with an internal binary operation ∗ that is associative, has an identity element e, and for which every element in G possesses a symmetric (inverse) element.
Ring
A set A equipped with two internal operations + and × such that (A,+) is a commutative group, × is associative, has an identity element, and is distributive over +.
Field
A non-zero ring in which every non-zero element has a multiplicative inverse.
d'Alembert-Gauss Theorem
The fundamental theorem of algebra stating that every non-constant polynomial with complex coefficients has at least one root in C.
Rank-Nullity Theorem
For a linear application f defined on a finite-dimensional vector space E, the identity dim(E)=dim(Ker(f))+rg(f), where rg(f)=dim(Im(f)).
Dual Space
The vector space L(E,K) of all linear forms on a vector space E, denoted E∗. If E is finite-dimensional, dim(E∗)=dim(E).
Eigenvalue and Eigenvector
For an endomorphism f∈L(E), a non-zero vector x∈E is an eigenvector if there exists a scalar λ∈K such that f(x)=λx; the scalar λ is the corresponding eigenvalue.
Cayley-Hamilton Theorem
The theorem stating that for any endomorphism f on a finite-dimensional vector space, its characteristic polynomial Pf is an annihilating polynomial for f, meaning Pf(f)=0.
Euclidean Vector Space
A finite-dimensional real vector space equipped with a real inner product (a positive-definite, symmetric bilinear form).
Orthogonal Endomorphism
An endomorphism f on a Euclidean vector space E that preserves the inner product, satisfying ∀x,y∈E,⟨f(x)∣f(y)⟩=⟨x∣y⟩.
Symmetric Endomorphism
An endomorphism f on a Euclidean vector space E that equals its adjoint f∗, satisfying ∀x,y∈E,⟨f(x)∣y⟩=⟨x∣f(y)⟩.