Table of mathematical symbols
In
mathematics, a set of symbols is frequently used in mathematical expressions.
As mathematicians are familiar with these symbols, they are not explained each time they are used.
So, for mathematical novices, the following table lists many common symbols together with their name, pronunciation and related field of mathematics.
Additionally, the second line contains an informal definition, and the third line gives a short example.
Note: If some of the symbols don't display properly for you, then your browser does not completely implement the HTML 4 character entities, or you have to install additional fonts.
You can check your browser here.
| Symbol |
| Name |
| reads as |
| Category |
+
| addition
| plus
| arithmetic
|
| 4 + 6 = 10 means that if four is added to 6, the sum, or result, is 10. |
| 43 + 65 = 108; 2 + 7 = 9
|
−
| subtraction
| minus
| arithmetic
|
| 9 − 4 = 5 means that if 4 is subtracted from 9, the result will be 5. The minus sign also denotes that a number is negative. For example, 5 + (−3) = 2 means that if five and negative three are added, the result is two. |
| 87 − 36 = 51
⇒ →
material implication
implies; if .. then
propositional logic
A ⇒ B means: if A is true then B is also true; if A is false then nothing is said about B. → may mean the same as ⇒, or it may have the meaning for functionss mentioned further down
| x = 2 ⇒ x2 = 4 is true, but x2 = 4 ⇒ x = 2 is in general false (since x could be −2)
⇔ ↔
material equivalence
if and only if; iff
propositional logic
A ⇔ B means: A is true if B is true and A is false if B is false
| x + 5 = y + 2 ⇔ x + 3 = y
∧
logical conjunction
and
propositional logic
the statement A ∧ B is true if A and B are both true; else it is false
| n < 4 ∧ n > 2 ⇔ n = 3 when n is a natural number
∨
logical disjunction
or
propositional logic
the statement A ∨ B is true if A or B (or both) are true; if both are false, the statement is false
| n ≥ 4 ∨ n ≤ 2 ⇔ n ≠ 3 when n is a natural number
¬ /
logical negation
not
propositional logic
the statement ¬A is true if and only if A is false a slash placed through another operator is the same as "¬" placed in front
| ¬(A ∧ B) ⇔ (¬A) ∨ (¬B); x ∉ S ⇔ ¬(x ∈ S)
∀
universal quantification
for all; for any; for each
predicate logic
| ∀ x: P(x) means: P(x) is true for all x |
| ∀ n ∈ N: n2 ≥ n |
∃
existential quantification
there exists
predicate logic
∃ x: P(x) means: there is at least one x such that P(x) is true
| ∃ n ∈ N: n + 5 = 2n
=
equality
equals
everywhere
x = y means: x and y are different names for precisely the same thing
| 1 + 2 = 6 − 3
:= ≡ :⇔
definition
is defined as
everywhere
x := y or x ≡ y means: x is defined to be another name for y (but note that ≡ can also mean other things, such as congruence) P :⇔ Q means: P is defined to be logically equivalent to Q
| cosh x := (1/2)(exp x + exp (−x)); A XOR B :⇔ (A ∨ B) ∧ ¬(A ∧ B)
{ , }
set brackets
the set of ...
set theory
{a,b,c} means: the set consisting of a, b, and c
| N = {0,1,2,...}
{ : } { | }
set builder notation
the set of ... such that ...
set theory
{x : P(x)} means: the set of all x for which P(x) is true. {x | P(x)} is the same as {x : P(''x'\')}.
| {n ∈ N : n2 < 20} = {0,1,2,3,4}
∅ {}
empty set
empty set
set theory
{} means: the set with no elements; ∅ is the same thing
{n ∈ N : 1 < n2 < 4} = {}
∈ ∉
set membership
in; is in; is an element of; is a member of; belongs to
set theory
a ∈ S means: a is an element of the set S; a ∉ S means: a is not an element of S
| (1/2)−1 ∈ N; 2−1 ∉ N
⊆ ⊂
subset
is a subset of
set theory
A ⊆ B means: every element of A is also element of B A ⊂ B means: A ⊆ B but A ≠ B
| A ∩ B ⊆ A; Q ⊂ R
∪
set theoretic union
the union of ... and ...; union
set theory
A ∪ B means: the set that contains all the elements from A and also all those from B, but no others
| A ⊆ B ⇔ A ∪ B = B
∩
set theoretic intersection
intersected with; intersect
set theory
A ∩ B means: the set that contains all those elements that A and B have in common
| { |
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|
|
| | | |
|