Glossary of mathematical symbols

This is a list of symbols found within all branches of mathematics to express a formula or to represent a constant.

When reading the list, it is important to recognize that a mathematical concept is independent of the symbol chosen to represent it. For many of the symbols below, the symbol is usually synonymous with the corresponding concept (ultimately an arbitrary choice made as a result of the cumulative history of mathematics), but in some situations a different convention may be used. For example, depending on context, the triple bar " $\equiv$ " may represent congruence or a definition. Further, in mathematical logic, numerical equality is sometimes represented by " $\equiv$ " instead of " $=$ ", with the latter representing equality of well-formed formulas. In short, convention dictates the meaning.

Each symbol is shown both in HTML, whose display depends on the browser's access to an appropriate font installed on the particular device, and typeset as an image using TeX.

Guide

This list is organized by symbol type and is intended to facilitate finding an unfamiliar symbol by its visual appearance. For a related list organized by mathematical topic, see List of mathematical symbols by subject. That list also includes LaTeX and HTML markup and Unicode code points for each symbol.

Basic symbols: Symbols widely used in mathematics, roughly through first-year calculus. More advanced meanings are included with some symbols listed here.
Symbols based on equality " $=$ ": Symbols derived from or similar to the equal sign, including double-headed arrows. Not surprisingly these symbols are often associated with an equivalence relation.
Symbols that point left or right: Symbols, such as $<$ and $>$ , that appear to point to one side or another.
Brackets: Symbols that are placed on either side of a variable or expression, such as $| x |$ .
Other non-letter symbols: Symbols that do not fall in any of the other categories.
Letter-based symbols: Many mathematical symbols are based on, or closely resemble, a letter in some alphabet. This section includes such symbols, including symbols that resemble upside-down letters. Many letters have conventional meanings in various branches of mathematics and physics. These are not listed here. The See also section, below, has several lists of such usages.
- Letter modifiers: Symbols that can be placed on or next to any letter to modify the letter's meaning.
- Symbols based on Latin letters, including those symbols that resemble or contain an $X$
- Symbols based on Hebrew or Greek letters e.g. $ב ,א, δ, Δ, π, Π, σ, Σ, Φ.$ Note: symbols resembling $Λ$ are grouped with " $V$ " under Latin letters.
Variations: Usage in languages written right-to-left

Basic symbols

Symbol
in HTML Symbol
in TeX Name Explanation Examples

Read as

Symbols based on equality

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$=$	$=$	equality is equal to; equals everywhere	$x=y$ means $x$ and $y$ represent the same math object (Both symbols have the same value).	$2=2$ $1+1=2$ $36-5=31$
$\neq$	$\neq$ \ne	inequality is not equal to; does not equal everywhere	$x\neq y$ means that $x$ and $y$ do not represent the same math object (Both symbols do not have the same value). (The forms !=, /= or <> are generally used in programming languages where ease of typing and use of ASCII text is preferred.)	$2+2\neq 5$ $36-5\neq 30$
$\approx$	$\approx$ \approx	approximately equal is approximately equal to everywhere	x ≈ y means x is approximately equal to y. This may also be written ≃, ≅, ~, ♎ (Libra Symbol), or ≒.	π ≈ 3.14159
$\approx$	$\approx$ \approx	isomorphism is isomorphic to group theory	G ≈ H means that group G is isomorphic (structurally identical) to group H. (≅ can also be used for isomorphic, as described below.)	Q₈ / C₂ ≈ V
$~$	$\sim$ \sim	probability distribution has distribution statistics	X ~ D, means the random variable X has the probability distribution D.	X ~ N(0,1), the standard normal distribution
		row equivalence is row equivalent to matrix theory	A ~ B means that B can be generated by using a series of elementary row operations on A	${\begin{bmatrix}1&2\\2&4\\\end{bmatrix}}\sim {\begin{bmatrix}1&2\\0&0\\\end{bmatrix}}$
		same order of magnitude roughly similar; poorly approximates; is on the order of approximation theory	m ~ n means the quantities m and n have the same order of magnitude, or general size. (Note that ~ is used for an approximation that is poor, otherwise use ≈ .)	2 ~ 5 8 × 9 ~ 100 but π² ≈ 10
		similarity is similar to^[1] geometry	△ABC ~ △DEF means triangle ABC is similar to (has the same shape) triangle DEF.
		asymptotically equivalent is asymptotically equivalent to asymptotic analysis	f ~ g means $\lim _{n\to \infty }{\frac {f(n)}{g(n)}}=1$ .	x ~ x+1
		equivalence relation are in the same equivalence class everywhere	a ~ b means $b\in [a]$ (and equivalently $a\in [b]$ ).	1 ~ 5 mod 4
$=:$ $:=$ $\equiv$ $:\Leftrightarrow$ $≜$ $≝$ $≐$	$=:$ $:=$ $\equiv$ $:\Leftrightarrow$ $\triangleq$ ${\overset {\underset {\mathrm {def} }{}}{=}}$ $\doteq$	definition is defined as; is equal by definition to everywhere	x := y, y =: x or x ≡ y means x is defined to be another name for y, under certain assumptions taken in context. (Some writers use ≡ to mean congruence). P ⇔ Q means P is defined to be logically equivalent to Q. P ⇔ Q means if and only if (iff)	$\cosh x:={\frac {e^{x}+e^{-x}}{2}}$ $[a,b]:=a\cdot b-b\cdot a$
$≅$	$\cong$ \cong	congruence is congruent to geometry	△ABC ≅ △DEF means triangle ABC is congruent to (has the same measurements as) triangle DEF.
$≅$	$\cong$ \cong	isomorphic is isomorphic to abstract algebra	G ≅ H means that group G is isomorphic (structurally identical) to group H. (≈ can also be used for isomorphic, as described above.)	V ≅ C₂ × C₂
$\equiv$	$\equiv$ \equiv	congruence relation ... is congruent to ... modulo ... modular arithmetic	a ≡ b (mod n) means a − b is divisible by n	5 ≡ 2 (mod 3)
$\Leftrightarrow$ $\leftrightarrow$	$\Leftrightarrow$ \Leftrightarrow $\leftrightarrow$ \leftrightarrow	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

Symbols that point east or west

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$<$ $>$	$<$ $>$	strict inequality is less than, is greater than order theory	$x<y$ means $x$ is less than $y$ . $x>y$ means $x$ is greater than $y$ .	$3<4$ $5>4$
$<$ $>$	$<$ $>$	proper subgroup is a proper subgroup of group theory	$H<G$ means $H$ is a proper subgroup of $G$ .	$5\mathrm {Z} <\mathrm {Z}$ $\mathrm {A} _{3}<\mathrm {S} _{3}$
$≪$ $≫$	$\ll \!\,$ $\gg \!\,$ \ll \gg	significant (strict) inequality is much less than, is much greater than order theory	$x ≪ y$ means x is much less than y. $x ≫ y$ means x is much greater than y.	$0.003 ≪ 1000000$
		asymptotic comparison is of smaller order than, is of greater order than analytic number theory	$f ≪ g$ means the growth of f is asymptotically bounded by g. (This is I. M. Vinogradov's notation. Another notation is the Big O notation, which looks like $f = O(g)$ .)	$x ≪ e x$
		absolute continuity is absolutely continuous with respect to measure theory	$\mu \ll \nu$ means that $\mu$ is absolutely continuous with respect to $\nu$ , i.e., whenever $\nu (A)=0$ , we have $\mu (A)=0$ .	If $c$ is the counting measure on $[0,1]$ and $\mu$ is the Lebesgue measure, then $\mu \ll c$ .
$\leq$ $\geq$	$\leq \!\,$ $\geq$ \le \ge	inequality is less than or equal to, is greater than or equal to order theory	$x \leq y$ means x is less than or equal to y. $x \geq y$ means x is greater than or equal to y. (The forms <= and >= are generally used in programming languages, where ease of typing and use of ASCII text is preferred.)	$3 \leq 4$ and $5 \leq 5$ $5 \geq 4$ and $5 \geq 5$
		subgroup is a subgroup of group theory	$H \leq G$ means H is a subgroup of G.	$Z \leq Z$ $A 3 \leq S 3$
		reduction is reducible to computational complexity theory	$A \leq B$ means the problem A can be reduced to the problem B. Subscripts can be added to the ≤ to indicate what kind of reduction.	If $\exists f\in F{\mbox{ . }}\forall x\in \mathbb {N} {\mbox{ . }}x\in A\Leftrightarrow f(x)\in B$ then $A\leq _{F}B$
$≦$ $≧$	$\leqq \!\,$ $\geqq \!\,$ \leqq \geqq	congruence relation ... is less than ... is greater than ... modular arithmetic		$10 a \equiv 5 (mod 5) for 1 ≦ a ≦ 10$
$≦$ $≧$	$\leqq \!\,$ $\geqq \!\,$ \leqq \geqq	vector inequality ... is less than or equal... is greater than or equal... order theory	$x ≦ y$ means that each component of vector x is less than or equal to each corresponding component of vector y. $x ≧ y$ means that each component of vector x is greater than or equal to each corresponding component of vector y. It is important to note that $x ≦ y$ remains true if every element is equal. However, if the operator is changed, $x \leq y$ is true if and only if $x \neq y$ is also true.
$≺$ $≻$	$\prec \!\,$ $\succ \!\,$ \prec \succ	Karp reduction is Karp reducible to; is polynomial-time many-one reducible to computational complexity theory	$L 1 ≺ L 2$ means that the problem L₁ is Karp reducible to L₂.^[2]	If $L 1 ≺ L 2 and L 2 \in P$ , then $L 1 \in P$ .
$≺$ $≻$	$\prec \!\,$ $\succ \!\,$ \prec \succ	Nondominated order is nondominated by Multi-objective optimization	$P ≺ Q$ means that the element P is nondominated by element Q.^[3]	If $P 1 ≺ Q 2$ then $\forall _{i}P_{i}\leq Q_{i}\land \exists P_{i}<Q_{i}$
$◅$ $▻$ ◅ ▻	$\triangleleft \!\,$ $\triangleright \!\,$ \triangleleft \triangleright	normal subgroup is a normal subgroup of group theory	$N ◅ G$ means that N is a normal subgroup of group G.	$Z(G) ◅ G$
		ideal is an ideal of ring theory	$I ◅ R$ means that I is an ideal of ring R.	$(2) ◅ Z$
		antijoin the antijoin of relational algebra	$R ▻ S$ means the antijoin of the relations R and S, the tuples in R for which there is not a tuple in S that is equal on their common attribute names.	$R\triangleright S=R-R\ltimes S$
$\Rightarrow$ $\to$ $\supset$	$\Rightarrow \!\,$ $\rightarrow \!\,$ $\supset \!\,$	material implication implies; if ... then propositional logic, Heyting algebra	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 functions given below.) (⊃ may mean the same as ⇒,^[4] or it may have the meaning for superset given below.)	$x = 6 \Rightarrow x 2 -5 = 36-5 = 31$ is true, but $x 2 -5 = 36-5 = 31 \Rightarrow x = 6$ is in general false (since x could be −6).
$\subseteq$ $\subset$	$\subseteq \!\,$ $\subset \!\,$	subset is a subset of set theory	(subset) $A \subseteq B$ means every element of A is also an element of B.^[5] (proper subset) $A \subset B$ means $A \subseteq B$ but $A \neq B$ . (Some writers use the symbol ⊂ as if it were the same as ⊆.)	$(A \cap B) \subseteq A ℕ \subset ℚ ℚ \subset ℝ$
$\supseteq$ $\supset$	$\supseteq \!\,$ $\supset \!\,$	superset is a superset of set theory	$A \supseteq B$ means every element of B is also an element of A. $A \supset B$ means $A \supseteq B$ but $A \neq B$ . (Some writers use the symbol ⊃ as if it were the same as ⊇.)	$(A \cup B) \supseteq B ℝ \supset ℚ$
$\to$	$\to \!\,$	function arrow from ... to set theory, type theory	$f : X \to Y$ means the function f maps the set X into the set Y.	Let f: ℤ → ℕ ∪ {0} be defined by $f (x) := x 2$ .
$\mapsto$	$\mapsto \!\,$	function arrow maps to set theory	$f : a \mapsto b$ means the function f maps the element a to the element b.	Let $f : x \mapsto x + 1$ (the successor function).
$<:$ $<\cdot$	$<:\!\,$ ${<}{\cdot }\!\,$	subtype is a subtype of type theory	$T 1 <: T 2$ means that T₁ is a subtype of T₂.	If $S <: T$ and $T <: U$ then $S <: U$ (transitivity).
$<:$ $<\cdot$	$<:\!\,$ ${<}{\cdot }\!\,$	cover is covered by order theory	$x <• y$ means that x is covered by y.	${1, 8} <• {1, 3, 8}$ among the subsets of ${1, 2, ..., 10}$ ordered by containment.
$⊧$	$\vDash \!\,$	entailment entails model theory	$A ⊧ B$ means the sentence A entails the sentence B, that is in every model in which A is true, B is also true.	$A ⊧ A \lor \neg A$
$⊢$	$\vdash \!\,$	inference infers; is derived from propositional logic, predicate logic	$x ⊢ y$ means y is derivable from x.	$A \to B ⊢ \neg B \to \neg A$
$⊢$	$\vdash \!\,$	partition is a partition of number theory	$p ⊢ n$ means that p is a partition of n.	$(4,3,1,1) ⊢ 9$ , $\sum _{\lambda \vdash n}(f_{\lambda })^{2}=n!$
$⟨\|$	$\langle \ \|\!\,$	bra vector the bra ...; the dual of ... Dirac notation	⟨φ\| means the dual of the vector \|φ⟩, a linear functional which maps a ket \|ψ⟩ onto the inner product ⟨φ\|ψ⟩.
$\|⟩$	$\|\ \rangle \!\,$	ket vector the ket ...; the vector ... Dirac notation	\|φ⟩ means the vector with label φ, which is in a Hilbert space.	A qubit's state can be represented as α\|0⟩+ β\|1⟩, where α and β are complex numbers s.t. $\| α \| 2 + \| β \| 2 = 1$ .

Brackets

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
	${\ \choose \ }$	combination; binomial coefficient n choose k combinatorics	${\begin{pmatrix}n\\k\end{pmatrix}}={\frac {n!/(n-k)!}{k!}}={\frac {(n-k+1)\cdots (n-2)\cdot (n-1)\cdot n}{k!}}$ means (in the case of n = positive integer) the number of combinations of k elements drawn from a set of n elements. (This may also be written as C(n, k), C(n; k), _nC_k, ⁿC_k, or $\left\langle {\begin{matrix}n\\k\end{matrix}}\right\rangle$ .)	${\begin{pmatrix}36\\5\end{pmatrix}}={\frac {36!/(36-5)!}{5!}}={\frac {32\cdot 33\cdot 34\cdot 35\cdot 36}{1\cdot 2\cdot 3\cdot 4\cdot 5}}=376992$ ${\begin{pmatrix}.5\\7\end{pmatrix}}={\frac {-5.5\cdot -4.5\cdot -3.5\cdot -2.5\cdot -1.5\cdot -.5\cdot .5}{1\cdot 2\cdot 3\cdot 4\cdot 5\cdot 6\cdot 7}}={\frac {33}{2048}}\,\!$
	$\left(\!\!{\ \choose \ }\!\!\right)$	multiset coefficient u multichoose k combinatorics	$\left(\!\!{u \choose k}\!\!\right)={u+k-1 \choose k}={\frac {(u+k-1)!/(u-1)!}{k!}}$ (when u is positive integer) means reverse or rising binomial coefficient.	$\left(\!\!{-5.5 \choose 7}\!\!\right)={\frac {-5.5\cdot -4.5\cdot -3.5\cdot -2.5\cdot -1.5\cdot -.5\cdot .5}{1\cdot 2\cdot 3\cdot 4\cdot 5\cdot 6\cdot 7}}={.5 \choose 7}={\frac {33}{2048}}\,\!$
$\|...\|$	$\|\ldots \|\!\,$	absolute value; modulus absolute value of; modulus of numbers	\|x\| means the distance along the real line (or across the complex plane) between x and zero.	\|3\| = 3 \|–5\| = \|5\| = 5 \| i \| = 1 \| 3 + 4i \| = 5
		Euclidean norm or Euclidean length or magnitude Euclidean norm of geometry	\|x\| means the (Euclidean) length of vector x.	For x = (3,−4) $\|{\textbf {x}}\|={\sqrt {3^{2}+(-4)^{2}}}=5$
		determinant determinant of matrix theory	\|A\| means the determinant of the matrix A	${\begin{vmatrix}1&2\\2&9\\\end{vmatrix}}=5$
		cardinality cardinality of; size of; order of set theory	\|X\| means the cardinality of the set X. (# may be used instead as described below.)	\|{3, 5, 7, 9}\| = 4.
$‖...‖$	$\\|\ldots \\|\!\,$	norm norm of; length of linear algebra	‖ x ‖ means the norm of the element x of a normed vector space.^[6]	‖ x + y ‖ ≤ ‖ x ‖ + ‖ y ‖
$‖...‖$	$\\|\ldots \\|\!\,$	nearest integer function nearest integer to numbers	‖x‖ means the nearest integer to x. (This may also be written [x], ⌊x⌉, nint(x) or Round(x).)	‖1‖ = 1, ‖1.6‖ = 2, ‖−2.4‖ = −2, ‖3.49‖ = 3
${,}$	${\{\ ,\!\ \}}\!\,$	set brackets the set of ... set theory	{a,b,c} means the set consisting of a, b, and c.^[7]	ℕ = { 1, 2, 3, ... }
${ : }$ ${ \| }$ ${ ; }$	$\{\ :\ \}\!\,$ $\{\ \|\ \}\!\,$ $\{\ ;\ \}\!\,$	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.^[7] {x \| P(x)} is the same as {x : P(x)}.	{n ∈ ℕ : n² < 20} = { 1, 2, 3, 4 }
$⌊...⌋$	$\lfloor \ldots \rfloor \!\,$	floor floor; greatest integer; entier numbers	⌊x⌋ means the floor of x, i.e. the largest integer less than or equal to x. (This may also be written [x], floor(x) or int(x).)	⌊4⌋ = 4, ⌊2.1⌋ = 2, ⌊2.9⌋ = 2, ⌊−2.6⌋ = −3
$⌈...⌉$	$\lceil \ldots \rceil \!\,$	ceiling ceiling numbers	⌈x⌉ means the ceiling of x, i.e. the smallest integer greater than or equal to x. (This may also be written ceil(x) or ceiling(x).)	⌈4⌉ = 4, ⌈2.1⌉ = 3, ⌈2.9⌉ = 3, ⌈−2.6⌉ = −2
$⌊...⌉$	$\lfloor \ldots \rceil \!\,$	nearest integer function nearest integer to numbers	⌊x⌉ means the nearest integer to x. (This may also be written [x], \|\|x\|\|, nint(x) or Round(x).)	⌊2⌉ = 2, ⌊2.6⌉ = 3, ⌊-3.4⌉ = -3, ⌊4.49⌉ = 4
$[ : ]$	$[\ :\ ]\!\,$	degree of a field extension the degree of field theory	[K : F] means the degree of the extension K : F.	[ℚ(√2) : ℚ] = 2 [ℂ : ℝ] = 2 [ℝ : ℚ] = ∞
$[ ]$ $[ , ]$ $[ , , ]$	$[\ ]\!\,$ $[\ ,\ ]\!\,$ $[\ ,\ ,\ ]\!\,$	equivalence class the equivalence class of abstract algebra	[a] means the equivalence class of a, i.e. {x : x ~ a}, where ~ is an equivalence relation. [a]_R means the same, but with R as the equivalence relation.	Let a ~ b be true iff a ≡ b (mod 5). Then [2] = {..., −8, −3, 2, 7, ...}.
		floor floor; greatest integer; entier numbers	[x] means the floor of x, i.e. the largest integer less than or equal to x. (This may also be written ⌊x⌋, floor(x) or int(x). Not to be confused with the nearest integer function, as described below.)	[3] = 3, [3.5] = 3, [3.99] = 3, [−3.7] = −4
		nearest integer function nearest integer to numbers	[x] means the nearest integer to x. (This may also be written ⌊x⌉, \|\|x\|\|, nint(x) or Round(x). Not to be confused with the floor function, as described above.)	[2] = 2, [2.6] = 3, [-3.4] = -3, [4.49] = 4
		Iverson bracket 1 if true, 0 otherwise propositional logic	[S] maps a true statement S to 1 and a false statement S to 0.	[0=5]=0, [7>0]=1, [2 ∈ {2,3,4}]=1, [5 ∈ {2,3,4}]=0
		image image of ... under ... everywhere	f[X] means { f(x) : x ∈ X }, the image of the function f under the set X ⊆ dom(f). (This may also be written as f(X) if there is no risk of confusing the image of f under X with the function application f of X. Another notation is Im f, the image of f under its domain.)	$\sin[\mathbb {R} ]=[-1,1]$
		closed interval closed interval order theory	$[a,b]=\{x\in \mathbb {R} :a\leq x\leq b\}$ .	0 and 1/2 are in the interval [0,1].
		commutator the commutator of group theory, ring theory	[g, h] = g⁻¹h⁻¹gh (or ghg⁻¹h⁻¹), if g, h ∈ G (a group). [a, b] = ab − ba, if a, b ∈ R (a ring or commutative algebra).	x^y = x[x, y] (group theory). [AB, C] = A[B, C] + [A, C]B (ring theory).
		triple scalar product the triple scalar product of vector calculus	[a, b, c] = a × b · c, the scalar product of a × b with c.	[a, b, c] = [b, c, a] = [c, a, b].
$( )$ $( , )$	$(\ )\!\,$ $(\ ,\ )\!\,$	function application of set theory	f(x) means the value of the function f at the element x.	If f(x) := x²-5, then f(6) = 6²-5 = 36−5=31.
		image image of ... under ... everywhere	f(X) means { f(x) : x ∈ X }, the image of the function f under the set X ⊆ dom(f). (This may also be written as f[X] if there is a risk of confusing the image of f under X with the function application f of X. Another notation is Im f, the image of f under its domain.)	$\sin(\mathbb {R} )=[-1,1]$
		precedence grouping parentheses everywhere	Perform the operations inside the parentheses first.	(8/4)/2 = 2/2 = 1, but 8/(4/2) = 8/2 = 4.
		tuple tuple; n-tuple; ordered pair/triple/etc; row vector; sequence everywhere	An ordered list (or sequence, or horizontal vector, or row vector) of values. (Note that the notation (a,b) is ambiguous: it could be an ordered pair or an open interval. Set theorists and computer scientists often use angle brackets ⟨ ⟩ instead of parentheses.)	(a, b) is an ordered pair (or 2-tuple). (a, b, c) is an ordered triple (or 3-tuple). ( ) is the empty tuple (or 0-tuple).
		highest common factor highest common factor; greatest common divisor; hcf; gcd number theory	(a, b) means the highest common factor of a and b. (This may also be written hcf(a, b) or gcd(a, b).)	(3, 7) = 1 (they are coprime); (15, 25) = 5.
$( , )$ $] , [$	$(\ ,\ )\!\,$ $]\ ,\ [\!\,$	open interval open interval order theory	$(a,b)=\{x\in \mathbb {R} :a<x<b\}$ . (Note that the notation (a,b) is ambiguous: it could be an ordered pair or an open interval. The notation ]a,b[ can be used instead.)	4 is not in the interval (4, 18). (0, +∞) equals the set of positive real numbers.
$( , ]$ $] , ]$	$(\ ,\ ]\!\,$ $]\ ,\ ]\!\,$	left-open interval half-open interval; left-open interval order theory	$(a,b]=\{x\in \mathbb {R} :a<x\leq b\}$ .	(−1, 7] and (−∞, −1]
$[ , )$ $[ , [$	$[\ ,\ )\!\,$ $[\ ,\ [\!\,$	right-open interval half-open interval; right-open interval order theory	$[a,b)=\{x\in \mathbb {R} :a\leq x<b\}$ .	[4, 18) and [1, +∞)
$⟨⟩$ $⟨,⟩$	$\langle \ \rangle \!\,$ $\langle \ ,\ \rangle \!\,$	inner product inner product of linear algebra	⟨u,v⟩ means the inner product of u and v, where u and v are members of an inner product space. Note that the notation ⟨u, v⟩ may be ambiguous: it could mean the inner product or the linear span. There are many variants of the notation, such as ⟨u \| v⟩ and (u \| v), which are described below. For spatial vectors, the dot product notation, x · y is common. For matrices, the colon notation A : B may be used. As ⟨ and ⟩ can be hard to type, the more "keyboard friendly" forms < and > are sometimes seen. These are avoided in mathematical texts.	The standard inner product between two vectors x = (2, 3) and y = (−1, 5) is: ⟨x, y⟩ = 2 × −1 + 3 × 5 = 13
		average average of statistics	let S be a subset of N for example, $\langle S\rangle$ represents the average of all the elements in S.	for a time series :g(t) (t = 1, 2,...) we can define the structure functions S_q( $\tau$ ): $S_{q}=\langle \|g(t+\tau )-g(t)\|^{q}\rangle _{t}$
		linear span (linear) span of; linear hull of linear algebra	⟨S⟩ means the span of S ⊆ V. That is, it is the intersection of all subspaces of V which contain S. ⟨u₁, u₂, ...⟩ is shorthand for ⟨{u₁, u₂, ...}⟩. Note that the notation ⟨u, v⟩ may be ambiguous: it could mean the inner product or the linear span. The span of S may also be written as Sp(S).	$\left\langle \left({\begin{smallmatrix}1\\0\\0\end{smallmatrix}}\right),\left({\begin{smallmatrix}0\\1\\0\end{smallmatrix}}\right),\left({\begin{smallmatrix}0\\0\\1\end{smallmatrix}}\right)\right\rangle =\mathbb {R} ^{3}$ .
		subgroup generated by a set the subgroup generated by group theory	$\langle S\rangle$ means the smallest subgroup of G (where S ⊆ G, a group) containing every element of S. $\langle g_{1},g_{2},\ldots ,\rangle$ is shorthand for $\langle g_{1},g_{2},\ldots \rangle$ .	In S₃, $\langle (1\;2)\rangle =\{id,\;(1\;2)\}$ and $\langle (1\;2\;3)\rangle =\{id,\;(1\;2\;3),(1\;2\;3))\}$ .
		tuple tuple; n-tuple; ordered pair/triple/etc; row vector; sequence everywhere	An ordered list (or sequence, or horizontal vector, or row vector) of values. (The notation (a,b) is often used as well.)	$\langle a,b\rangle$ is an ordered pair (or 2-tuple). $\langle a,b,c\rangle$ is an ordered triple (or 3-tuple). $\langle \rangle$ is the empty tuple (or 0-tuple).
$⟨\|⟩$ $(\|)$	$\langle \ \|\ \rangle \!\,$ $(\ \|\ )\!\,$	inner product inner product of linear algebra	⟨u \| v⟩ means the inner product of u and v, where u and v are members of an inner product space.^[8] (u \| v) means the same. Another variant of the notation is ⟨u, v⟩ which is described above. For spatial vectors, the dot product notation, x · y is common. For matrices, the colon notation A : B may be used. As ⟨ and ⟩ can be hard to type, the more "keyboard friendly" forms < and > are sometimes seen. These are avoided in mathematical texts.

Other non-letter symbols

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$*$	$*\!\,$	convolution convolution; convolved with functional analysis	f ∗ g means the convolution of f and g.	$(f*g)(t)=\int _{0}^{t}f(\tau )g(t-\tau )\,d\tau$ .
		complex conjugate conjugate complex numbers	z^∗ means the complex conjugate of z. ( ${\bar {z}}$ can also be used for the conjugate of z, as described below.)	$(3+4i)^{\ast }=3-4i$ .
		group of units the group of units of ring theory	R^∗ consists of the set of units of the ring R, along with the operation of multiplication. This may also be written R^× as described above, or U(R).	${\begin{aligned}(\mathbb {Z} /5\mathbb {Z} )^{\ast }&=\{[1],[2],[3],[4]\}\\&\cong \mathrm {C} _{4}\\\end{aligned}}$
		hyperreal numbers the (set of) hyperreals non-standard analysis	^∗R means the set of hyperreal numbers. Other sets can be used in place of R.	^∗N is the hypernatural numbers.
		Hodge dual Hodge dual; Hodge star linear algebra	∗v means the Hodge dual of a vector v. If v is a k-vector within an n-dimensional oriented inner product space, then ∗v is an (n−k)-vector.	If $\{e_{i}\}$ are the standard basis vectors of $\mathbb {R} ^{5}$ , $*(e_{1}\wedge e_{2}\wedge e_{3})=e_{4}\wedge e_{5}$
$\propto$	$\propto \!\,$	proportionality is proportional to; varies as everywhere	y ∝ x means that y = kx for some constant k.	if y = 2x, then y ∝ x.
$\propto$	$\propto \!\,$	Karp reduction^[9] is Karp reducible to; is polynomial-time many-one reducible to computational complexity theory	A ∝ B means the problem A can be polynomially reduced to the problem B.	If L₁ ∝ L₂ and L₂ ∈ P, then L₁ ∈ P.
$∖$	$\setminus \!\,$	set-theoretic complement minus; without; throw out; not set theory	A ∖ B means the set that contains all those elements of A that are not in B.^[5] (− can also be used for set-theoretic complement as described above.)	{1,2,3,4} ∖ {3,4,5,6} = {1,2}
$\|$	$\|\!\,$	conditional event given probability	P(A\|B) means the probability of the event A occurring given that B occurs.	if X is a uniformly random day of the year P(X is May 25 \| X is in May) = 1/31
		restriction restriction of ... to ...; restricted to set theory	f\|_A means the function f is restricted to the set A, that is, it is the function with domain A ∩ dom(f) that agrees with f.	The function f : R → R defined by f(x) = x² is not injective, but f\|_R⁺ is injective.
		such that such that; so that everywhere	\| means "such that", see ":" (described below).	S = {(x,y) \| 0 < y < f(x)} The set of (x,y) such that y is greater than 0 and less than f(x).
$∣$ $∤$	$\mid \!\,$ $\nmid \!\,$	divisor, divides divides number theory	a ∣ b means a divides b. a ∤ b means a does not divide b. (The symbol ∣ can be difficult to type, and its negation is rare, so a regular but slightly shorter vertical bar \| character is often used instead.)	Since 15 = 3 × 5, it is true that 3 ∣ 15 and 5 ∣ 15.
$∣∣$	$\mid \mid \!\,$	exact divisibility exactly divides number theory	p^a ∣∣ n means p^a exactly divides n (i.e. p^a divides n but p^a+1 does not).	2³ ∣∣ 360.
$∥$ $∦$ $⋕$	$\\|\!\,$	parallel is parallel to geometry	x ∥ y means x is parallel to y. x ∦ y means x is not parallel to y. x ⋕ y means x is equal and parallel to y. (The symbol ∥ can be difficult to type, and its negation is rare, so two regular but slightly longer vertical bar \|\| characters are often used instead.)	If l ∥ m and m ⊥ n then l ⊥ n.
$∥$ $∦$ $⋕$	$\\|\!\,$	incomparability is incomparable to order theory	x ∥ y means x is incomparable to y.	{1,2} ∥ {2,3} under set containment.
$#$	$\#\!\,$	cardinality cardinality of; size of; order of set theory	#X means the cardinality of the set X. (\|...\| may be used instead as described above.)	#{4, 6, 8} = 3
		connected sum connected sum of; knot sum of; knot composition of topology, knot theory	A#B is the connected sum of the manifolds A and B. If A and B are knots, then this denotes the knot sum, which has a slightly stronger condition.	A#S^m is homeomorphic to A, for any manifold A, and the sphere S^m.
		primorial primorial number theory	n# is product of all prime numbers less than or equal to n.	12# = 2 × 3 × 5 × 7 × 11 = 2310
$:$	$:\!\,$	such that such that; so that everywhere	: means "such that", and is used in proofs and the set-builder notation (described below).	∃ n ∈ ℕ: n is even.
		field extension extends; over field theory	K : F means the field K extends the field F. This may also be written as K ≥ F.	ℝ : ℚ
		inner product of matrices inner product of linear algebra	A : B means the Frobenius inner product of the matrices A and B. The general inner product is denoted by ⟨u, v⟩, ⟨u \| v⟩ or (u \| v), as described below. For spatial vectors, the dot product notation, x·y is common. See also bra–ket notation.	$A:B=\sum _{i,j}A_{ij}B_{ij}$
		index of a subgroup index of subgroup group theory	The index of a subgroup H in a group G is the "relative size" of H in G: equivalently, the number of "copies" (cosets) of H that fill up G	$\|G:H\|={\frac {\|G\|}{\|H\|}}$
		division divided by over everywhere	A : B means the division of A with B (dividing A by B)	10 : 2 = 5
$⋮$	$\vdots \!\,$	vertical ellipsis vertical ellipsis everywhere	Denotes that certain constants and terms are missing out (e.g. for clarity) and that only the important terms are being listed.	$P(r,t)=\chi \vdots E(r,t_{1})E(r,t_{2})E(r,t_{3})$
$≀$	$\wr \!\,$	wreath product wreath product of ... by ... group theory	A ≀ H means the wreath product of the group A by the group H. This may also be written A_wrH.	$\mathrm {S} _{n}\wr \mathrm {Z} _{2}$ is isomorphic to the automorphism group of the complete bipartite graph on (n,n) vertices.
$↯$ $※$		downwards zigzag arrow contradiction; this contradicts that everywhere	Denotes that contradictory statements have been inferred. For clarity, the exact point of contradiction can be appended.	x + 4 = x - 3 ※ Statement: Every finite, non-empty, ordered set has a largest element. Otherwise, let's assume that $X$ is a finite, non-empty, ordered set with no largest element. Then, for some $x_{1}\in X$ , there exists an $x_{2}\in X$ with $x_{1}<x_{2}$ , but then there's also an $x_{3}\in X$ with $x_{2}<x_{3}$ , and so on. Thus, $x_{1},x_{2},x_{3},...$ are distinct elements in $X$ . ↯ $X$ is finite.
$\oplus$ $⊻$	$\oplus \!\,$ $\veebar \!\,$	exclusive or xor propositional logic, Boolean algebra	The statement A ⊕ B is true when either A or B, but not both, are true. A ⊻ B means the same.	(¬A) ⊕ A is always true, A ⊕ A is always false.
$\oplus$ $⊻$	$\oplus \!\,$ $\veebar \!\,$	direct sum direct sum of abstract algebra	The direct sum is a special way of combining several objects into one general object. (The bun symbol ⊕, or the coproduct symbol ∐, is used; ⊻ is only for logic.)	Most commonly, for vector spaces U, V, and W, the following consequence is used: U = V ⊕ W ⇔ (U = V + W) ∧ (V ∩ W = {0})
	${~\wedge \!\!\!\!\!\!\bigcirc ~}$	Kulkarni–Nomizu product Kulkarni–Nomizu product tensor algebra	Derived from the tensor product of two symmetric type (0,2) tensors; it has the algebraic symmetries of the Riemann tensor. $f=g{\,\wedge \!\!\!\!\!\!\bigcirc \,}h$ has components $f_{\alpha \beta \gamma \delta }=g_{\alpha \gamma }h_{\beta \delta }+g_{\beta \delta }h_{\alpha \gamma }-g_{\alpha \delta }h_{\beta \gamma }-g_{\beta \gamma }h_{\alpha \delta }$ .
$□$	$\Box \!\,$	D'Alembertian; wave operator non-Euclidean Laplacian vector calculus	It is the generalisation of the Laplace operator in the sense that it is the differential operator which is invariant under the isometry group of the underlying space and it reduces to the Laplace operator if restricted to time independent functions.	$\square ={\frac {1}{c^{2}}}{\partial ^{2} \over \partial t^{2}}-{\partial ^{2} \over \partial x^{2}}-{\partial ^{2} \over \partial y^{2}}-{\partial ^{2} \over \partial z^{2}}$

Letter-based symbols

Includes upside-down letters.

Letter modifiers

Also called diacritics.

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$a$	${\bar {a}}\!\,$	mean overbar; ... bar statistics	${\bar {x}}$ (often read as "x bar") is the mean (average value of $x_{i}$ ).	$x=\{1,2,3,4,5\};{\bar {x}}=3$ .
		finite sequence, tuple finite sequence, tuple model theory	${\overline {a}}$ means the finite sequence/tuple $(a_{1},a_{2},...,a_{n}).$ .	${\overline {a}}:=(a_{1},a_{2},...,a_{n})$ .
		algebraic closure algebraic closure of field theory	${\overline {F}}$ is the algebraic closure of the field F.	The field of algebraic numbers is sometimes denoted as ${\overline {\mathbb {Q} }}$ because it is the algebraic closure of the rational numbers ${\mathbb {Q} }$ .
		complex conjugate conjugate complex numbers	${\overline {z}}$ means the complex conjugate of z. (z^∗ can also be used for the conjugate of z, as described above.)	${\overline {3+4i}}=3-4i$ .
		topological closure (topological) closure of topology	${\overline {S}}$ is the topological closure of the set S. This may also be denoted as cl(S) or Cl(S).	In the space of the real numbers, ${\overline {\mathbb {Q} }}=\mathbb {R}$ (the rational numbers are dense in the real numbers).
$â$	${\hat {a}}$	unit vector hat geometry	$\mathbf {\hat {a}}$ (pronounced "a hat") is the normalized version of vector $\mathbf {a}$ , having length 1.
$â$	${\hat {a}}$	estimator estimator for statistics	${\hat {\theta }}$ is the estimator or the estimate for the parameter $\theta$ .	The estimator $\mathbf {\hat {\mu }} ={\frac {\sum _{i}x_{i}}{n}}$ produces a sample estimate $\mathbf {\hat {\mu }} (\mathbf {x} )$ for the mean $\mu$ .
$'$	$'\!\,$	derivative ... prime; derivative of calculus	f ′(x) means the derivative of the function f at the point x, i.e., the slope of the tangent to f at x. (The single-quote character ' is sometimes used instead, especially in ASCII text.)	If f(x) := x², then f ′(x) = 2x.
$•$	${\dot {\,}}\!\,$	derivative ... dot; time derivative of calculus	${\dot {x}}$ means the derivative of x with respect to time. That is ${\dot {x}}(t)={\frac {\partial }{\partial t}}x(t)$ .	If x(t) := t², then ${\dot {x}}(t)=2t$ .

Symbols based on Latin letters

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$\forall$	$\forall \!\,$	universal quantification for all; for any; for each; for every predicate logic	$\forall x : P (x)$ means P(x) is true for all x.	$\forall n \in ℕ:$ $n 2 \geq n$ .
$ℂ$ $C$	$\mathbb {C} \!\,$ $\mathbf {C} \!\,$	complex numbers C; the (set of) complex numbers numbers	ℂ means ${a + b i : a, b \in ℝ}$ .	$i = \sqrt -1 \in ℂ$
$𝔠$	${\mathfrak {c}}\!\,$	cardinality of the continuum cardinality of the continuum; c; cardinality of the real numbers set theory	The cardinality of $\mathbb {R}$ is denoted by $\|\mathbb {R} \|$ or by the symbol ${\mathfrak {c}}$ (a lowercase Fraktur letter C).	${\mathfrak {c}}={\beth }_{1}$
$\partial$	$\partial \!\,$	partial derivative partial; d calculus	∂f/∂x_i means the partial derivative of f with respect to x_i, where f is a function on (x₁, ..., x_n).	If f(x,y) := x²y, then ∂f/∂x = 2xy,
		boundary boundary of topology	∂M means the boundary of M	∂{x : \|\|x\|\| ≤ 2} = {x : \|\|x\|\| = 2}
		degree of a polynomial degree of algebra	∂f means the degree of the polynomial f. (This may also be written deg f.)	∂(x² − 1) = 2
$𝔼$ $E$	$\mathbb {E}$ $\mathrm {E}$	expected value expected value probability theory	the value of a random variable one would "expect" to find if one could repeat the random variable process an infinite number of times and take the average of the values obtained	$\mathbb {E} [X]={\frac {x_{1}p_{1}+x_{2}p_{2}+\dotsb +x_{k}p_{k}}{p_{1}+p_{2}+\dotsb +p_{k}}}$
$\exists$	$\exists \!\,$	existential quantification there exists; there is; there are predicate logic	∃ x: P(x) means there is at least one x such that P(x) is true.	∃ n ∈ ℕ: n is even.
$\exists!$	$\exists !\!\,$	uniqueness quantification there exists exactly one predicate logic	∃! x: P(x) means there is exactly one x such that P(x) is true.	∃! n ∈ ℕ: n + 5 = 2n.
$\in$ $\notin$	$\in \!\,$ $\notin \!\,$	set membership is an element of; is not an element of everywhere, set theory	a ∈ S means a is an element of the set S;^[7] a ∉ S means a is not an element of S.^[7]	(1/2)⁻¹ ∈ ℕ 2⁻¹ ∉ ℕ
$∌$	$\not \ni$	set membership does not contain as an element set theory	S ∌ e means the same thing as e ∉ S, where S is a set and e is not an element of S.
$∋$	$\ni$	such that symbol such that mathematical logic	often abbreviated as "s.t."; : and \| are also used to abbreviate "such that". The use of ∋ goes back to early mathematical logic and its usage in this sense is declining.	Choose $x$ ∋ 2\| $x$ and 3\| $x$ . (Here \| is used in the sense of "divides".)
$∋$	$\ni$	set membership contains as an element set theory	S ∋ e means the same thing as e ∈ S, where S is a set and e is an element of S.
$ℍ$ $H$	$\mathbb {H} \!\,$ $\mathbf {H} \!\,$	quaternions or Hamiltonian quaternions H; the (set of) quaternions numbers	ℍ means {a + b i + c j + d k : a,b,c,d ∈ ℝ}.
$ℕ$ $N$	$\mathbb {N} \!\,$ $\mathbf {N} \!\,$	natural numbers the (set of) natural numbers numbers	N means either { 0, 1, 2, 3, ...} or { 1, 2, 3, ...}. The choice depends on the area of mathematics being studied; e.g. number theorists prefer the latter; analysts, set theorists and computer scientists prefer the former. To avoid confusion, always check an author's definition of N. Set theorists often use the notation ω (for least infinite ordinal) to denote the set of natural numbers (including zero), along with the standard ordering relation ≤.	ℕ = {\|a\| : a ∈ ℤ} or ℕ = {\|a\| > 0: a ∈ ℤ}
$o$	$\circ \!\,$	Hadamard product entrywise product linear algebra	For two matrices (or vectors) of the same dimensions $A,B\in {\mathbb {R} }^{m\times n}$ the Hadamard product is a matrix of the same dimensions $A\circ B\in {\mathbb {R} }^{m\times n}$ with elements given by $(A\circ B)_{i,j}=(A)_{i,j}\cdot (B)_{i,j}$ . In MATLAB this operation is expressed by A.*B.	${\begin{bmatrix}1&2\\2&4\\\end{bmatrix}}\circ {\begin{bmatrix}1&2\\0&0\\\end{bmatrix}}={\begin{bmatrix}1&4\\0&0\\\end{bmatrix}}$
$\circ$	$\circ \!\,$	function composition composed with set theory	f ∘ g is the function such that (f ∘ g)(x) = f(g(x)).^[10]	if f(x) := 2x, and g(x) := x + 3, then (f ∘ g)(x) = 2(x + 3).
$O$	$O$	Big O notation big-oh of Computational complexity theory	The Big O notation describes the limiting behavior of a function, when the argument tends towards a particular value or infinity.	If f(x) = 6x⁴ − 2x³ + 5 and g(x) = x⁴, then $f(x)=O(g(x)){\mbox{ as }}x\to \infty \,$
$\emptyset$ ${ }$	$\emptyset \!\,$ $\varnothing \!\,$ $\{\}\!\,$	empty set the empty set null set set theory	∅ means the set with no elements.^[7] { } means the same.	${n \in ℕ : 1 < n 2 < 4} = \emptyset$
$ℙ$ $P$	$\mathbb {P} \!\,$ $\mathbf {P} \!\,$	projective space P; the projective space; the projective line; the projective plane topology	ℙ means a space with a point at infinity.	$\mathbb {P} ^{1}$ , $\mathbb {P} ^{2}$
		probability the probability of probability theory	ℙ(X) means the probability of the event X occurring. This may also be written as P(X), Pr(X), P[X] or Pr[X].	If a fair coin is flipped, ℙ(Heads) = ℙ(Tails) = 0.5.
		Power set the Power set of Powerset	Given a set S, the power set of S is the set of all subsets of the set S. The power set of S0 is denoted by P(S).	The power set P({0, 1, 2}) is the set of all subsets of {0, 1, 2}. Hence, P({0, 1, 2}) = {∅, {0}, {1}, {2}, {0, 1}, {0, 2}, {1, 2}, {0, 1, 2. }}
$ℚ$ $Q$	$\mathbb {Q} \!\,$ $\mathbf {Q} \!\,$	rational numbers Q; the (set of) rational numbers; the rationals numbers	ℚ means {p/q : p ∈ ℤ, q ∈ ℕ}.	3.14000... ∈ ℚ π ∉ ℚ
$ℝ$ $R$	$\mathbb {R} \!\,$ $\mathbf {R} \!\,$	real numbers R; the (set of) real numbers; the reals numbers	ℝ means the set of real numbers.	π ∈ ℝ √(−1) ∉ ℝ
$†$	${}^{\dagger }\!\,$	conjugate transpose conjugate transpose; adjoint; Hermitian adjoint/conjugate/transpose/dagger matrix operations	A^† means the transpose of the complex conjugate of A.^[11] This may also be written A^∗T, A^T∗, A^∗, A^T or A^T.	If A = (a_ij) then A^† = (a_ji).
$T$	${}^{\mathsf {T}}\!\,$	transpose transpose matrix operations	A^T means A, but with its rows swapped for columns. This may also be written A′, A^t or A^tr.	If A = (a_ij) then A^T = (a_ji).
$⊤$	$\top \!\,$	top element the top element lattice theory	⊤ means the largest element of a lattice.	∀x : x ∨ ⊤ = ⊤
$⊤$	$\top \!\,$	top type the top type; top type theory	⊤ means the top or universal type; every type in the type system of interest is a subtype of top.	∀ types T, T <: ⊤
$⊥$	$\bot \!\,$	perpendicular is perpendicular to geometry	x ⊥ y means x is perpendicular to y; or more generally x is orthogonal to y.	If l ⊥ m and m ⊥ n in the plane, then l \|\| n.
		orthogonal complement orthogonal/ perpendicular complement of; perp linear algebra	W^⊥ means the orthogonal complement of W (where W is a subspace of the inner product space V), the set of all vectors in V orthogonal to every vector in W.	Within $\mathbb {R} ^{3}$ , $(\mathbb {R} ^{2})^{\perp }\cong \mathbb {R}$ .
		coprime is coprime to number theory	x ⊥ y means x has no factor greater than 1 in common with y.	34 ⊥ 55
		independent is independent of probability	A ⊥ B means A is an event whose probability is independent of event B.	If A ⊥ B, then P(A\|B) = P(A).
		bottom element the bottom element lattice theory	⊥ means the smallest element of a lattice.	∀x : x ∧ ⊥ = ⊥
		bottom type the bottom type; bot type theory	⊥ means the bottom type (a.k.a. the zero type or empty type); bottom is the subtype of every type in the type system.	∀ types T, ⊥ <: T
		comparability is comparable to order theory	x ⊥ y means that x is comparable to y.	{e, π} ⊥ {1, 2, e, 3, π} under set containment.
$𝕌$ $U$	$\mathbb {U} \!\,$ $\mathbf {U} \!\,$	all numbers being considered U; the universal set; the set of all numbers; all numbers considered set theory	𝕌 means "the set of all elements being considered." It may represent all numbers both real and complex, or any subset of these--hence the term "universal".	𝕌 = {ℝ,ℂ} includes all numbers. If instead, 𝕌 = {ℤ,ℂ}, then π ∉ 𝕌.
$\cup$	$\cup \!\,$	set-theoretic union the union of ... or ...; union set theory	A ∪ B means the set of those elements which are either in A, or in B, or in both.^[5]	A ⊆ B ⇔ (A ∪ B) = B
$\cap$	$\cap \!\,$	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.^[5]	{x ∈ ℝ : x² = 1} ∩ ℕ = {1}
$\lor$	$\lor \!\,$	logical disjunction or join in a lattice or; max; join propositional logic, lattice theory	The statement A ∨ B is true if A or B (or both) are true; if both are false, the statement is false. For functions A(x) and B(x), A(x) ∨ B(x) is used to mean max(A(x), B(x)).	n ≥ 4 ∨ n ≤ 2 ⇔ n ≠ 3 when n is a natural number.
$\land$	$\land \!\,$	logical conjunction or meet in a lattice and; min; meet propositional logic, lattice theory	The statement A ∧ B is true if A and B are both true; else it is false. For functions A(x) and B(x), A(x) ∧ B(x) is used to mean min(A(x), B(x)).	n < 4 ∧ n > 2 ⇔ n = 3 when n is a natural number.
		wedge product wedge product; exterior product exterior algebra	u ∧ v means the wedge product of any multivectors u and v. In three-dimensional Euclidean space the wedge product and the cross product of two vectors are each other's Hodge dual.	$u\wedge v=*(u\times v)\ {\text{ if }}u,v\in \mathbb {R} ^{3}$
		exponentiation ... (raised) to the power of ... everywhere	a ^ b means a raised to the power of b (a ^ b is more commonly written a^b. The symbol ^ is generally used in programming languages where ease of typing and use of plain ASCII text is preferred.)	2^3 = 2³ = 8
$\times$	$\times \!\,$	multiplication times; multiplied by arithmetic	3 × 4 means the multiplication of 3 by 4. (The symbol * is generally used in programming languages, where ease of typing and use of ASCII text is preferred.)	7 × 8 = 56
		Cartesian product the Cartesian product of ... and ...; the direct product of ... and ... set theory	X × Y means the set of all ordered pairs with the first element of each pair selected from X and the second element selected from Y.	{1,2} × {3,4} = {(1,3),(1,4),(2,3),(2,4)}
		cross product cross linear algebra	u × v means the cross product of vectors u and v	(1,2,5) × (3,4,−1) = (−22, 16, − 2)
		group of units the group of units of ring theory	R^× consists of the set of units of the ring R, along with the operation of multiplication. This may also be written R^∗ as described below, or U(R).	${\begin{aligned}(\mathbb {Z} /5\mathbb {Z} )^{\times }&=\{[1],[2],[3],[4]\}\\&\cong \mathrm {C} _{4}\\\end{aligned}}$
$\otimes$	$\otimes \!\,$	tensor product, tensor product of modules tensor product of linear algebra	$V\otimes U$ means the tensor product of V and U.^[12] $V\otimes _{R}U$ means the tensor product of modules V and U over the ring R.	{1, 2, 3, 4} ⊗ {1, 1, 2} = {{1, 1, 2}, {2, 2, 4}, {3, 3, 6}, {4, 4, 8}}
$⋉$ $⋊$	$\ltimes \!\,$ $\rtimes \!\,$	semidirect product the semidirect product of group theory	N ⋊_φ H is the semidirect product of N (a normal subgroup) and H (a subgroup), with respect to φ. Also, if G = N ⋊_φ H, then G is said to split over N. (⋊ may also be written the other way round, as ⋉, or as ×.)	$D_{2n}\cong \mathrm {C} _{n}\rtimes \mathrm {C} _{2}$
$⋉$ $⋊$	$\ltimes \!\,$ $\rtimes \!\,$	semijoin the semijoin of relational algebra	R ⋉ S is the semijoin of the relations R and S, the set of all tuples in R for which there is a tuple in S that is equal on their common attribute names.	R $\ltimes$ S = $\Pi$ _{a₁,..,a_n}(R $\bowtie$ S)
$⋈$	$\bowtie \!\,$	natural join the natural join of relational algebra	R ⋈ S is the natural join of the relations R and S, the set of all combinations of tuples in R and S that are equal on their common attribute names.
$ℤ$ $Z$	$\mathbb {Z} \!\,$ $\mathbf {Z} \!\,$	integers the (set of) integers numbers	ℤ means {..., −3, −2, −1, 0, 1, 2, 3, ...}. ℤ⁺ or ℤ^> means {1, 2, 3, ...} . ℤ^* or ℤ^≥ means {0, 1, 2, 3, ...} .	ℤ = {p, −p : p ∈ ℕ ∪ {0}}
$ℤ n$ $ℤ p$ $Z n$ $Z p$	$\mathbb {Z} _{n}\!\,$ $\mathbb {Z} _{p}\!\,$ $\mathbf {Z} _{n}\!\,$ $\mathbf {Z} _{p}\!\,$	integers mod n the (set of) integers modulo n numbers	ℤ_n means {[0], [1], [2], ...[n−1]} with addition and multiplication modulo n. Note that any letter may be used instead of n, such as p. To avoid confusion with p-adic numbers, use ℤ/pℤ or ℤ/(p) instead.	ℤ₃ = {[0], [1], [2]}
$ℤ n$ $ℤ p$ $Z n$ $Z p$		p-adic integers the (set of) p-adic integers numbers	Note that any letter may be used instead of p, such as n or l.

Symbols based on Hebrew or Greek letters

Symbol in HTML	Symbol in TeX	Name	Explanation	Examples
		Read as
		Category
$ℵ$	$\aleph \!\,$	aleph number aleph set theory	ℵ_α represents an infinite cardinality (specifically, the α-th one, where α is an ordinal).	\|ℕ\| = ℵ₀, which is called aleph-null.
$ℶ$	$\beth \!\,$	beth number beth set theory	ℶ_α represents an infinite cardinality (similar to ℵ, but ℶ does not necessarily index all of the numbers indexed by ℵ. ).	$\beth _{1}=\|P(\mathbb {N} )\|=2^{\aleph _{0}}.$
$δ$	$\delta \!\,$	Dirac delta function Dirac delta of hyperfunction	$\delta (x)={\begin{cases}\infty ,&x=0\\0,&x\neq 0\end{cases}}$	δ(x)
		Kronecker delta Kronecker delta of hyperfunction	$\delta _{ij}={\begin{cases}1,&i=j\\0,&i\neq j\end{cases}}$	δ_ij
		Functional derivative Functional derivative of Differential operators	${\begin{aligned}\left\langle {\frac {\delta F[\varphi (x)]}{\delta \varphi (x)}},f(x)\right\rangle &=\int {\frac {\delta F[\varphi (x)]}{\delta \varphi (x')}}f(x')dx'\\&=\lim _{\varepsilon \to 0}{\frac {F[\varphi (x)+\varepsilon f(x)]-F[\varphi (x)]}{\varepsilon }}\\&=\left.{\frac {d}{d\epsilon }}F[\varphi +\epsilon f]\right\|_{\epsilon =0}.\end{aligned}}$	${\frac {\delta V(r)}{\delta \rho (r')}}={\frac {1}{4\pi \epsilon _{0}\|r-r'\|}}$
$∆$ $⊖$	$\vartriangle \!\,$ $\ominus \!\,$	symmetric difference symmetric difference set theory	A ∆ B (or A ⊖ B) means the set of elements in exactly one of A or B. (Not to be confused with delta, Δ, described below.)	{1,5,6,8} ∆ {2,5,8} = {1,2,6} {3,4,5,6} ⊖ {1,2,5,6} = {1,2,3,4}
$Δ$	$\Delta \!\,$	delta delta; change in calculus	Δx means a (non-infinitesimal) change in x. (If the change becomes infinitesimal, δ and even d are used instead. Not to be confused with the symmetric difference, written ∆, above.)	${\tfrac {\Delta y}{\Delta x}}$ is the gradient of a straight line.
$Δ$	$\Delta \!\,$	Laplacian Laplace operator vector calculus	The Laplace operator is a second order differential operator in n-dimensional Euclidean space	If ƒ is a twice-differentiable real-valued function, then the Laplacian of ƒ is defined by $\Delta f=\nabla ^{2}f=\nabla \cdot \nabla f$
$\nabla$	$\nabla \!\,$	gradient del; nabla; gradient of vector calculus	∇f (x₁, ..., x_n) is the vector of partial derivatives (∂f / ∂x₁, ..., ∂f / ∂x_n).	If f (x,y,z) := 3xy + z², then ∇f = (3y, 3x, 2z)
		divergence del dot; divergence of vector calculus	$\nabla \cdot {\vec {v}}={\partial v_{x} \over \partial x}+{\partial v_{y} \over \partial y}+{\partial v_{z} \over \partial z}$	If ${\vec {v}}:=3xy\mathbf {i} +y^{2}z\mathbf {j} +5\mathbf {k}$ , then $\nabla \cdot {\vec {v}}=3y+2yz$ .
		curl curl of vector calculus	$\nabla \times {\vec {v}}=\left({\partial v_{z} \over \partial y}-{\partial v_{y} \over \partial z}\right)\mathbf {i}$ $+\left({\partial v_{x} \over \partial z}-{\partial v_{z} \over \partial x}\right)\mathbf {j} +\left({\partial v_{y} \over \partial x}-{\partial v_{x} \over \partial y}\right)\mathbf {k}$	If ${\vec {v}}:=3xy\mathbf {i} +y^{2}z\mathbf {j} +5\mathbf {k}$ , then $\nabla \times {\vec {v}}=-y^{2}\mathbf {i} -3x\mathbf {k}$ .
$π$	$\pi \!\,$	Pi pi; 3.1415926...; ≈355÷113 mathematical constant	Used in various formulas involving circles; $π$ is equivalent to the amount of area a circle would take up in a square of equal width with an area of 4 square units, roughly 3.14159. It is also the ratio of the circumference to the diameter of a circle.	A = πR² = 314.16 → R = 10
		projection Projection of relational algebra	$\pi _{a_{1},\ldots ,a_{n}}(R)$ restricts $R$ to the $\{a_{1},\ldots ,a_{n}\}$ attribute set.	$\pi _{\text{Age,Weight}}({\text{Person}})$
		Homotopy group the nth Homotopy group of Homotopy theory	$\pi _{n}(X)$ consists of homotopy equivalence classes of base point preserving maps from an n-dimensional sphere (with base point) into the pointed space X.	$\pi _{i}(S^{4})=\pi _{i}(S^{7})\oplus \pi _{i-1}(S^{3})$
$\prod$	$\prod$	product product over ... from ... to ... of arithmetic	$\prod _{k=1}^{n}a_{k}$ means $a_{1}a_{2}\dots a_{n}$ .	$\prod _{k=1}^{4}(k+2)=(1+2)(2+2)(3+2)(4+2)=3\times 4\times 5\times 6=360$
$\prod$	$\prod$	Cartesian product the Cartesian product of; the direct product of set theory	$\prod _{i=0}^{n}{Y_{i}}$ means the set of all (n+1)-tuples (y₀, ..., y_n).	$\prod _{n=1}^{3}{\mathbb {R} }=\mathbb {R} \times \mathbb {R} \times \mathbb {R} =\mathbb {R} ^{3}$
$∐$	$\coprod \!\,$	coproduct coproduct over ... from ... to ... of category theory	A general construction which subsumes the disjoint union of sets and of topological spaces, the free product of groups, and the direct sum of modules and vector spaces. The coproduct of a family of objects is essentially the "least specific" object to which each object in the family admits a morphism.
$σ$	$\sigma \!\,$	selection Selection of relational algebra	The selection $\sigma _{a\theta b}(R)$ selects all those tuples in $R$ for which $\theta$ holds between the $a$ and the $b$ attribute. The selection $\sigma _{a\theta v}(R)$ selects all those tuples in $R$ for which $\theta$ holds between the $a$ attribute and the value $v$ .	$\sigma _{\mathrm {Age} \geq 34}(\mathrm {Person} )$ $\sigma _{\mathrm {Age} =\mathrm {Weight} }(\mathrm {Person} )$
$\sum$	$\sum$	summation sum over ... from ... to ... of arithmetic	$\sum _{k=1}^{n}{a_{k}}$ means $a_{1}+a_{2}+\cdots +a_{n}$ .	$\sum _{k=1}^{4}{k^{2}}=1^{2}+2^{2}+3^{2}+4^{2}=1+4+9+16=30$

Variations

In mathematics written in Arabic, some symbols may be reversed to make right-to-left writing and reading easier.^[13]

References

^ "Math is Fun website".
^ Rónyai, Lajos (1998), Algoritmusok(Algorithms), TYPOTEX, ISBN 963-9132-16-0
^ Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T. (2002). "A fast and elitist multiobjective genetic algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation. 6 (2): 182. doi:10.1109/4235.996017.
^ Copi, Irving M.; Cohen, Carl (1990) [1953], "Chapter 8.3: Conditional Statements and Material Implication", Introduction to Logic (8th ed.), New York: Macmillan Publishers (United States), pp. 268–269, ISBN 0-02-325035-6, LCCN 89037742
^ ^a ^b ^c ^d Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 4, ISBN 0-412-60610-0
^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, p. 66, ISBN 0-521-63503-9, OCLC 43641333
^ ^a ^b ^c ^d ^e Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 3, ISBN 0-412-60610-0
^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, p. 62, ISBN 0-521-63503-9, OCLC 43641333
^ Berman, Kenneth A; Paul, Jerome L. (2005), Algorithms: Sequential, Parallel, and Distributed, Boston: Course Technology, p. 822, ISBN 0-534-42057-5
^ Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 5, ISBN 0-412-60610-0
^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 69–70, ISBN 0-521-63503-9, OCLC 43641333
^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 71–72, ISBN 0-521-63503-9, OCLC 43641333
^ M. Benatia, A. Lazrik, and K. Sami, "Arabic mathematical symbols in Unicode", 27th Internationalization and Unicode Conference, 2005.

External links

The complete set of mathematics Unicode characters
Jeff Miller: Earliest Uses of Various Mathematical Symbols
Numericana: Scientific Symbols and Icons
GIF and PNG Images for Math Symbols
Mathematical Symbols in Unicode
Using Greek and special characters from Symbol font in HTML
DeTeXify handwritten symbol recognition — doodle a symbol in the box, and the program will tell you what its name is
Handbook for Spoken Mathematics — pronunciation guide to many commonly used symbols

Some Unicode charts of mathematical operators:

Some Unicode cross-references:

Short list of commonly used LaTeX symbols and Comprehensive LaTeX Symbol List
MathML Characters - sorts out Unicode, HTML and MathML/TeX names on one page
Unicode values and MathML names
Unicode values and Postscript names from the source code for Ghostscript

[1] "Math is Fun website".

[2] Rónyai, Lajos (1998), Algoritmusok(Algorithms), TYPOTEX, ISBN 963-9132-16-0

[doi10.1109/4235.996017-3] Deb, K.; Pratap, A.; Agarwal, S.; Meyarivan, T. (2002). "A fast and elitist multiobjective genetic algorithm: NSGA-II". IEEE Transactions on Evolutionary Computation. 6 (2): 182. doi:10.1109/4235.996017.

[Copi-4] Copi, Irving M.; Cohen, Carl (1990) [1953], "Chapter 8.3: Conditional Statements and Material Implication", Introduction to Logic (8th ed.), New York: Macmillan Publishers (United States), pp. 268–269, ISBN 0-02-325035-6, LCCN 89037742

[d-goldrei-set-4-5] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 4, ISBN 0-412-60610-0

[m-nielsen-quantum-66-6] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, p. 66, ISBN 0-521-63503-9, OCLC 43641333

[d-goldrei-set-3-7] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 3, ISBN 0-412-60610-0

[m-nielsen-quantum-62-8] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, p. 62, ISBN 0-521-63503-9, OCLC 43641333

[9] Berman, Kenneth A; Paul, Jerome L. (2005), Algorithms: Sequential, Parallel, and Distributed, Boston: Course Technology, p. 822, ISBN 0-534-42057-5

[d-goldrei-set-5-10] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 5, ISBN 0-412-60610-0

[m-nielsen-quantum-69-70-11] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 69–70, ISBN 0-521-63503-9, OCLC 43641333

[m-nielsen-quantum-71-72-12] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 71–72, ISBN 0-521-63503-9, OCLC 43641333

[13] M. Benatia, A. Lazrik, and K. Sami, "Arabic mathematical symbols in Unicode", 27th Internationalization and Unicode Conference, 2005.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]