Mathematical symbols reference
A searchable reference to symbols commonly found in discrete mathematics, algorithms and theoretical computer science.
Logic and quantifiers
| Symbol | Read as | Meaning | Example |
|---|---|---|---|
| β | There exists | At least one element satisfies the property. | β x β β : x > 5 |
| β! | There exists a unique | Exactly one element satisfies the property. | β! x β β : x + 1 = 2 |
| β | For every | The property holds for every element under consideration. | β n β β, n + 1 > n |
| Β¬ | Not | Negates a proposition. | Β¬(x > 5) |
| β§ | And | Both conditions must be true. | x > 0 β§ x < 10 |
| β¨ | Or | At least one condition must be true. | x < 0 β¨ x > 10 |
| β | Implies | If the left-hand proposition is true, so is the right-hand one. | x > 2 β x > 0 |
| β | Is implied by | The right-hand proposition implies the left-hand one. | x > 0 β x > 2 |
| β | If and only if | The two propositions are equivalent. | n is even β n = 2k |
| : | Such that | Introduces a condition or property. | {x β β : x > 5} |
| β΄ | Therefore | Introduces a conclusion. | x = 2 β΄ xΒ² = 4 |
Relations
| Symbol | Read as | Meaning | Example |
|---|---|---|---|
| = | Equal to | The two values coincide. | x = 5 |
| β | Not equal to | The two values do not coincide. | x β 0 |
| < | Less than | The value on the left is smaller. | 3 < 5 |
| > | Greater than | The value on the left is larger. | 8 > 2 |
| β€ | Less than or equal to | Less than or equal to. | x β€ 10 |
| β₯ | Greater than or equal to | Greater than or equal to. | n β₯ nβ |
| β | Approximately equal to | Approximate equality. | Ο β 3.14159 |
| β‘ | Equivalent to | Equivalence or identity, depending on context. | a β‘ b (mod n) |
| β | Proportional to | One quantity varies in proportion to another. | y β x |
Sets
| Symbol | Read as | Meaning | Example |
|---|---|---|---|
| β | Belongs to | The element belongs to the set. | 3 β β |
| β | Does not belong to | The element does not belong to the set. | β2 β β |
| β | Contains | The inverse membership relation. | β β 3 |
| β | Empty set | A set containing no elements. | A = β
|
| β | Subset of | Every element of the first set belongs to the second. | {1,2} β β |
| β | Proper subset of | A subset that is not equal to the other set. | {1,2} β {1,2,3} |
| β | Superset of | The inverse relation of β. | β β {1,2} |
| βͺ | Union | Elements belonging to at least one of the two sets. | A βͺ B |
| β© | Intersection | Elements belonging to both sets. | A β© B |
| \ | Difference | Elements in the first set but not in the second. | A \ B |
| |A| | Cardinality of A | The number of elements in the set. | |{a,b,c}| = 3 |
| A Γ B | Cartesian product | The set of ordered pairs formed from elements of A and B. | (a,b) β A Γ B |
Number sets
| Symbol | Name | Contents | Example |
|---|---|---|---|
| β | Natural numbers | 0, 1, 2, 3, β¦ depending on the chosen convention. | 5 β β |
| β€ | Integers | β¦, β2, β1, 0, 1, 2, β¦ | β3 β β€ |
| β | Rational numbers | Numbers representable as a fraction of integers. | 1/3 β β |
| β | Real numbers | Includes rational and irrational numbers. | β2 β β |
| β | Complex numbers | Numbers of the form a + bi. | 2 + 3i β β |
Inclusion relation: β β β€ β β β β β β.
Intervals
| Notation | Meaning | Equivalent form | Notes |
|---|---|---|---|
| [a,b] | Both endpoints included. | a β€ x β€ b | Closed interval. |
| (a,b) | Both endpoints excluded. | a < x < b | Open interval; ]a,b[ is another convention. |
| [a,b) | a included, b excluded. | a β€ x < b | Half-open interval. |
| (a,b] | a excluded, b included. | a < x β€ b | Half-open interval. |
| (ββ,a) | All values less than a. | x < a | An infinite endpoint is always open. |
| [a,+β) | All values greater than or equal to a. | x β₯ a | An infinite endpoint is always open. |
Functions
| Symbol | Read as | Meaning | Example |
|---|---|---|---|
| f: A β B | f from A to B | The function has domain A and codomain B. | f: β β β |
| x β¦ f(x) | x maps to f(x) | Describes the transformation applied to the argument. | x β¦ xΒ² |
| f(x) | f of x | The value produced by the function at x. | f(3) = 9 |
| fβ»ΒΉ | Inverse function | Reverses the function when an inverse exists. | fβ»ΒΉ(f(x)) = x |
| f β g | f composed with g | Apply g first, then f. | (f β g)(x) = f(g(x)) |
| dom(f) | Domain of f | The set of allowed input values. | dom(f) = β |
| Im(f) | Image of f | The set of values actually produced. | Im(f) β B |
Operators, sequences and rounding
| Symbol | Read as | Meaning | Example |
|---|---|---|---|
| Ξ£ | Summation | The sum of a sequence of terms. | Ξ£α΅’βββΏ i |
| Ξ | Product | The product of a sequence of terms. | Ξ α΅’βββΏ i = n! |
| |x| | Absolute value | The distance of x from zero. | |β5| = 5 |
| βxβ | Floor | The greatest integer less than or equal to x. | β3.8β = 3 |
| βxβ | Ceiling | The least integer greater than or equal to x. | β3.2β = 4 |
| n! | Factorial | The product of positive integers from 1 to n. | 5! = 120 |
| β | Infinity | Unbounded growth or extent. | n β β |
| log n | Logarithm of n | Often base 2 in algorithms unless otherwise stated. | logβ 8 = 3 |
Asymptotic notation
| Symbol | Read as | Intuitive meaning | Example |
|---|---|---|---|
| O(g(n)) | Big O of g(n) | Upper bound: f grows no faster than g. | 3nΒ² + 2 β O(nΒ²) |
| Ξ©(g(n)) | Big Omega of g(n) | Lower bound: f grows at least as fast as g. | 3nΒ² + 2 β Ξ©(nΒ²) |
| Ξ(g(n)) | Theta of g(n) | Tight bound: f grows like g up to constant factors. | 3nΒ² + 2 β Ξ(nΒ²) |
| o(g(n)) | Little o of g(n) | f grows strictly more slowly than g. | n β o(nΒ²) |
| Ο(g(n)) | Little omega of g(n) | f grows strictly faster than g. | nΒ² β Ο(n) |
MathML example: definition of Ξ
This formula is written directly in MathML without external libraries.
Read as: there are positive constants cβ, cβ and nβ such that, for every n β₯ nβ, f(n) lies between cβg(n) and cβg(n).
Standalone page: no framework, CDN or external JavaScript required.