Table of mathematical symbols

From Wikipedia, the free encyclopedia

Contents
1 Common symbols 2 See also 3 Variations 4 References 5 External links

Common symbols
This is a listing of common symbols found within all branches of mathematics. Each symbol is listed in both HTML, which depends on appropriate fonts to be installed, and in TEX, as an image. This list is incomplete; you can help by expanding it (http://en.wikipedia.org/w/index.php?title=Table_of_mathematical_symbols&action=edit) .

Symbol Symbol
in HTML in TEX

Name Read as Category equality is equal to; equals everywhere inequality x = y means x and y represent the same thing or value. x y means that x and y do not represent the same thing or value. (The forms !=, /= or <> are generally used in everywhere programming languages where ease of typing and use of ASCII text is preferred.) x < y means x is less than y. order theory x > y means x is greater than y. proper subgroup is a proper subgroup of group theory (very) strict inequality is much less than, is much greater than order theory asymptotic comparison x y means x is much less than y. 0.003 1000000 x y means x is much greater than y. f g means the growth of f is asymptotically bounded by g. x ex H < G means H is a proper subgroup of G. 2+25 2=2 1+1=2

Explanation

Examples

= < >

is not equal to; does not equal

strict inequality is less than, is greater than

3<4 5>4 5Z < Z A 3 < S3

is of smaller order than, is of greater order than (This is I. M. Vinogradov's notation. Another analytic number theory notation is the Big O notation, which looks like f = O(g).) x y means x is less than or equal to y. inequality is less than or equal to, is greater than or equal to x y means x is greater than or equal to y.

(The forms <= and >= are generally used in order theory programming languages where ease of typing and use of ASCII text is preferred.) H G means H is a subgroup of G.

3 4 and 5 5 5 4 and 5 5

subgroup is a subgroup of group theory

ZZ A 3 S3 If

reduction

A B means the problem A can be reduced to the problem B. Subscripts can be added to the then computational complexity to indicate what kind of reduction. theory is reducible to

Karp reduction

is Karp reducible to; is polynomial-time many-one L1 L2 means that the problem L1 is Karp reducible to reducible to L2.[1] computational complexity theory proportionality is proportional to; varies as y x means that y = kx for some constant k. everywhere Karp reduction[2]

If L1 L2 and L2 P, then L1 P.

if y = 2x, then y x.

is Karp reducible to; is polynomial-time many-one A B means the problem A can be polynomially If L1 L2 and L2 P, then L1 P. reduced to the problem B. reducible to computational complexity theory addition plus; add 4 + 6 means the sum of 4 and 6. 2+7=9 arithmetic disjoint union A1 = {3, 4, 5, 6} A2 = {7, 8, 9, 10} the disjoint union of ... and A1 + A2 means the disjoint union of sets A1 and A1 + A2 = {(3,1), (4,1), (5,1), (6,1), (7,2), (8,2), (9,2), ... A2 . (10,2)} set theory minus; take; subtract arithmetic negative sign negative; minus; the opposite of arithmetic set-theoretic complement minus; without set theory ( can also be used for set-theoretic complement as described below.) multiplication times; multiplied by 3 4 means the multiplication of 3 by 4. (The symbol * is generally used in programming 7 8 = 56 arithmetic languages, where ease of typing and use of ASCII text is preferred.) A B means the set that contains all the elements of A that are not in B. {1,2,4} {1,3,4} = {2} 9 4 means the subtraction of 4 from 9. 83=5

subtraction

3 means the negative of the number 3.

(5) = 5

Cartesian product the Cartesian product of ... XY means the set of all ordered pairs with the and ...; the direct product of first element of each pair selected from X and ... and ... the second element selected from Y. set theory cross product cross linear algebra group of units the group of units of ring theory This may also be written R* as described below, or U(R). multiplication times; multiplied by 3 4 means the multiplication of 3 by 4. 7 8 = 56 R consists of the set of units of the ring R, along with the operation of multiplication. u v means the cross product of vectors u and v (1,2,5) (3,4,1) = (22, 16, 2) {1,2} {3,4} = {(1,3),(1,4),(2,3),(2,4)}

arithmetic dot product dot linear algebra division (Obelus) divided by; over 6 3 or 6 3 means the division of 6 by 3. 2 4 = .5 u v means the dot product of vectors u and v (1,2,5) (3,4,1) = 6

arithmetic quotient group mod group theory quotient set mod set theory plus-minus plus or minus 6 3 means both 6 + 3 and 6 3.

12 4 = 3 G / H means the quotient of group G modulo its {0, a, 2a, b, b+a, b+2a} / {0, b} = {{0, b}, {a, b+a}, subgroup H. {2a, b+2a}} A/~ means the set of all ~ equivalence classes in If we define ~ by x ~ y x y , then A. /~ = {x + n : n : x (0,1]} The equation x = 5 4, has two solutions, x = 7 and x = 3.

arithmetic plus-minus plus or minus measurement minus-plus minus or plus arithmetic square root means the nonnegative number whose the (principal) square root of square is x . real numbers complex square root if the (complex) square root coordinates with of complex numbers absolute value or modulus absolute value of; modulus |x| means the distance along the real line (or of across the complex plane) between x and zero. numbers Euclidean norm or Euclidean length or magnitude Euclidean norm of geometry determinant determinant of matrix theory cardinality cardinality of; size of; order of set theory norm norm of; length of linear algebra nearest integer function nearest integer to |X| means the cardinality of the set X. |A| means the determinant of the matrix A is represented in polar , then . 10 2 or equivalently 10 20% means the range from 10 2 to 10 + 2.

If a = 100 1 mm, then a 99 mm and a 101 mm.

6 (3 5) means both 6 + (3 5) and 6 (3 + cos(x y) = cos(x) cos(y) sin(x) sin(y). 5).

|3| = 3 |5| = |5| = 5 |i|=1 | 3 + 4i | = 5 For x = (3,-4)

||

|x| means the (Euclidean) length of vector x.

|{3, 5, 7, 9}| = 4. (# may be used instead as described below.) || x || means the norm of the element x of a normed vector space.[3] ||x|| means the nearest integer to x. ||1|| = 1, ||1.6|| = 2, ||2.4|| = 2, ||3.49|| = 3

|| x + y || || x || + || y ||

||||

(This may also be written [x], x, nint(x) or numbers Round(x).) a|b means a divides b. ab means a does not divide b.

divisor, divides divides

(This symbol can be difficult to type, and its number theory negation is rare, so a regular but slightly shorter vertical bar | character can be used.) P(A|B) means the probability of the event a occurring given that b occurs.

Since 15 = 35, it is true that 3|15 and 5|15.

conditional probability given probability restriction

if X is a uniformly random day of the year P(X is May 25 | X is in May) = 1/31

restriction of to ; restricted to parallel is parallel to

f|A means the function f restricted to the set A, The function f : R R defined by f(x) = x2 is not that is, it is the function with domain A dom(f) injective, but f| + is injective. R set theory that agrees with f. x || y means x is parallel to y. If l || m and m n then l n.

geometry

||

incomparability is incomparable to order theory exact divisibility exactly divides number theory cardinality cardinality of; size of; order of pa || n means pa exactly divides n (i.e. pa divides 3 2 || 360. n but pa+1 does not). #X means the cardinality of the set X. #{4, 6, 8} = 3 (|| may be used instead as described above.) x || y means x is incomparable to y. {1,2} || {2,3} under set containment.

set theory connected sum

A#B is the connected sum of the manifolds A connected sum of; knot and B. If A and B are knots, then this denotes the A#Sm is homeomorphic to A, for any manifold A, and the sum of; knot composition knot sum, which has a slightly stronger sphere Sm. of condition. topology, knot theory aleph set theory represents an infinite cardinality (specifically, || = 0, which is called aleph-null. the -th one, where is an ordinal).

aleph number

beth number beth cardinality of the continuum

represents an infinite cardinality (similar to , but does not necessarily index all of the set theory numbers indexed by . ).

The cardinality of is denoted by or by the cardinality of the continuum; cardinality of symbol (a lowercase Fraktur letter C). the real numbers; c; set theory such that such that; so that everywhere field extension extends; over field theory This may also be written as K F. A : B means the Frobenius inner product of the matrices A and B. : means such that, and is used in proofs and the set-builder notation (described below). K : F means the field K extends the field F. : n : n is even.

inner product of matrices inner product of

The general inner product is denoted by u, v, linear algebra u | v or (u | v), as described below. For spatial vectors, the dot product notation, xy is common. See also Bra-ket notation. The index of a subgroup H in a group G is the "relative size" of H in G: equivalently, the group theory number of "copies" (cosets) of H that fill up G n! means the product 1 2 ... n. The statement !A is true if and only if A is false. 4! = 1 2 3 4 = 24

index of a subgroup

index of subgroup factorial factorial

combinatorics

logical negation not

A slash placed through another operator is the same as "!" placed in front.

propositional logic (The symbol ! is primarily from computer science. It is avoided in mathematical texts, where the notation A is preferred.)

!(!A) A x y !(x = y)

probability distribution has distribution statistics row equivalence is row equivalent to matrix theory same order of magnitude roughly similar; poorly approximates

X ~ D, means the random variable X has the probability distribution D. A~B means that B can be generated by using a series of elementary row operations on A m ~ n means the quantities m and n have the same order of magnitude, or general size.

X ~ N(0,1), the standard normal distribution

2~5

8 9 ~ 100 (Note that ~ is used for an approximation that is approximation theory poor, otherwise use .) but 2 10

asymptotically equivalent is asymptotically equivalent f ~ g means to asymptotic analysis equivalence relation are in the same equivalence a ~ b means class ). everywhere approximately equal is approximately equal to x y means x is approximately equal to y. everywhere 3.14159 (and equivalently 1 ~ 5 mod 4 . x ~ x+1

isomorphism is isomorphic to

G H means that group G is isomorphic (structurally identical) to group H. group theory ( can also be used for isomorphic, as described below.)

Q / {1, 1} V, where Q is the quaternion group and V is the Klein fourgroup.

wreath product wreath product of by normal subgroup is a normal subgroup of

A H means the wreath product of the group A by the group H.

group theory This may also be written A H. wr N G means that N is a normal subgroup of group G.

is isomorphic to the automorphism group of the complete bipartite graph on (n,n) vertices.

Z(G) G

group theory ideal is an ideal of ring theory antijoin the antijoin of

I R means that I is an ideal of ring R.

(2) Z

R S means the antijoin of the relations R and S, the tuples in R for which there is not a tuple in R relational algebra S that is equal on their common attribute names.

S=R-R

N H is the semidirect product of N (a normal subgroup) and H (a subgroup), with respect to . semidirect product Also, if G = N H, then G is said to split over the semidirect product of N. group theory ( may also be written the other way round, as , or as .) semijoin R S is the semijoin of the relations R and S, the set of all tuples in R for which there is a tuple R the semijoin of in S that is equal on their common attribute relational algebra names. R S is the natural join of the relations R and S, the set of all combinations of tuples in R and S relational algebra that are equal on their common attribute names. Sometimes used in proofs before logical consequences. All humans are mortal. Socrates is a human. Socrates is mortal. 3331 is prime it has no positive integer factors other than itself and one. S = a1,..,an(R S)

natural join

the natural join of therefore

therefore; so; hence everywhere because because; since everywhere

Sometimes used in proofs before reasoning.


material implication A B means if A is true then B is also true; if A is false then nothing is said about B. end of proof QED; tombstone; Halmos symbol everywhere

Used to mark the end of a proof. (May also be written Q.E.D.)

implies; if then

( may mean the same as , or it may have the x = 2 x2 = 4 is true, but x2 = 4 x = 2 is in general false (since x could be 2). propositional logic, meaning for functions given below.) Heyting algebra ( may mean the same as ,[4] or it may have the meaning for superset given below.)

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

The statement A is true if and only if A is false. logical negation not propositional logic (The symbol ~ has many other uses, so or the slash notation is preferred. Computer scientists will often use ! but this is avoided in mathematical texts.) A slash placed through another operator is the same as "" placed in front.

(A) A x y (x = y)

logical conjunction or meet The statement A B is true if A and B are both in a lattice true; else it is false. and; min; meet n < 4 n >2 n = 3 when n is a natural number. propositional logic, lattice For functions A(x) and B(x), A(x) B(x) is used theory to mean min(A(x), B(x)). wedge product wedge product; exterior product u v means the wedge product of vectors u and v. This generalizes the cross product to higher dimensions.

linear algebra (For vectors in R 3, can also be used.) exponentiation a ^ b means a raised to the power of b

(raised) to the power of (a ^ b is more commonly written ab. The symbol 2^3 = 23 = 8 ^ is generally used in programming languages everywhere where ease of typing and use of plain ASCII text is preferred.) logical disjunction or join in a lattice or; max; join propositional logic, lattice For functions A(x) and B(x), A(x) B(x) is used theory to mean max(A(x), B(x)). exclusive or xor The statement A B is true when either A or B, (A) A is always true, A A is always false. propositional logic, but not both, are true. A B means the same. Boolean algebra direct sum The direct sum is a special way of combining several objects into one general object. Most commonly, for vector spaces U, V, and W, the 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.

 ! =: :=

following consequence is used: abstract algebra (The bun symbol , or the coproduct symbol , U = V W (U = V + W) (V W = {0}) is used; is only for logic.) universal quantification direct sum of for all; for any; for each predicate logic existential quantification there exists; there is; there x: P(x) means there is at least one x such that are P(x) is true. predicate logic uniqueness quantification there exists exactly one predicate logic ! x: P(x) means there is exactly one x such that ! n : n + 5 = 2n. P(x) is true. n : n is even. x: P(x) means P(x) is true for all x. n : n2 n.

definition

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.

is defined as; is equal by definition to everywhere

congruence

is congruent to

ABC DEF means triangle ABC is congruent to (has the same measurements as) geometry triangle DEF. G H means that group G is isomorphic (structurally identical) to group H. .

isomorphic is isomorphic to

abstract algebra ( can also be used for isomorphic, as described above.) congruence relation

{,} {:} {|} {}

... is congruent to ... modulo ... modular arithmetic set brackets the set of set theory set builder notation the set of such that set theory

a b (mod n) means a b is divisible by n

5 2 (mod 3)

{a,b,c} means the set consisting of a, b, and c.[5] = { 1, 2, 3, }

{x : P(x)} means the set of all x for which P(x) is {n : n2 < 20} = { 1, 2, 3, 4} true.[5] {x | P(x)} is the same as {x : P(x)}.

empty set the empty set set theory

means the set with no elements.[5] { } means {n : 1 < n2 < 4} = the same.

set membership

is an element of; is not an a S means a is an element of the set S;[5] a (1/2)1 element of S means a is not an element of S.[5] 21 everywhere, set theory (subset) A B means every element of A is also (A B) A an element of B.[6] is a subset of set theory (proper subset) A B means A B but A B.

subset

(Some writers use the symbol as if it were the same as .) A B means every element of B is also an element of A. (A B) B A B means A B but A B. (Some writers use the symbol as if it were the same as .) A B means the set of those elements which are A B (A B) = B either in A, or in B, or in both.[6]

superset is a superset of set theory

set-theoretic union the union of or ; union set theory set-theoretic intersection intersected with; intersect set theory symmetric difference symmetric difference set theory (Not to be confused with delta, , described below.) set-theoretic complement minus; without set theory ( can also be used for set-theoretic complement as described above.) function arrow from to set theory, type theory function arrow maps to set theory function composition composed with set theory 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, = {|a| : a } or = {|a| > 0: a } 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 . means {..., 3, 2, 1, 0, 1, 2, 3, ...}. + or > means {1, 2, 3, ...} . means {0, 1, = {p, p : p {0}} numbers 2, 3, ...} . fg is the function, such that (fg)(x) = f(g(x)).[7] if f(x) := 2x, and g(x) := x + 3, then (fg)(x) = 2(x + 3). f: X Y means the function f maps the set X into the set Y. Let f: {0} be defined by f(x) := x2. A B means the set that contains all those elements of A that are not in B.[6] {1,2,3,4} {3,4,5,6} = {1,2} A B means the set that contains all those elements that A and B have in common.[6] A B means the set of elements in exactly one of A or B. {1,5,6,8} {2,5,8} = {1,2,6} {x : x2 = 1} = {1}

f: a b means the function f maps the element a Let f: x x+1 (the successor function). to the element b.

N Z n

natural numbers N; the (set of) natural numbers numbers

integers Z; the (set of) integers

integers mod n

n means {[0], [1], [2], ...[n1]} with addition and multiplication modulo n.

p Zn Zp P Q R C H

Zn; the (set of) integers modulo n

Note that any letter may be used instead of n, such as p. To avoid confusion with p-adic numbers numbers, use /p or /(p) instead.

3 = {[0], [1], [2]}

p-adic integers the (set of) p-adic integers Note that any letter may be used instead of p, numbers such as n or l.

projective space P; the projective space, the projective line, the means a space with a point at infinity. projective plane topology probability the probability of probability theory This may also be written as P(X), Pr(X), P[X] or Pr[X]. rational numbers Q; the (set of) rational numbers; the rationals numbers real numbers R; the (set of) real numbers; means the set of real numbers. the reals numbers complex numbers C; the (set of) complex numbers numbers quaternions or Hamiltonian quaternions H; the (set of) quaternions numbers Big O notation The Big O notation describes the limiting If f(x) = 6x4 2x3 + 5 and g(x) = x4 , then behavior of a function, when the argument tends Computational complexity towards a particular value or infinity. theory big-oh of infinity floor is an element of the extended number line that is greater than all real numbers; it often occurs in numbers limits. x means the floor of x, i.e. the largest integer less than or equal to x. means {a + b i : a,b }. i = (1) means {p/q : p , q }. 3.14000... (X) means the probability of the event X occurring. If a fair coin is flipped, (Heads) = (Tails) = 0.5. ,

(1)

means {a + b i + c j + d k : a,b,c,d }.

infinity

floor; greatest integer; entier ceiling ceiling

4 = 4, 2.1 = 2, 2.9 = 2, 2.6 = 3

numbers (This may also be written [x], floor(x) or int(x).) x means the ceiling of x, i.e. the smallest integer greater than or equal to x. numbers (This may also be written ceil(x) or ceiling(x).) nearest integer function nearest integer to x means the nearest integer to x. 2 = 2, 2.6 = 3, -3.4 = -3, 4.49 = 4 4 = 4, 2.1 = 3, 2.9 = 3, 2.6 = 2

(This may also be written [x], ||x||, nint(x) or numbers Round(x).)

degree of a field extension

[(2) : ] = 2

[:]

the degree of field theory equivalence class the equivalence class of

[K : F] means the degree of the extension K : F. [ : ] = 2 [ : ] = [a] means the equivalence class of a, i.e. {x : x ~ Let a ~ b be true iff a b (mod 5). a}, where ~ is an equivalence relation. Then [2] = {, 8, 3, 2, 7, }.

abstract algebra [a]R means the same, but with R as the equivalence relation. floor floor; greatest integer; entier [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). numbers Not to be confused with the nearest integer function, as described below.) [x] means the nearest integer to x.

[3] = 3, [3.5] = 3, [3.99] = 3, [3.7] = 4

nearest integer function nearest integer to

[] [,] [,,]

(This may also be written x, ||x||, nint(x) or numbers Round(x). Not to be confused with the floor function, as described above.) [S] maps a true statement S to 1 and a false statement S to 0. f[X] means { f(x) : x X }, the image of the function f under the set X dom(f).

[2] = 2, [2.6] = 3, [-3.4] = -3, [4.49] = 4

Iverson bracket 1 if true, 0 otherwise propositional logic

[0=5]=0, [7>0]=1, [2 {2,3,4}]=1, [5 {2,3,4}]=0

image image of under

(This may also be written as f(X) if there is no everywhere 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.) . 0 and 1/2 are in the interval [0,1].

closed interval closed interval order theory commutator [g, h] = g1h1gh (or ghg1h1), if g, h G (a group). xy = x[x, y] (group theory). [AB, C] = A[B, C] + [A, C]B (ring theory).

the commutator of group theory, ring theory [a, b] = ab ba, if a, b R (a ring or commutative algebra). triple scalar product the triple scalar product of vector calculus function application of set theory [a, b, c] = a b c, the scalar product of a b with c. f(x) means the value of the function f at the element x. 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 everywhere 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.) means the number of combinations of r elements drawn from a set of n elements. (This may also be written as nCr.) Perform the operations inside the parentheses first. An ordered list (or sequence, or horizontal vector, or row vector) of values. combinatorics precedence grouping parentheses everywhere tuple

[a, b, c] = [b, c, a] = [c, a, b].

If f(x) := x2, then f(3) = 32 = 9.

image image of under

combinations

() (,)

(from) n choose r

(8/4)/2 = 2/2 = 1, but 8/(4/2) = 8/2 = 4.

tuple; n-tuple; ordered pair/triple/etc; row vector; (Note that the notation (a,b) is ambiguous: it sequence could be an ordered pair or an open interval. everywhere Set theorists and computer scientists often use angle brackets instead of parentheses.)

(a, b) is an ordered pair (or 2-tuple).

highest common factor

(a, b) means the highest common factor of a and highest common factor; b. greatest common divisor; (3, 7) = 1 (they are coprime); (15, 25) = 5. hcf; gcd (This may also be written hcf(a, b) or gcd(a, b).) number theory . 4 is not in the interval (4, 18). (Note that the notation (a,b) is ambiguous: it could be an ordered pair or an open interval. order theory The notation ]a,b[ can be used instead.) (0, +) equals the set of positive real numbers.

(,) ],[ (,] ],] [,) [,[

open interval open interval

left-open interval half-open interval; left-open interval order theory right-open interval half-open interval; rightopen interval order theory 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. The standard inner product between two vectors There are many variants of the notation, such as x = (2, 3) and y = (1, 5) is: x, y = 2 1 + 3 5 = 13 linear algebra u | v and (u | v), which are described below. For spatial vectors, the dot product notation, xy 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. for a time series :g(t) (t = 1, 2,...) average average of let S be a subset of N for example, represents the average of all the element in S. we can define the structure functions Sq(): . [4, 18) and [1, +) . (1, 7] and (, 1]

inner product

inner product of

,
linear span

statistics

S means the span of S V. That is, it is the intersection of all subspaces of V which contain S. u1, u2, is shorthand for {u1, u2, }. Note that the notation u, v may be ambiguous: linear algebra it could mean the inner product or the linear span. The span of S may also be written as Sp(S). .

(linear) span of; linear hull of

subgroup generated by a set

means the smallest subgroup of G (where S In S3, G, a group) containing every element of S. the subgroup generated by is shorthand for . group theory An ordered list (or sequence, or horizontal tuple; n-tuple; ordered vector, or row vector) of values. pair/triple/etc; row vector; sequence (The notation (a,b) is often used as well.) everywhere u | v means the inner product of u and v, where u and v are members of an inner product

and . is an ordered pair (or 2-tuple). is an ordered triple (or 3-tuple).

tuple

is the empty tuple (or 0-tuple).

| (|) | |

inner product inner product of

space.[8] (u | v) means the same.

Another variant of the notation is u, v which is linear algebra described above. For spatial vectors, the dot product notation, xy 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. ket vector | means the vector with label , which is in a A qubit's state can be represented as |0+ |1, where the ket ; the vector Hilbert space. and are complex numbers s.t. ||2 + ||2 = 1. Dirac notation bra vector | means the dual of the vector |, a linear the bra ; the dual of functional which maps a ket | onto the inner Dirac notation product |. = 12 + 22 + 32 + 42 means a1 + a2 + + an. = 1 + 4 + 9 + 16 = 30

summation sum over from to of arithmetic product product over from to of means a1a2an.

= (1+2)(2+2)(3+2)(4+2) = 3 4 5 6 = 360 means the set of all (n+1)-tuples (y0, , yn).

arithmetic Cartesian product the Cartesian product of; the direct product of set theory coproduct

A general construction which subsumes the disjoint union of sets and of topological spaces, the free product of groups, and the direct sum of coproduct over from modules and vector spaces. The coproduct of a to of family of objects is essentially the "least category theory specific" object to which each object in the family admits a morphism. prime; derivative of f (x) means the derivative of the function f at the point x, i.e., the slope of the tangent to f at x.

derivative

If f(x) := x2, then f (x) = 2x

(The single-quote character ' is sometimes used calculus instead, especially in ASCII text.) means the derivative of x with respect to time. That is . If x(t) := t2, then .

derivative dot; time derivative of calculus indefinite integral or antiderivative indefinite integral of the antiderivative of calculus definite integral

f(x) dx means a function whose derivative is f.

x2 dx = x3/3 + C

b f(x) dx means the signed area between the xintegral from to of a axis and the graph of the function f between x = ab x2 dx = b3/3 a3/3; with respect to a and x = b. calculus line integral C f ds means the integral of f along the curve C, , where r is a

line/path/curve integral of parametrization of C. along calculus (If the curve is closed, the symbol may be used instead, as described below.) Similar to the integral, but used to denote a single integration over a closed curve or loop. It

Contour integral or closed line integral contour integral of calculus

is sometimes used in physics texts involving equations regarding Gauss's Law, and while these formulas involve a closed surface integral, the representations describe only the first integration of the volume over the enclosing surface. Instances where the latter requires simultaneous double integration, the symbol would be more appropriate. A third related symbol is the closed volume integral, denoted by If C is a Jordan curve about 0, then the symbol . The contour integral can also frequently be found with a subscript capital letter C, C, denoting that a closed loop integral is, in fact, around a contour C, or sometimes dually appropriately, a circle C. In representations of Gauss's Law, a subscript capital S, S, is used to denote that the integration is over a closed surface.

gradient del, nabla, gradient of vector calculus divergence

f (x1, , xn) is the vector of partial derivatives If f (x,y,z) := 3xy + z, then f = (3y, 3x, 2z) (f / x1, , f / xn). If . , then

del dot, divergence of vector calculus curl curl of vector calculus partial derivative partial, d boundary boundary of topology degree of a polynomial degree of algebra (This may also be written deg f.) delta delta; change in x means a (non-infinitesimal) change in x. (If the change becomes infinitesimal, and even calculus d are used instead. Not to be confused with the symmetric difference, written , above.) f means the degree of the polynomial f. M means the boundary of M f/xi means the partial derivative of f with respect to xi, where f is a function on (x1, , calculus xn).

If .

, then

If f(x,y) := x2y, then f/x = 2xy

{x : ||x|| 2} = {x : ||x|| = 2}

(x2 1) = 2

is the gradient of a straight line

Laplacian

Laplace operator Dirac delta function Dirac delta of

The Laplace operator is a second order If is a twice-differentiable real-valued function, then the differential operator in n-dimensional Euclidean Laplacian of is defined by vector calculus space (x)

hyperfunction Kronecker delta Kronecker delta of hyperfunction projection Projection of Relational algebra attribute set. 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.14/4. It is also the ratio of the circumference to the diameter of a circle. The selection ab(R) selects all those tuples in restricts R to the {a1,...,an} ij

Age,Weight(Person)

Pi 3.1415926_ or 227

A=R2=314.16R=10

 <: <

selection

Selection of

R for which holds between the a and the b attribute. The selection av(R) selects all those Age = Weight(Person) tuples in R for which holds between the a Relational algebra attribute and the value v .
x < y means that x is covered by y. {1, 8} < {1, 3, 8} among the subsets of {1, 2, , 10} ordered by containment.

cover is covered by order theory subtype is a subtype of type theory conjugate transpose means the transpose of the complex A Enter topic to look up conjugate transpose; conjugate of A.[9] Hermitian adjoint/conjugate/transpose; This may also be written A*T, AT*, A*, AT or adjoint AT. matrix operations transpose transpose AT means A, but with its rows swapped for columns. T1 <: T2 means that T1 is a subtype of T2.

If S <: T and T <: U then S <: U (transitivity).

If A = (aij) then A = (aji).

If A = (aij) then AT = (aji).

matrix operations This may also be written At or Atr. top element the top element means the largest element of a lattice. x : x =

lattice theory top type the top type; top type theory perpendicular is perpendicular to geometry orthogonal complement means the top or universal type; every type in types T, T <: the type system of interest is a subtype of top. 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.

W means the orthogonal complement of W orthogonal/perpendicular (where W is a subspace of the inner product Within complement of; perp space V), the set of all vectors in V orthogonal to linear algebra every vector in W. is coprime to number theory x y means x has no factor greater than 1 in common with y. 34 55.

coprime

independent is independent of probability bottom element the bottom element lattice theory bottom type the bottom type; bot comparability is comparable to order theory entailment

A B means A is an event whose probability is If A B, then P(A|B) = P(A). independent of event B.

means the smallest element of a lattice.

x : x =

means the bottom type (a.k.a. the zero type or empty type); bottom is the subtype of every type types T, <: T type theory in the type system. x y means that x is comparable to y. {e, } {1, 2, e, 3, } under set containment.

entails inference

A B means the sentence A entails the sentence B, that is in every model in which A is true, B is A A A model theory also true.

infers; is derived from propositional logic, predicate logic tensor product, tensor product of modules tensor product of linear algebra

x y means y is derivable from x.

A B B A.

means the tensor product of V and means the tensor product of U.[10] modules V and U over the ring R.

{1, 2, 3, 4} {1, 1, 2} = {{1, 2, 3, 4}, {1, 2, 3, 4}, {2, 4, 6, 8}}

a * b means the product of a and b. multiplication times; multiplied by (Multiplication can also be denoted with or , 4 * 3 means the product of 4 and 3, or 12. or even simple juxtaposition. * is generally used arithmetic where ease of typing and use of ASCII text is preferred, such as programming languages.) .

convolution convolution, convolved with functional analysis complex conjugate z* means the complex conjugate of z. . conjugate f * g means the convolution of f and g.

( can also be used for the conjugate of z, as complex numbers described below.) R* consists of the set of units of the ring R, along with the operation of multiplication.
ring theory This may also be written R as described above, or U(R).

group of units the group of units of

hyperreal numbers the (set of) hyperreals non-standard analysis Hodge dual Hodge dual, Hodge star mean overbar, bar statistics complex conjugate conjugate

*R means the set of hyperreal numbers. Other sets can be used in place of R.

*N is the hypernatural numbers.

*v means the Hodge dual of a vector v. If v is a k-vector within an n-dimensional oriented inner linear algebra product space, then *v is an (nk)-vector. (often read as x bar) is the mean (average value of x i). means the complex conjugate of z.

If {e i} are the standard basis vectors of

(z* can also be used for the conjugate of z, as complex numbers described above.) is the algebraic closure of the field F. is the topological closure of the set S. topology This may also be denoted as cl(S) or Cl(S).

algebraic closure algebraic closure of field theory topological closure (topological) closure of

The field of algebraic numbers is sometimes denoted as because it is the algebraic closure of the rational numbers . In the space of the real numbers, numbers are dense in the real numbers). (the rational

See also
Greek letters used in mathematics, science, and engineering ISO 31-11 List of mathematical abbreviations Mathematical alphanumeric symbols Mathematical notation Notation in probability and statistics Physical constants Roman letters used in mathematics Table of logic symbols Table of mathematical symbols by introduction date Unicode mathematical operators

Variations
In mathematics written in Arabic, some symbols may be reversed to make right-to-left reading easier. [11]

References
1. ^ Rnyai, Lajos (1998), Algoritmusok(Algorithms), TYPOTEX, ISBN 963-9132-16-0 2. ^ Berman, Kenneth A; Paul, Jerome L. (2005), Algorithms: Sequential, Parallel, and Distributed, Boston: Course Technology, p. 822, ISBN 0-534-42057-5 3. ^ 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 (http://www.worldcat.org/oclc/43641333) 4. ^ Copi, Irving M.; Cohen, Carl (1990) [1953], "Chapter 8.3: Conditional Statements and Material Implication", Introduction to Logic (8th ed.), New York: Macmillan, pp. 268269, LCCN 89-37742 (http://lccn.loc.gov/89037742) , ISBN 0023250356

^ a b c d e Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 3, ISBN 0-412-60610-0 ^ a b c d Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p. 4, ISBN 0-412-60610-0 ^ 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, p. 62, ISBN 0-521-63503-9, OCLC 43641333 (http://www.worldcat.org/oclc/43641333) 9. ^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 6970, ISBN 0-52163503-9, OCLC 43641333 (http://www.worldcat.org/oclc/43641333) 10. ^ Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, pp. 7172, ISBN 0-52163503-9, OCLC 43641333 (http://www.worldcat.org/oclc/43641333) 11. ^ M. Benatia, A. Lazrik, and K. Sami, "Arabic mathematical symbols in Unicode (http://www.ucam.ac.ma/fssm/rydarab/doc/expose/unicodeme.pdf) ", 27th Internationalization and Unicode Conference, 2005. 5. 6. 7. 8.

External links
The complete set of mathematics Unicode characters (http://krestavilis.com/math.php) Jeff Miller: Earliest Uses of Various Mathematical Symbols (http://jeff560.tripod.com/mathsym.html) Numericana: Scientific Symbols and Icons (http://www.numericana.com/answer/symbol.htm) TCAEP - Institute of Physics (http://www.tcaep.co.uk/science/symbols/maths.htm) GIF and PNG Images for Math Symbols (http://us.metamath.org/symbols/symbols.html) Mathematical Symbols in Unicode (http://tlt.psu.edu/suggestions/international/bylanguage/math.html#browsers) Using Greek and special characters from Symbol font in HTML (http://www.alanwood.net/demos/symbol.html) Unicode Math Symbols (http://www.vex.net/~trebla/symbols/select.html) - a quick form for using unicode math symbols. DeTeXify handwritten symbol recognition (http://detexify.kirelabs.org/classify.html) doodle a symbol in the box, and the program will tell you what its name is Some Unicode charts of mathematical operators: Index of Unicode symbols (http://www.unicode.org/charts/#symbols) Range 2100 214F: Letterlike Symbols (http://www.unicode.org/charts/PDF/U2100.pdf) Range 2190 21FF: Arrows (http://www.unicode.org/charts/PDF/U2190.pdf) Range 2200 22FF: Unicode Mathematical Operators (http://www.unicode.org/charts/PDF/U2200.pdf) Some Unicode cross-references: Short list of commonly used LaTeX symbols (http://www.artofproblemsolving.com/Wiki/index.php/LaTeX:Symbols) and Comprehensive LaTeX Symbol List (http://mirrors.med.harvard.edu/ctan/info/symbols/comprehensive/) MathML Characters (http://www.robinlionheart.com/stds/html4/entities-mathml) - sorts out Unicode, HTML and MathML/TeX names on one page Unicode values and MathML names (http://www.w3.org/TR/REC-MathML/chap6/bycodes.html) Unicode values and Postscript names (http://svn.ghostscript.com/ghostscript/branches/gs-db/Resource/Decoding/Unicode) from the source code for Ghostscript Retrieved from "http://en.wikipedia.org/wiki/Table_of_mathematical_symbols" Categories: Mathematical notation | Mathematics-related lists | Mathematical symbols | Mathematical tables | Mathematical logic | Lists of symbols This page was last modified on 23 February 2011 at 16:44. Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. See Terms of Use for details. Wikipedia is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.