Click on one of the titles to access the corresponding symbols table.
Let \( A, B\) be two statements.
|
$$ symbol $$
|
$$ meaning $$
|
$$ explanation $$
|
|---|---|---|
|
$$ \neg A $$
|
$$ not \ A $$
|
This statement is true if \(A\) is false. |
|
$$ A \lor B$$
|
$$ A \ or \ B $$
|
This statement is true if at least one of the two is true. |
|
$$ A \land B$$
|
$$ A \ and \ B $$
|
This statement is true if \(A\) and \(B\) are true simultaneously. |
|
$$ A \Longrightarrow B $$
|
$$ A \ implies \ B $$
$$ (If \ A , \ then \ B) $$
|
This statement means that if \( A \) is true, then \( B \) is too. It is equivalent to \( (\neg A \lor B) \) It also implies that its contraposition \( (\neg B \Longrightarrow \neg A) \) is also true. \( A \Longrightarrow B \) indicates that \( A \) is a sufficient condition for the realization of \( B \), and \( B \) is necessary condition (but not sufficient) for the realization of \( A \). Example: If it rains \( (A) \), then I will take my umbrella \( (B) \). $$ (A \Longrightarrow B) $$
That said, I can take my umbrella even if it can't (for example to protect me from the sun). So the reciprocal is not necessarily true. On the other hand, its contraposition is always true because, if I did not take my umbrella \( ( \neg B) \), then it means for sure that it is not raining \( ( \neg A) \). Otherwise I would have definitely taken it. $$ ( \neg B \Longrightarrow \neg A) $$
|
|
$$ B \Longrightarrow A $$
|
$$ reciprocal \ of \ (A \Longrightarrow B )$$
|
This statement is the inversed statement of \((A \Longrightarrow B ) \). Example: The Pythagorean theorem reciprocal. |
|
$$ A \Longrightarrow \neg B $$
|
$$ negation \ of \ (A \Longrightarrow B )$$
|
This statement is the negation of \((A \Longrightarrow B ) \). Example: If it rains \( (A) \), then I won't take my umbrella \( (\neg B) \). $$ (A \Longrightarrow \neg B) $$
|
|
$$ \neg B \Longrightarrow \neg A $$
|
$$ contraposition \ of \ (A \Longrightarrow B) $$
|
This statement is the contraposition of \((A \Longrightarrow B)\). Example: If I am not taking my umbrella \( (\neg B) \), then it means that it is not raining \( (\neg A) \). $$ ( \neg B \Longrightarrow \neg A) $$
|
|
$$ A \Longleftrightarrow B $$
|
$$ equivalence \ between \ A \ and \ B $$
$$ (A \ if \ and \ only \ if \ B) $$
|
This statement means that \( A \) is true if and only if \( B \) is true. \( A \Longleftrightarrow B \) indicates that \( A \) is a necessary and sufficient condition for the realization of \( B \), and reciprocally. If an implication and its reciprocal are both true, then there is equivalence. $$ (A \Longrightarrow B) \land (B\Longrightarrow A) \equiv (A \Longleftrightarrow B )$$
Example: The Pythagorean theorem and its reciprocal. |
For each line, the statements \( A \) and \( B \) can be either true of false, which makes a total of four cases.
We will note \( 1 \) for a true statement and \( 0 \) for a false statement.
|
$$ A $$
|
$$ B $$
|
$$ \neg A $$
|
$$ \neg B $$
|
$$ A \lor B $$
|
$$ A \land B $$
|
$$ A \Longrightarrow B $$
|
$$ B \Longrightarrow A $$
|
$$ A \Longleftrightarrow B $$
|
|---|---|---|---|---|---|---|---|---|
|
$$ 0 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 1 $$
|
|
$$ 0 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 0 $$
|
|
$$ 1 $$
|
$$ 0 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 0 $$
|
|
$$ 1 $$
|
$$ 1 $$
|
$$ 0 $$
|
$$ 0 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 1 $$
|
$$ 1 $$
|
Let \( A \) be any statement and \( \mathbb{S}\) any set.
|
$$ symbol $$
|
$$ meaning $$
|
|---|---|
|
$$ I = [a, b] $$
|
Interval from \(a\) to \(b\) including \(a\) and \(b\) (closed interval) |
|
$$ I = ]a, b[ $$
|
Interval from \(a\) to \(b\) excluding \(a\) and \(b\) (open interval) |
|
$$ \forall x \in I $$
|
For all \(x\) belonging to the interval \(I\) |
|
$$ \forall (a, b) \in \hspace{0.05em} \mathbb{S}^2 $$
|
For any couple of numbers \((a, b)\), belonging to the \(\mathbb{S}\) set |
|
$$ \exists x \in \mathbb{S}, \ A $$
|
It exists at least one number \(x\) inside the \(\mathbb{S}\) set, such as \(A\) is true |
|
$$ \exists! x \in \mathbb{S}, \ A $$
|
It exists only one number \(x\) inside the \(\mathbb{S}\) set, such as \(A\) is true |
|
$$ \mathbb{N} $$
|
Set of natural numbers: \( \bigl \{0, 1, 2, ..., n \bigr \}\) |
|
$$ [\![ a, n]\!] $$
|
Set of natural numbers from \(a \) until \(n \): \( \bigl \{a, (a +1), (a + 2), ..., n \bigr \}\) $$ [\![ 1, n]\!] = \{1, 2, ..., n\} $$
|
|
$$ \mathbb{Z} $$
|
Set of integers: \( \bigl \{-n, ..., -2, -1, 0, 1, 2, ..., n \bigr \}\) |
|
$$ \mathbb{D} $$
|
Set of decimal numbers. All numbers that can be written in the form: $$ d = \frac{a}{10^b} \hspace{3em} (a \in \mathbb{Z}, \ b \in \mathbb{N}) $$
|
|
$$ \mathbb{Q} $$
|
Set of rational numbers. All numbers that can be written in the form: $$ r = \frac{p}{q} \hspace{3em} (p \in \mathbb{Z}, \ q \in \hspace{0.05em} \mathbb{N}^*) $$
|
|
$$ \mathbb{R} $$
|
Set of real numbers. All rational numbers \( (\in \mathbb{Q}) \) and irrational numbers \( (e, \ \pi, \ \phi, \ \sqrt{2} ...etc.) \). |
|
$$ \mathbb{R} \backslash \Bigl \{a, b, c \Bigr \} $$
|
Set of real numbers deprived of values \(a, b, c \). |
|
$$ \mathbb{C} $$
|
Set of complex numbers. All numbers that can be written in the form: $$ c = a + ib \hspace{3em} ( (a,b) \in \hspace{0.05em} \mathbb{R}^2) $$
|
|
$$ \mathbb{K} $$
|
Set of scalars. All numbers belonging to \( \mathbb{R} \) or \( \mathbb{C} \) |
|
$$ \mathbb{P} $$
|
Set of prime numbers. The set of numbers which have only themselves and \( 1\) as divisors: $$ \mathbb{P} = \Bigl \{2, 3, 5, 7, 11, 13, ...etc. \Bigr\}$$
|
|
$$ \mathbb{K}^{ \mathbb{N}} $$
|
Set of real-valued or complex sequences |
We have the following inclusion for all the sets:
Let \(f\) be any function.
|
$$ symbol $$
|
$$ meaning $$
|
|---|---|
|
$$ D_f $$
|
Function \(f\) definition set |
|
$$ f(x) = x^2$$
|
Definition of a function \(f\) having as variable \(x\) and as image \(x^2\) |
|
$$ f :x \longmapsto x^2 $$
|
Definition of a function \(f\) having as variable \(x\) and as image \(x^2\) |
|
$$ (f \circ g) (x) $$
|
Definition of a composite function \(f \circ g\) (read "\(f \) round \(g \)") having as variable \(x\) $$(f \circ g) (x) = f\bigl(g(x)\bigr) $$
We can as well create composites of composites functions: $$(f \circ g \circ h ) (x) = f\Bigl(g\bigl(h(x)\bigr)\Bigr) $$
$$...etc. $$
|
|
$$ \Biggl( \overset{n}{\underset{k=1}{\bigcirc f_k}} \ \Biggr ) (x) $$
$$ (non-official \ symbol \ a \ priori) $$
|
Composite functions operator: $$ \Biggl( \overset{n}{\underset{k=1}{\bigcirc f_k}} \ \Biggr ) (x) = \Bigl(f_1 \circ f_2 \circ f_3 \circ \ ... \ \circ f_{n-1} \circ f_{n}\Bigr)(x) $$
|
|
$$ f' $$
|
Derivative of the function \(f\) (Lagrange's notation) |
|
$$ \frac{df}{dx} $$
|
Derivative of the function \(f\) in relation to \(x\) (Leibniz's notation) |
|
$$ f^{(n)}$$
|
\(n\)-th derivative of the function \(f\) |
|
$$ function \ of \ class \ \mathcal {C}^n \ on \ I $$
|
Continuous and \(n\)-times derivable function on the interval \(I\) |
|
$$ \frac{\partial y}{\partial x} dx $$
|
Partial derivative of a function \(y = f(x, z,t) \) of several variables including \(x\), in relation to \(x\) uniquely. |
|
$$ dy = \frac{\partial y}{\partial x} dx + \frac{\partial y}{\partial z}dz + \frac{\partial y}{\partial t}dt $$
|
Derivative of a function \(y = f(x, z, t ) \) having independent variables \(x, z, t \). It is the sum of all partial derivatives with respect to each variable respectively. |
|
$$ TS_n(a) $$
|
Taylor series or order \(n\) in the neighbourhood of \(x = a\) (often \(0\)) |
|
$$ \int^x f(t) \ dt $$
|
The family of antiderivatives of the function \(f\) up to a constant. |
|
$$ \int_a^x f(t) \ dt $$
|
Definite integral from \(a\) to \(x\) of the function \(f\). Graphically, this corresponds to the area under the curve of the function \(f\) in the interval \([a, x]\), and this is also the integral of \(f\) which vanishes at \(a\). |
|
$$ \int_a^b f(t) \ dt $$
|
Integral from \(a\) to \(b\) of the function \(f\). Graphically, this corresponds to the area under the curve of the function \(f\) in the interval \([a, b]\). |
|
$$ \sum_{k=0}^n \ f(k) $$
|
Sum from \(0\) until \(n\) of the \(f(k)\): $$ \sum_{k=0}^n \ f(k) = f(0) + f(1) + ... + f(n) $$
|
|
$$ \sum u_n $$
|
Numerical series associated with a sequence \( (u_n)_{n \in \mathbb{N}}\) |
|
$$ S_n = \sum_{k=0}^n u_n $$
|
Partial sum of the series \( \sum u_n\), from \(0\) until \(n\) |
|
$$ R_n = \sum_{k=n+1}^{+ \infty} u_n $$
|
Remainder of the series \( \sum u_n\): $$ \sum u_n = S_n + R_n = \sum_{k=0}^n u_n + \sum_{k=n+1}^{+ \infty} u_n $$
|
|
$$ \prod_{k= 0}^n \ f(k) $$
|
Product from \(0\) until \(n\) of the \(f(k)\): $$ \prod_{k=0}^n \ f(k) = f(0) f(1) ... f(n) $$
|
|
$$ lim_{x \to a} \ f(x) = l $$
|
Limit of a function \(f \) when \(x \) tends towards \( a \). \( a \) and \( l \) can be a number or an extremity \( (-\infty\) or \(+\infty) \) . |
|
$$ f(x) \underset{a}{\longmapsto} l $$
|
Limit of a function \(f \) when \(x \) tend towards \( a \) (shortened writing) We read: "\( f(x) \) tends towards \( l \), when \(x \) tends towards \( a \)". |
|
$$ n! $$
|
Factorial of \(n \): $$n! = n \times (n-1) \times (n-2) \ \times \ ... \ \times \ 2 \times 1$$
|
|
$$ \binom{n}{k} $$
|
The number of ways to pick \( k \) elements among \(n \). We read: "\( k \) among \(n \)". $$\binom{n}{k} = \frac{n !}{(n-k)! \ k !}$$
|
|
$$ M = \begin{pmatrix} x_{1,1} & x_{1,2} & x_{1,3} & \dots & x_{1, m} \\ x_{2,1} & x_{2,2} & x_{2,3} & \dots & x_{2, m} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ x_{n,1} & x_{n,2} & x_{n,3} & \dots & x_{n, m} \\ \end{pmatrix} $$ |
The matrix \( M \) having \( n \) lines and \( p \) columns. |
|
$$ M_3 = \ \begin{pmatrix} x_{1,1} & x_{1,2} & x_{1,3} \\ x_{2,1} & x_{2,2} & x_{2,3} \\ x_{3,1} & x_{3,2} & x_{3,3} \\ \end{pmatrix} $$ |
The sqaure matrix \( M_3 \) having \( 3 \) lines and \( 3 \) columns. |
|
$$ \underbrace{ \begin{pmatrix} x_{1,1} & x_{1,2} & x_{1,3} & \dots & x_{1, p} \\ x_{2,1} & x_{2,2} & x_{2,3} & \dots & x_{2, p} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ x_{n,1} & x_{n,2} & x_{n,3} & \dots & x_{n, p} \\ \end{pmatrix} } _\text{M} \times \underbrace{ \begin{pmatrix} a_0 \\ a_1 \\ a_2 \\ . \\ a_n \\ \end{pmatrix} } _\text{A} = \underbrace{ \begin{pmatrix} y_0 \\ y_1 \\ y_2 \\ . \\ y_n \\ \end{pmatrix} } _\text{Y} $$ |
The matrix multiplication between the matrix \( M\) and the matrix \( A\). The number of columns of the matrix \( M\) must be the same as the number of lines of the matrix \( A\). The result of it, the matrix \( Y\), is a matrix of the same nature than the one positionned at the right of the product. |
|
$$ det(M) = \begin{vmatrix} x_{1,1} & x_{1,2} & x_{1,3} & \dots & x_{1, p} \\ x_{2,1} & x_{2,2} & x_{2,3} & \dots & x_{2, p} \\ \vdots & \vdots & \vdots & \ddots & \vdots \\ x_{n,1} & x_{n,2} & x_{n,3} & \dots & x_{n, p} \\ \end{vmatrix} $$ |
The determinant of the matrix \( M \) having \( n \) lines and \( p \) columns. |
|
$$ A \in \hspace{0.03em} \mathcal{M}_{n,p} (\mathbb{K})$$
|
The matrix \(A\) belonging to set of all matrix (and more precisely the vector space) having \(n\) lines and \(p\) columns on the field \(\mathbb{K}\). |
|
$$ A \in \hspace{0.03em} \mathcal{M}_{n} (\mathbb{K})$$
|
The squared matrix \(A\) belonging to set of all squared matrix (and more precisely the vector space) of the size \(n\) on the field \(\mathbb{K}\). |
Let be \((a, b) \in \hspace{0.05em} \mathbb{Z}^2\) two integers.
|
$$ symbol $$
|
$$ meaning $$
|
|---|---|
|
$$ \mathcal{D}(a)$$
|
The set of divisors of \(a\) |
|
$$ p \in \mathbb{P}$$
|
\(p\) is a prime number |
|
$$ \mathcal{D}(p) = \{1, p\}$$
|
\(p\) is a prime number |
|
$$ a / b$$
|
\(a\) divides \(b\) |
|
$$ a \nmid b $$
|
\(a\) does not divide \(b\) |
|
$$ \mathcal{D}(a, b) $$
|
The set of common divisors of \(a\) and \(b\) |
|
$$ \delta = GCD(a, b)= a \wedge b $$
|
\( \delta\) is the greatest common divisor of \(a\) and \(b\). |
|
$$ a \wedge b = 1 $$
|
\(a\) and \(b\) are coprime. We can also say that they are "foreigners". |
|
$$ LCM(a, b) $$
|
\( LCM(a, b) \) is the lowest common multiple of \(a\) and \(b\). |
|
$$ a \equiv b \hspace{0.2em} [n] $$
|
\(a\) and \(b\) are congruent modulo \(n\). We say that \(a\) and \(b\) are congruent modulo \(n\) f they have the same remainder \(R\) in the Euclidian division by \(n\). $$ a \equiv b \hspace{0.2em} [n] \Longleftrightarrow \exists (q, q') \in \hspace{0.05em} \mathbb{N}^2, \enspace \exists R \in \hspace{0.05em} \mathbb{N}, \enspace 0 \leqslant R < n, \ \Biggl \{ \begin{align*} a = nq + R \\ b= nq' + R \end{align*} $$ |
Let \( \vec{u}\) and \( \vec{v}\) be two vectors.
|
$$ symbol $$
|
$$ meaning $$
|
|---|---|
|
$$ \vec{u} $$
|
A vector \(\vec{u} \) |
|
$$ \vec{u}\begin{pmatrix} x\\ y\\ z \end{pmatrix} $$ |
A vector \(\vec{u} \) having as coordinates \(x, y ,z \) |
|
$$ || \vec{u} || $$
|
The norm (or length) of a vector \( \vec{u}\). Let be a vector \(\vec{u} \begin{pmatrix} x\\ y\\z \end{pmatrix}\), then its norm is worth: $$ || \vec{u} || = \sqrt{x^2 + y^2 + z^2}$$
|
|
$$ \vec{u}. \vec{v}$$
|
The scalar product of two vectors \( \vec{u}\) and \( \vec{v}\) is worth: $$ \vec{u}. \vec{v} = || \vec{u} || \times || \vec{v} || \times cos( (\vec{u}, \vec{v}) ) $$
Otherwise, depending on the coordinates, if we have two vectors \(\vec{u}\begin{pmatrix} x\\ y\\z \end{pmatrix}\) and \(\vec{v} \begin{pmatrix} x'\\ y'\\z' \end{pmatrix}\), then this scalar product is worth: $$ \vec{u}. \vec{v} = xx' + yy' +zz' $$
|
|
$$ \vec{u} \land \vec{v}$$
|
The vector product of vectors \(\vec{u}\begin{pmatrix} x\\ y\\z \end{pmatrix}\) and \(\vec{v} \begin{pmatrix} x'\\ y'\\z' \end{pmatrix}\) is worth: $$ \vec{u} \land \vec{v} = \begin{pmatrix} y_1.z_2 - y_2.z_1 \\ x_2.z_1 - x_1.z_2 \\ x_1.y_2 - x_2.y_1 \end{pmatrix} $$
|
|
$$ letter $$
|
$$ min $$
|
$$ maj $$
|
$$ example \ of \ using $$
|
|---|---|---|---|
|
$$ alpha $$
|
$$ \alpha $$ |
$$ A $$ |
Measuring an angle |
|
$$ b\textit{ê}ta $$
|
$$ \beta $$ |
$$ B $$ |
Measuring an angle |
|
$$ gamma $$
|
$$ \gamma $$ |
$$ \Gamma $$ |
Measuring an angle |
|
$$ delta $$
|
$$ \delta $$ |
$$ \Delta $$ |
Difference between two physically measurable elements. Examples:
$$ m = \frac{\Delta y}{\Delta x} = \frac{ y_b - y_a }{ x_b - x_a }$$
$$ \Delta = b^2 - 4ac$$
|
|
$$ epsilon $$
|
$$ \varepsilon $$ |
$$ E $$ |
Infinitesimal element. If a function is derivable, it admits a Taylor series order \( 1\) at point \(a\) such as: $$f(x) \underset{a}{ =} f(a) + f'(a)(x-a) + (x-a) . \varepsilon(x-a)$$
$$ (with \enspace lim_{x \to a} \ \varepsilon(x-a) = 0)$$
|
|
$$ z \textit{ê}ta $$
|
$$ \zeta $$ |
$$ Z $$ |
$$\zeta (s) = \sum_{k=1}^{+\infty} \frac{1}{k^s} = 1 + \frac{1}{2^s} +\frac{1}{3^s}... $$
|
|
$$ \textit{ê}ta $$
|
$$ \eta $$ |
$$ H $$ |
A yield. Example: a yield of a boiler $$\eta = { P_u \over P_a } $$
|
|
$$ th\textit{ê}ta $$
|
$$ \theta $$ |
$$ \Theta $$ |
Variable of an angle. Example: the exponential form of a complex $$ e^{i \theta} = cos(\theta) + isin(\theta) $$
|
|
$$ iota $$
|
$$ \iota $$ |
$$ I $$ |
$$ $$ |
|
$$ kappa $$
|
$$ \kappa $$ |
$$ K $$ |
$$ $$ |
|
$$ lambda $$
|
$$ \lambda $$ |
$$ \Lambda $$ |
Any real number. Example: the derivative of a function multiplied by a constant $$ (\lambda f)' = \lambda f' $$
|
|
$$ mu $$
|
$$ \mu $$ |
$$ M $$ |
Any real number. Example: linearity of integrals $$ \int_{a}^b \biggl(\lambda f(t) + \mu g(t) \hspace{0.2em} \biggr) dt = \lambda \int_{a}^b f(t) \hspace{0.2em}dt + \mu \int_{a}^b g(t) \hspace{0.2em}dt $$
|
|
$$ nu $$
|
$$ \nu $$ |
$$ N $$ |
The neighbourhood \(\nu_a\) of a point \(a\) |
|
$$ xi $$
|
$$ \xi $$ |
$$ \Xi $$ |
Any value between two values (often on the x-axis) |
|
$$ omicron $$
|
$$ o $$ |
$$ O $$ |
|
|
$$ pi $$
|
$$ \pi $$ |
$$ \Pi $$ |
Mathematical constant representing the ratio between the half-perimeter and the diameter of a circle of radius \( R = 1 \). $$ \pi \approx 3.14159... $$
This symbol is also used to represent a product of factors: $$ \prod_{k = 1}^n k = 1 \times 2 \hspace{0.1em} \times \hspace{0.1em} ... \hspace{0.1em} \times \hspace{0.1em} (n-1) \times n \hspace{0.1em} \hspace{0.1em} = n!$$
|
|
$$ rho $$
|
$$ \rho $$ |
$$ P $$ |
Measuring a density: $$ \rho = \frac{m}{V}$$
|
|
$$ sigma $$
|
$$ \sigma $$ |
$$ \Sigma $$ |
Sum operator: $$ \sum_{k=0}^n k = 0 + 1 + 2 \ + \ ... \ + \ n $$
|
|
$$ tau $$
|
$$ \tau $$ |
$$ T $$ |
A rate |
|
$$ upsilon $$
|
$$ \upsilon $$ |
$$ \Upsilon $$ |
$$ $$ |
|
$$ phi $$
|
$$ \phi $$ |
$$ \Phi $$ |
The golden ratio (mathematical constant): $$ \phi = \frac{1 + \sqrt{5}}{2} $$
Sometimes used to represent some function. |
|
$$ chi \ (pronounced "ki") $$
|
$$ \chi $$ |
$$ X $$ |
|
|
$$ psi $$
|
$$ \psi $$ |
$$ \Psi $$ |
|
|
$$ omega $$
|
$$ \omega $$ |
$$ \Omega $$ |
Angular frequency of periodic functions: $$ g(t) = A \ cos(\omega t + \phi)$$
|
Go to the top of the page
Index