Professional Documents
Culture Documents
Symbols
SymbolSymbolName
in
in
HTML TeX
Explanation
Examples
Read as
Category
equality
is equal to; equals
2= 2
1+ 1= 2
everywhere
inequality
<
>
strict inequality
3< 4
5> 4
5Z< Z
A3 < S3
0.003 1000000
order theory
proper subgroup
is a proper subgroup of
group theory
inequality
subgroup
34 and 55
54 and 55
H G means H is a subgroup of G.
Z Z
A3 S3
If
is a subgroup of
group theory
reduction
is reducible to
computational complexity
theory
then
Karp reduction
If L1 L2 and L2 P, then L1 P.
computational complexity
theory
proportionality
if y = 2x, then y x.
If L1 L2 and L2 P, then L1 P.
2+7=9
Karp reduction
addition
plus; add
arithmetic
disjoint union
set theory
subtraction
83=5
(5) = 5
minus; without
{1,2,4}{1,3,4}= {2}
multiplication
3
3 4 means the multiplication of 3 by 4.
(The symbol * is generally used in
programming languages, where ease of
arithmetic
typing and use of ASCII text is preferred.)
7 8 = 56
times; multiplied by
Cartesian product
cross product
cross
(1,2,5) (3,4,1) =
(22, 16, 2)
linear algebra
group of units
multiplication
7 8 = 56
(1,2,5) (3,4,1) = 6
2 4 = 0.5
12 4 = 3
times; multiplied by
arithmetic
dot product
dot
linear algebra
division (Obelus)
divided by; over
arithmetic
quotient group
G/H means the quotient of group G modulo {0, a, 2a, b, b+a, b+2a}/{0, b}= {{0, b}, {a, b+a}, {2a, b+2a}}
its subgroup H.
mod
group theory
quotient set
mod
set theory
plus-minus
plus or minus
arithmetic
plus-minus
plus or minus
measurement
minus-plus
minus or plus
arithmetic
square root
square is
real numbers
complex square root
the (complex) square root
of
if
is represented in polar
coordinates with
, then
.
complex numbers
||
Euclidean norm or
Euclidean length or
magnitude
|3|= 3
|5|= |5|= 5
|i| = 1
|3 + 4i|= 5
For x= (3,-4)
Euclidean norm of
geometry
determinant
determinant of
matrix theory
cardinality
|{3, 5, 7, 9}|= 4.
set theory
||||
norm
norm of; length of
linear algebra
nearest integer function
nearest integer to
numbers
divisor, divides
divides
conditional probability
given
probability
restriction
restriction of to ;
restricted to
set theory
such that
such that; so that
everywhere
||
parallel
23||360.
is parallel to
geometry
incomparability
is incomparable to
order theory
exact divisibility
exactly divides
number theory
cardinality
#{4, 6, 8}= 3
set theory
connected sum
connected sum of; knot
sum of; knot composition
of
A#B is the connected sum of the manifolds A A#Sm is homeomorphic to A, for any manifold A, and the sphere
and B. If A and B are knots, then this denotes Sm.
the knot sum, which has a slightly stronger
condition.
aleph number
aleph
set theory
beth number
beth
set theory
cardinality of the
continuum
cardinality of the
continuum; cardinality of
the real numbers; c;
is denoted by
or
set theory
such that
such that; so that
everywhere
field extension
extends; over
field theory
inner product of matrices
inner product of
index of a subgroup
factorial
4! = 1 2 3 4 = 24
factorial
combinatorics
logical negation
probability distribution
has distribution
!(!A)A
xy !(x=y)
statistics
row equivalence
is row equivalent to
matrix theory
same order of magnitude
roughly similar; poorly
approximates
approximation theory
asymptotically equivalent
is asymptotically equivalent
to
f~g means
2~5
89~ 100
but 2 10
x~x+1
asymptotic analysis
equivalence relation
are in the same equivalence
class
a~b means
(and equivalently
1~5 mod 4
).
everywhere
approximately equal
3.14159
is approximately equal to
everywhere
isomorphism
Q/{1,1} V,
where Q is the quaternion group and V is the Klein four-group.
wreath product
normal subgroup
is a normal subgroup of
group theory
ideal
(2)Z
is an ideal of
ring theory
antijoin
the antijoin of
S=R-R
semidirect product
semijoin
natural join
therefore
S=
1,..,an(R
S)
everywhere
because
because; since
everywhere
end of proof
material equivalence
everywhere
material implication
implies; if then
x+ 5= y+ 2 x+ 3= y
propositional logic
logical negation
(A) A
xy (x= y)
wedge product
exponentiation
2^3 = 23 = 8
exclusive or
xor
propositional logic,
Boolean algebra
The statement A B is true when either A or (A) A is always true, A A is always false.
B, but not both, are true. A B means the
same.
direct sum
universal quantification
n: n2 n.
n: n is even.
!n: n+ 5= 2n.
existential quantification
there exists; there is; there
are
predicate logic
uniqueness quantification
there exists exactly one
predicate logic
=:
:=
definition
congruence
is congruent to
geometry
isomorphic
is isomorphic to
congruence relation
5 2 (mod 3)
= {1, 2, 3, }
{,}
set brackets
the set of
set theory
{:}
{|}
{}
empty set
the empty set
{}
{n: 1<n2<4}=
set theory
set membership
is an element of; is not an
element of
[5]
a S means a is an element of the set S;
[5]
a S means a is not an element of S.
(1/2)1
21
subset
superset
set-theoretic union
is a superset of
the union of or ;
union
(AB)A
(AB)B
set theory
set-theoretic intersection
intersected with; intersect
set theory
symmetric difference
10
set-theoretic complement
{1,2,3,4}{3,4,5,6}= {1,2}
minus; without
function arrow
f:X Y means the function f maps the set X Let f:{0} be defined by f(x):= x2.
into the set Y.
from to
set theory, type theory
function arrow
maps to
set theory
function composition
composed with
set theory
Z
n
p
Zn
Zp
natural numbers
integers
= {p,p: p {0} }
integers mod n
p-adic integers
the (set of) p-adic integers
numbers
projective space
rational numbers
3.14000...
11
real numbers
(1)
i= (1)
complex numbers
C; the (set of) complex
numbers
numbers
quaternions or Hamiltonian
quaternions
Big O notation
big-oh of
Computational complexity
theory
infinity
infinity
numbers
floor
floor; greatest integer;
entier
numbers
ceiling
ceiling
nearest integer to
numbers
[:]
[]
[,]
[,,]
12
equivalence class
[a] means the equivalence class of a, i.e. {x: Let a~ b be true iff a b(mod5). Then [2]= {, 8, 3, 2, 7,
x~ a}, where ~ is an equivalence relation.
}.
[a]R means the same, but with R as the
abstract algebra
equivalence relation.
floor
nearest integer to
Iverson bracket
1 if true, 0 otherwise
propositional logic
image
closed interval
closed interval
order theory
commutator
()
(,)
13
function application
of
set theory
image
image of under
combinations
(from) n choose r
everywhere
tuple
number theory
(,)
],[
open interval
. (Note
4 is not in the interval (4, 18). (0, +) equals the set of positive
that the notation (a,b) is ambiguous: it could real numbers.
open interval
order theory be an ordered pair or an open interval. The
notation ]a,b[ can be used instead.)
(,]
],]
left-open interval
(1, 7] and (, 1]
half-open interval;
left-open interval
order theory
[,)
[,[
right-open interval
half-open interval;
right-open interval
order theory
inner product
14
inner product of
average
linear span
In S3,
and
.
.
tuple
tuple; n-tuple; ordered
pair/triple/etc; row vector;
sequence
is an ordered
everywhere
|
(|)
inner product
inner product of
ket vector
the ket ; the vector
Dirac notation
bra vector
the bra ; the dual of
Dirac notation
15
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
arithmetic
Cartesian product
the Cartesian product of;
the direct product of
set theory
coproduct
derivative
derivative
dot;
time derivative of
time. That is
If x(t):=t2, then
calculus
indefinite integral or
antiderivative
x2dx= x3/3 + C
indefinite integral of
the antiderivative of
calculus
definite integral
line integral
line/path/curve integral of
along
a parametrization of C.
calculus (If the curve is closed, the symbol may be
used instead, as described below.)
16
gradient
del, nabla, gradient of
vector calculus
divergence
If
, then
If
, then
partial derivative
partial, d
calculus
boundary
{x : ||x|| 2} = {x : ||x|| = 2}
(x2 1) = 2
boundary of
topology
degree of a polynomial
degree of
algebra
delta
delta; change in
Laplacian
Laplace operator
vector calculus
17
(x)
Dirac delta of
hyperfunction
Kronecker delta
ij
Kronecker delta of
hyperfunction
projection
restricts
Projection of
to the
attribute set.
relational algebra
Pi
3.1415926_ or 227
selection
tuples in
and the
relational algebra
Selection of
<:
<
cover
A=R2=314.16R=10
attribute and
is covered by
order theory
subtype
is a subtype of
type theory
conjugate transpose
matrix operations
transpose
top element
transpose
x: x=
types T, T <:
18
perpendicular
is perpendicular to
geometry
orthogonal complement
Within
orthogonal/perpendicular
complement of; perp
coprime
is coprime to
34 55.
number theory
independent
is independent of
probability
bottom element
x: x=
means the bottom type (a.k.a. the zero type types T, <: T
or empty type); bottom is the subtype of
every type in the type system.
x y means that x is comparable to y.
is comparable to
order theory
entailment
entails
model theory
inference
AB BA.
(4,3,1,1) 9,
is a partition of
number theory
[10]
U.
multiplication
19
a*b means the product of a and b.
(Multiplication can also be denoted with
or , or even simple juxtaposition. * is
arithmetic
generally used where ease of typing and use
of ASCII text is preferred, such as
programming languages.)
times; multiplied by
convolution
convolution, convolved
with
functional analysis
complex conjugate
conjugate
complex numbers
group of units
hyperreal numbers
the (set of) hyperreals
non-standard analysis
Hodge dual
Hadamard product
entrywise product
linear algebra
mean
overbar, bar
statistics
complex conjugate
conjugate
complex numbers
algebraic closure
algebraic closure of
field theory
topological closure
(topological) closure of
topology
Variations
In mathematics written in Arabic, some symbols may be reversed to make right-to-left(boustrophedon) writing and
reading easier. [11]
References
[1] Rnyai, Lajos (1998), Algoritmusok(Algorithms), TYPOTEX, ISBN963-9132-16-0
[2] Berman, Kenneth A; Paul, Jerome L. (2005), Algorithms: Sequential, Parallel, and Distributed, Boston: Course Technology, p.822,
ISBN0-534-42057-5
[3] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press,
p.66, ISBN0-521-63503-9, OCLC43641333
[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, ISBN0023250356, LCCN89-37742
[5] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p.3, ISBN0-412-60610-0
[6] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p.4, ISBN0-412-60610-0
[7] Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, p.5, ISBN0-412-60610-0
[8] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press,
p.62, ISBN0-521-63503-9, OCLC43641333
[9] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press,
pp.6970, ISBN0-521-63503-9, OCLC43641333
[10] Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press,
pp.7172, ISBN0-521-63503-9, OCLC43641333
[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.
External links
20
21
License
Creative Commons Attribution-Share Alike 3.0 Unported
http:/ / creativecommons. org/ licenses/ by-sa/ 3. 0/
22