गणितीय प्रतीकों की सारणी

मुक्त ज्ञानकोश विकिपीडिया से
यहाँ जाएँ: भ्रमण, खोज


सामान्य प्रतीक (Common symbols)[संपादित करें]

नीचे गणित के सभी शाखाओं में प्रयोग में आने वाले प्रतीकों की सूची दी गयी है। सभी संकेत एचटीएमएल (HTML) तथा टेक्स (TeX) दोनों में ही दिये गये हैं।

यह सूची अपूर्ण है, इसको पूर्ण करने में मदद करें।

संकेत
एचटीएमएल में
संकेत
TeX में
नाम व्याख्या उदाहरण
इसे ऐसे पढ़ते हैं
श्रेणी
=
= \!\,
समता चिन्ह
बराबर , बराबर है
सब जगह
x = y का अर्थ है कि x और y के मान बराबर हैं या दोनो एक ही चीज को निरूपित कर रहे हैं। 2 = 2
1 + 1 = 2
\ne \!\,
असमता
बराबर नहीं है ; असमान है
सर्वत्र
x ≠ y का अर्थ है कि x और y के मान समान नहीं है अथवा दोनो एक ही चीज को निरूपित नहीं करते।

(The forms !=, /= or <> are generally used in programming languages where ease of typing and use of ASCII text is preferred.)
2 + 2 ≠ 5
<

>
< \!\,

> \!\,
is less than, is greater than
x < y means x is less than y.

x > y means x is greater than y.
3 < 4
5 > 4
is a proper subgroup of
H < G means H is a proper subgroup of G. 5Z < Z
A3  < S3


\ll \!\,

\gg \!\,
is much less than, is much greater than
x ≪ y means x is much less than y.

x ≫ y means x is much greater than y.
0.003 ≪ 1000000
asymptotic comparison
of smaller (greater) order than
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 ≪ ex


\le \!\,

\ge \!\,
is less than or equal to, is greater than or equal to
x ≤ y means x is less than or equal to y.

x ≥ 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 ≤ 4 and 5 ≤ 5
5 ≥ 4 and 5 ≥ 5
is a subgroup of
H ≤ G means H is a subgroup of G. Z ≤ Z
A3  ≤ S3
is reducible to
A ≤ 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
\prec \!\,
is Karp reducible to; is polynomial-time many-one reducible to
L1 ≺ L2 means that the problem L1 is Karp reducible to L2.[1] If L1 ≺ L2 and L2 ∈ P, then L1 ∈ P.
\propto \!\,
is proportional to; varies as
everywhere
yx means that y = kx for some constant k. if y = 2x, then yx.
is Karp reducible to; is polynomial-time many-one reducible to
A ∝ B means the problem A can be polynomially reduced to the problem B. If L1 ∝ L2 and L2 ∈ P, then L1 ∈ P.
+
+ \!\,
plus; add
4 + 6 means the sum of 4 and 6. 2 + 7 = 9
the disjoint union of ... and ...
A1 + A2 means the disjoint union of sets A1 and A2. A1 = {3, 4, 5, 6} ∧ A2 = {7, 8, 9, 10} ⇒
A1 + A2 = {(3,1), (4,1), (5,1), (6,1), (7,2), (8,2), (9,2), (10,2)}
- \!\,
minus; take; subtract
9 − 4 means the subtraction of 4 from 9. 8 − 3 = 5
negative; minus; the opposite of
−3 means the negative of the number 3. −(−5) = 5
minus; without
A − B means the set that contains all the elements of A that are not in B.

(∖ can also be used for set-theoretic complement as described below.)
{1,2,4} − {1,3,4}  =  {2}
×
\times \!\,
times; multiplied by
3 × 4 means the multiplication of 3 by 4. 7 × 8 = 56
the Cartesian product of ... and ...; the direct product of ... and ...
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
u × v means the cross product of vectors u and v (1,2,5) × (3,4,−1) =
(−22, 16, − 2)
the group of units of
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{align} (\mathbb{Z} / 5\mathbb{Z})^\times & = \{ [1], [2], [3], [4] \} \\ & \cong C_4 \\ \end{align}
·
\cdot \!\,
times; multiplied by
3 · 4 means the multiplication of 3 by 4. 7 · 8 = 56
dot
u · v means the dot product of vectors u and v (1,2,5) · (3,4,−1) = 6
÷

\div \!\,

/ \!\,
divided by; over
6 ÷ 3 or 6 ⁄ 3 means the division of 6 by 3. 2 ÷ 4 = .5

12 ⁄ 4 = 3
mod
G / H means the quotient of group G modulo its subgroup H. {0, a, 2a, b, b+a, b+2a} / {0, b} = {{0, b}, {a, b+a}, {2a, b+2a}}
quotient set
mod
A/~ means the set of all ~ equivalence classes in A. If we define ~ by x ~ y ⇔ x − y ∈ , then
/~ = {x + n : n ∈  : x ∈ (0,1]}
±
\pm \!\,
plus or minus
6 ± 3 means both 6 + 3 and 6 − 3. The equation x = 5 ± √4, has two solutions, x = 7 and x = 3.
plus or minus
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.
\mp \!\,
minus or plus
6 ± (3 5) means both 6 + (3 − 5) and 6 − (3 + 5). cos(x ± y) = cos(x) cos(y) sin(x) sin(y).
\surd \!\,

\sqrt{\ } \!\,
the (principal) square root of
\sqrt{x} means the positive number whose square is x. \sqrt{4}=2
the (complex) square root of
if z=r\,\exp(i\phi) is represented in polar coordinates with -\pi < \phi \le \pi, then \sqrt{z} = \sqrt{r} \exp(i \phi/2). \sqrt{-1}=i
|…|
| \ldots | \!\,
absolute value of; modulus of
|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 distance between; Euclidean norm of
|x – y| means the Euclidean distance between x and y. For x = (1,1), and y = (4,5),
|\textbf{x}-\textbf{y}|=\sqrt{(1-4)^2+(1-5)^2}=5
determinant of
|A| means the determinant of the matrix A \begin{vmatrix}
 1&2 \\
 2&4 \\
\end{vmatrix} = 0
cardinality of; size of; order of
|X| means the cardinality of the set X.

(# may be used instead as described below.)
|{3, 5, 7, 9}| = 4.
||…||
\| \ldots \| \!\,
norm of; length of
|| x || means the norm of the element x of a normed vector space.[3] || x  + y || ≤  || x ||  +  || y ||
nearest integer to
||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


\mid \!\,

 \nmid \!\,
divides
a|b means a divides b.
ab means a does not divide b.

(This symbol can be difficult to type, and its negation is rare, so a regular but slightly shorter vertical bar | character can be used.)
Since 15 = 3×5, it is true that 3|15 and 5|15.
given
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 of … to …; restricted to
f|A means the function f 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) = x2 is not injective, but f|R+ is injective.
||
\| \!\,
is parallel to
x || y means x is parallel to y. If l || m and m ⊥ n then l ⊥ n.
is incomparable to
x || y means x is incomparable to y. {1,2} || {2,3} under set containment.
exactly divides
pa || n means pa exactly divides n (i.e. pa divides n but pa+1 does not). 23 || 360.
#
\# \!\,
cardinality of; size of; order of
#X means the cardinality of the set X.

(|…| may be used instead as described above.)
#{4, 6, 8} = 3
connected sum of; knot sum of; knot composition of
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#Sm is homeomorphic to A, for any manifold A, and the sphere Sm.
\aleph \!\,
aleph
α represents an infinite cardinality (specifically, the α-th one, where α is an ordinal). |ℕ| = ℵ0, which is called aleph-null.
\beth \!\,
beth
α 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}.
𝔠
\mathfrak c \!\,
cardinality of the continuum; cardinality of the real numbers; c;
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}
:
: \!\,
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.
extends; over
K : F means the field K extends the field F.

This may also be written as KF.
ℝ : ℚ
inner product of matrices
inner product of
A : B means the Frobenius inner product of the matrices A and B.

The general inner product is denoted byuv⟩, ⟨u | vor (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}\!\,
!
! \!\,
factorial
n! means the product 1 × 2 × ... × n. 4! = 1 × 2 × 3 × 4 = 24
not
The statement !A is true if and only if A is false.

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

(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)
~
\sim \!\,
has distribution
X ~ D, means the random variable X has the probability distribution D. X ~ N(0,1), the standard normal distribution
is row equivalent to
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}
roughly similar; poorly approximates
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 π2 ≈ 10
is asymptotically equivalent to
f ~ g means \lim_{n\to\infty} \frac{f(n)}{g(n)} = 1. x ~ x+1

are in the same equivalence class
everywhere
a ~ b means b \in [a] (and equivalently a \in [b]). 1 ~ 5 mod 4

\approx \!\,
approximately equal
is approximately equal to
everywhere
x ≈ y means x is approximately equal to y. π ≈ 3.14159
is isomorphic to
G ≈ H means that group G is isomorphic (structurally identical) to group H.

( can also be used for isomorphic, as described below.)
Q / {1, −1} ≈ V,
where Q is the quaternion group and V is the Klein four-group.
\wr \!\,
wreath product of … by …
A ≀ H means the wreath product of the group A by the group H.

This may also be written A wr H.
S_n \wr Z_2 is isomorphic to the automorphism group of the complete bipartite graph on (n,n) vertices.


\triangleleft \!\,

\triangleright \!\,
is a normal subgroup of
N  G means that N is a normal subgroup of group G. Z(G G
is an ideal of
I  R means that I is an ideal of ring R. (2)  Z
the antijoin of
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


\ltimes \!\,

\rtimes \!\,
the semidirect product of
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 C_n \rtimes C_2
the semijoin of
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 = \Pia1,..,an(R \bowtie S)
\bowtie \!\,
the natural join of
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.
\therefore \!\,
therefore; so; hence
everywhere
Sometimes used in proofs before logical consequences. All humans are mortal. Socrates is a human. ∴ Socrates is mortal.
\because \!\,
because; since
everywhere
Sometimes used in proofs before reasoning. 3331 is prime ∵ it has no positive integer factors other than itself and one.








\blacksquare \!\,

\Box \!\,

\blacktriangleright \!\,
QED; tombstone; Halmos symbol
everywhere
Used to mark the end of a proof.

(May also be written Q.E.D.)




\Rightarrow \!\,

\rightarrow \!\,

\supset \!\,
implies; if … then
AB 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 = 2  ⇒  x2 = 4 is true, but x2 = 4   ⇒  x = 2 is in general false (since x could be −2).


\Leftrightarrow \!\,

\leftrightarrow \!\,
if and only if; iff
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
¬

˜
\neg \!\,

\sim \!\,
not
The statement ¬A is true if and only if A is false.

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

(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) ⇔ A
x ≠ y  ⇔  ¬(x =  y)
\and \!\,
and; min; meet
The statement AB 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; exterior product
uv means the wedge product of vectors u and v. This generalizes the cross product to higher dimensions.

(For vectors in R3, × can also be used.)
u \wedge v = u \times v, \mbox{ if } u, v \in \mathbb{R}^3
… (raised) to the power of …
everywhere
a ^ b means a raised to the power of b

(a ^ b is more commonly written ab. The symbol ^ is generally used in programming languages where ease of typing and use of plain ASCII text is preferred.)
2^3 = 23 = 8
\or \!\,
or; max; join
The statement AB 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.


\oplus \!\,

\veebar \!\,
xor
The statement AB is true when either A or B, but not both, are true. A B means the same. A) ⊕ A is always true, AA is always false.
direct sum of
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 = VW ⇔ (U = V + W) ∧ (VW = {0})
\forall \!\,
for all; for any; for each
∀ x: P(x) means P(x) is true for all x. ∀ n ∈ : n2 ≥ n.
\exists \!\,
there exists; there is; there are
∃ x: P(x) means there is at least one x such that P(x) is true. ∃ n ∈ : n is even.
∃!
\exists! \!\,
there exists exactly one
∃! x: P(x) means there is exactly one x such that P(x) is true. ∃! n ∈ : n + 5 = 2n.
:=



:⇔





:= \!\,

\equiv \!\,

:\Leftrightarrow \!\,

\triangleq \!\,

\overset{\underset{\mathrm{def}}{}}{=} \!\,

\doteq \!\,
is defined as; equal by definition
everywhere
x := y or x ≡ y means x is defined to be another name for y, under certain assumptions taken in context.

(Some writers useto mean congruence).

P :⇔ Q means P is defined to be logically equivalent to Q.
\cosh x := \frac{e^x + e^{-x}}{2}
\cong \!\,
is congruent to
△ABC △DEF means triangle ABC is congruent to (has the same measurements as) triangle DEF.
is isomorphic to
G  H means that group G is isomorphic (structurally identical) to group H.

(≈ can also be used for isomorphic, as described above.)
\mathbb{R}^2 \cong \mathbb{C}.
\equiv \!\,
... is congruent to ... modulo ...
ab (mod n) means ab is divisible by n 5 ≡ 2 (mod 3)
{ , }
{\{\ ,\!\ \}} \!\,
set brackets
the set of …
{a,b,c} means the set consisting of a, b, and c.[5]  = { 1, 2, 3, …}
{ : }

{ | }
\{\ :\ \} \!\,

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


{ }
\empty \!\,

\varnothing \!\,

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


\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;[5] a  S means a is not an element of S.[5] (1/2)−1 ∈ 

2−1  


\subseteq \!\,

\subset \!\,
is a subset of
(subset) A ⊆ B means every element of A is also an element of B.[6]

(proper subset) A ⊂ B means A ⊆ B but A ≠ B.

(Some writers use the symbolas if it were the same as ⊆.)
(A ∩ B) ⊆ A

 ⊂ 

 ⊂ 


\supseteq \!\,

\supset \!\,
is a superset of
A ⊇ B means every element of B is also an element of A.

A ⊃ B means A ⊇ B but A ≠ B.

(Some writers use the symbolas if it were the same as.)
(A ∪ B) ⊇ B

 ⊃ 
\cup \!\,
the union of … or …; union
A ∪ B means the set of those elements which are either in A, or in B, or in both.[6] A ⊆ B  ⇔  (A ∪ B) = B
\cap \!\,
intersected with; intersect
A ∩ B means the set that contains all those elements that A and B have in common.[6] {x ∈  : x2 = 1} ∩  = {1}
\vartriangle \!\,
symmetric difference
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}
\setminus \!\,
minus; without
A  B means the set that contains all those elements of A that are not in B.[6]

(− can also be used for set-theoretic complement as described above.)
{1,2,3,4}  {3,4,5,6} = {1,2}
\to \!\,
function arrow
from … to
fX → Y means the function f maps the set X into the set Y. Let f → ∪{0} be defined by f(x) := x2.
\mapsto \!\,
function arrow
maps to
fa ↦ b means the function f maps the element a to the element b. Let fx ↦ x+1 (the successor function).
\circ \!\,
composed with
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).


N
\mathbb{N} \!\,

\mathbf{N} \!\,
N; the (set of) natural 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 ∈ }


Z
\mathbb{Z} \!\,

\mathbf{Z} \!\,
Z; the (set of) integers
means {..., −3, −2, −1, 0, 1, 2, 3, ...}.

+ or > means {1, 2, 3, ...} . means {0, 1, 2, 3, ...} .

 = {p, −p : p ∈  ∪ {0}​}
n

p

Zn

Zp
\mathbb{Z}_n \!\,

\mathbb{Z}_p \!\,

\mathbf{Z}_n \!\,

\mathbf{Z}_p \!\,
Zn; the (set of) integers modulo n
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.
3 = {[0], [1], [2]}
the (set of) p-adic integers


Note that any letter may be used instead of p, such as n or l.


P
\mathbb{P} \!\,

\mathbf{P} \!\,
P; the projective space, the projective line, the projective plane
means a space with a point at infinity. \mathbb{P}^1,\mathbb{P}^2
the probability of
(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.


Q
\mathbb{Q} \!\,

\mathbf{Q} \!\,
Q; the (set of) rational numbers; the rationals
means {p/q : p ∈ , q ∈ }. 3.14000... ∈

π 


R
\mathbb{R} \!\,

\mathbf{R} \!\,
R; the (set of) real numbers; the reals
means the set of real numbers. π ∈

√(−1) 


C
\mathbb{C} \!\,

\mathbf{C} \!\,
C; the (set of) complex numbers
means {a + b i : a,b ∈ }. i = √(−1) ∈


H
\mathbb{H} \!\,

\mathbf{H} \!\,
quaternions or Hamiltonian quaternions
H; the (set of) quaternions
means {a + b i + c j + d k : a,b,c,d ∈ }.
O
O
big-oh of
The Big O notation describes the limiting behavior of a function, when the argument tends towards a particular value or infinity. If f(x) = 6x4 − 2x3 + 5 and g(x) = x4 , then f(x)=O(g(x))\mbox{ as }x\to\infty\,
\infty \!\,
infinity
∞ is an element of the extended number line that is greater than all real numbers; it often occurs in limits. \lim_{x\to 0} \frac{1}{|x|} = \infty
⌊…⌋
\lfloor \ldots \rfloor \!\,
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).)
⌊4⌋ = 4, ⌊2.1⌋ = 2, ⌊2.9⌋ = 2, ⌊−2.6⌋ = −3
⌈…⌉
\lceil \ldots \rceil \!\,
ceiling
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 to
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
[ : ]
[\ :\ ] \!\,
the degree of
[K : F] means the degree of the extension K : F. [ℚ(√2) : ℚ] = 2

[ℂ : ℝ] = 2

[ℝ : ℚ] = ∞
[ ]

[ , ]

[ , , ]
[\ ] \!\,

[\ ,\ ] \!\,

[\ ,\ ,\ ] \!\,
the equivalence class of
[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; greatest integer; entier
[x] means the floor of x, i.e. the largest integer less than or equal to x.

(This may also be writtenx⌋, 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 to
[x] means the nearest integer to x.

(This may also be writtenx⌉, ||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
1 if true, 0 otherwise
[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}]=0, [5 ∈ {2,3,4}]=0
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
[a,b] = \{x \in \mathbb{R} : a \le x \le b \}. 0 and 1/2 are in the interval [0,1].
the commutator of
[gh] = g−1h−1gh (or ghg−1h−1), if g, hG (a group).

[ab] = ab − ba, if a, b ∈ R (a ring or commutative algebra).
xy = x[xy] (group theory).

[ABC] = A[BC] + [AC]B (ring theory).
the triple scalar product of
[abc] = a × b · c, the scalar product of a × b with c. [abc] = [bca] = [cab].
( )

( , )
(\ ) \!\,

(\ ,\ ) \!\,
function application
of
f(x) means the value of the function f at the element x. If f(x) := x2, then f(3) = 32 = 9.
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; 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; 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
(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.

( , ]

] , ]
(\ ,\ ] \!\,

]\ ,\ ] \!\,
half-open interval; left-open interval
(a,b] = \{x \in \mathbb{R} : a < x \le b \}. (−1, 7] and (−∞, −1]
[ , )

[ , [
[\ ,\ ) \!\,

[\ ,\ [ \!\,
half-open interval; right-open interval
[a,b) = \{x \in \mathbb{R} : a \le x < b \}. [4, 18) and [1, +∞)
⟨⟩

⟨,⟩
\langle\ \rangle \!\,

\langle\ ,\ \rangle \!\,
inner product of
u,v⟩ means the inner product of u and v, where u and v are members of an inner product space.

Note that the notationu, vmay be ambiguous: it could mean the inner product or the linear span.

There are many variants of the notation, such asu | vand (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. Asandcan 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
(linear) span of;
linear hull of
S⟩ means the span of SV. That is, it is the intersection of all subspaces of V which contain S.
u1u2, …⟩is shorthand for ⟨{u1u2, …}⟩.


Note that the notationuvmay be ambiguous: it could mean the inner product or the linear span.

The span of S may also be written as Sp(S).

\left\lang \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\rang = \mathbb{R}^3.
subgroup generated by a set
the subgroup generated by
 \langle S \rangle means the smallest subgroup of G (where SG, a group) containing every element of S.
 \langle g_1, g_2, ... \rangle is shorthand for  \langle {g_1, g_2, ...} \rangle .
In S3,  \langle(1 \; 2) \rangle  = \{id,\; (1 \; 2)\} and  \langle (1 \; 2 \; 3) \rangle = \{id, \; (1 \; 2 \; 3),(1 \; 2 \; 3))\} .
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 of
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 isuvwhich is described above. For spatial vectors, the dot product notation, x·y is common. For matrices, the colon notation A : B may be used. Asandcan be hard to type, the more “keyboard friendly” forms < and > are sometimes seen. These are avoided in mathematical texts.
|⟩
|\ \rangle \!\,
the ket …; the vector …
|φ⟩ 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.
⟨|
\langle\ | \!\,
the bra …; the dual of …
φ| means the dual of the vector |φ⟩, a linear functional which maps a ket |ψ⟩ onto the inner product ⟨φ|ψ⟩.
\sum \!\,
sum over … from … to … of
\sum_{k=1}^{n}{a_k} means a1 + a2 + … + an. \sum_{k=1}^{4}{k^2} = 12 + 22 + 32 + 42 
= 1 + 4 + 9 + 16 = 30
\prod \!\,
product over … from … to … of
\prod_{k=1}^na_k means a1a2···an. \prod_{k=1}^4(k+2) = (1+2)(2+2)(3+2)(4+2)
= 3 × 4 × 5 × 6 = 360
the Cartesian product of; the direct product of
\prod_{i=0}^{n}{Y_i} means the set of all (n+1)-tuples
(y0, …, yn).
\prod_{n=1}^{3}{\mathbb{R}} = \mathbb{R}\times\mathbb{R}\times\mathbb{R} = \mathbb{R}^3
\coprod \!\,
coproduct over … from … to … of
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.


' \!\,

\dot{\,} \!\,
… 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.

The dot notation indicates a time derivative. That is \dot{x}(t)=\frac{\partial}{\partial t}x(t).

If f(x) := x2, then f ′(x) = 2x
\int \!\,
indefinite integral of

the antiderivative of
∫ f(x) dx means a function whose derivative is f. x2 dx = x3/3 + C
integral from … to … of … with respect to
ab f(x) dx means the signed area between the x-axis and the graph of the function f between x = a and x = b. ab x2 dx = b3/3 − a3/3;
line/path/curve integral of … along …
C f ds means the integral of f along the curve C, \textstyle \int_a^b f(\mathbf{r}(t)) |\mathbf{r}'(t)|\, dt, where r is a parametrization of C.

(If the curve is closed, the symbolmay be used instead, as described below.)
\oint \!\,
contour integral of
Similar to the integral, but used to denote a single integration over a closed curve or loop. It 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 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.

If C is a Jordan curve about 0, then \oint_C {1 \over z}\,dz = 2\pi i.
\nabla \!\, f (x1, …, xn) is the vector of partial derivatives (∂f / ∂x1, …, ∂f / ∂xn). If f (x,y,z) := 3xy + z², then ∇f = (3y, 3x, 2z)
del dot, divergence of
 \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 of
 \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} .
\partial \!\,
partial, d
f/∂xi means the partial derivative of f with respect to xi, where f is a function on (x1, …, xn). If f(x,y) := x2y, then ∂f/∂x = 2xy
boundary of
M means the boundary of M ∂{x : ||x|| ≤ 2} = {x : ||x|| = 2}
degree of
f means the degree of the polynomial f.

(This may also be written deg f.)
∂(x2 − 1) = 2
Δ
\Delta \!\,
delta; change in
Δ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 x}{\Delta y} is the gradient of a straight line
δ
\delta \!\,
Dirac delta of
\delta(x) = \begin{cases} \infty, & x = 0 \\ 0, & x \ne 0 \end{cases} δ(x)
Kronecker delta of
\delta_{ij} = \begin{cases} 1, & i = j \\ 0, & i \ne j \end{cases} δij
π
\pi \!\,
Projection of
\pi_{a_1, ...,a_n}( R ) restricts R to the \{a_1,...,a_n\} attribute set. \pi_{Age,Weight}(Person)
σ
 \sigma \!\,
Selection of
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_{Age \ge 34}( Person )
\sigma_{Age = Weight}( Person )
<:

<: \!\,

{<}{\cdot} \!\,
is covered by
x <• y means that x is covered by y. {1, 8} <• {1, 3, 8} among the subsets of {1, 2, …, 10} ordered by containment.
is a subtype of
T1 <: T2 means that T1 is a subtype of T2. If S <: T and T <: U then S <: U (transitivity).

{}^\dagger \!\,
conjugate transpose; Hermitian adjoint/conjugate/transpose; adjoint
A means the transpose of the complex conjugate of A.[9]

This may also be written A*T, AT*, A*, AT or AT.
If A = (aij) then A = (aji).
T
{}^{\mathsf{T}} \!\,
transpose
AT means A, but with its rows swapped for columns.

This may also be written At or Atr.
If A = (aij) then AT = (aji).
\top \!\,
the top element
⊤ means the largest element of a lattice. x : x ∨ ⊤ = ⊤
the top type; top
⊤ means the top or universal type; every type in the type system of interest is a subtype of top. ∀ types T, T <: ⊤
\bot \!\,
is perpendicular to
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/perpendicular complement of; perp
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}.
is coprime to
x ⊥ y means x has no factor in common with y. 34  ⊥  55.
the bottom element
⊥ means the smallest element of a lattice. x : x ∧ ⊥ = ⊥
the bottom type; bot
⊥ 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
is comparable to
xy means that x is comparable to y. {eπ} ⊥ {1, 2, e, 3, π} under set containment.
\vDash \!\,
entails
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 ∨ ¬A
\vdash \!\,
infers; is derived from
x  y means y is derivable from x. A → B  ¬B → ¬A.
\otimes \!\,
tensor product of
V \otimes U means the tensor product of V and U.[10] 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, 2, 3, 4}, {1, 2, 3, 4}, {2, 4, 6, 8}}
*
* \!\,
convolution, convolved with
f * g means the convolution of f and g. (f * g)(t) = \int_{-\infty}^{\infty} f(\tau) g(t - \tau)\, d\tau.
conjugate
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.
the group of units of
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{align} (\mathbb{Z} / 5\mathbb{Z})^\ast & = \{ [1], [2], [3], [4] \} \\ & \cong C_4 \\ \end{align}
the (set of) hyperreals
*R means the set of hyperreal numbers. Other sets can be used in place of R. *N is the hypernatural numbers.
Hodge dual, Hodge star
The Hodge dual of a k-vector within an n-dimensional oriented inner product space 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
x
\bar{x} \!\,

overbar, … bar
\bar{x} (often read as “x bar”) is the mean (average value of x_i). x = \{1,2,3,4,5\}; \bar{x} = 3.
conjugate
\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.
algebraic closure of
\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}}.
(topological) closure of
\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).

मानकीकरण[संपादित करें]

इन्हें भी देखें[संपादित करें]

भिन्नताएँ[संपादित करें]

कभी-कभी एक ही गणितीय संक्रिया के लिये अलग-अलग चिन्ह प्रयोग किये जाते हैं। जब गणित अरबी में लिखा जाता है तो कुछ संकेतों को उल्टा करना पड़ सकता है ताकि दायें से बायें पढ़ने में सुविधा हो। [11]

सन्दर्भ[संपादित करें]

  1. Rónyai, Lajos (1998), Algoritmusok(Algorithms), TYPOTEX, आई॰ऍस॰बी॰ऍन॰ 963-9132-16-0 
  2. Berman, Kenneth A; Paul, Jerome L. (2005), Algorithms: Sequential, Parallel, and Distributed, Boston: Course Technology, प॰ 822, आई॰ऍस॰बी॰ऍन॰ 0-534-42057-5 
  3. Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, प॰ 66, आई॰ऍस॰बी॰ऍन॰ 0-521-63503-9, 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, प॰ 268–269, आई॰ऍस॰बी॰ऍन॰ 0023250356, LCCN 89-37742 
  5. Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, प॰ 3, आई॰ऍस॰बी॰ऍन॰ 0-412-60610-0 
  6. Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, प॰ 4, आई॰ऍस॰बी॰ऍन॰ 0-412-60610-0 
  7. Goldrei, Derek (1996), Classic Set Theory, London: Chapman and Hall, प॰ 5, आई॰ऍस॰बी॰ऍन॰ 0-412-60610-0 
  8. Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, प॰ 62, आई॰ऍस॰बी॰ऍन॰ 0-521-63503-9, OCLC 43641333 
  9. Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, प॰ 69–70, आई॰ऍस॰बी॰ऍन॰ 0-521-63503-9, OCLC 43641333 
  10. Nielsen, Michael A; Chuang, Isaac L (2000), Quantum Computation and Quantum Information, New York: Cambridge University Press, प॰ 71–72, आई॰ऍस॰बी॰ऍन॰ 0-521-63503-9, OCLC 43641333 
  11. M. Benatia, A. Lazrik, and K. Sami, "Arabic mathematical symbols in Unicode", 27th Internationalization and Unicode Conference, 2005.

बाहरी कड़ियाँ[संपादित करें]

गणितीय आपरेटरों (mathematical operators) के यूनिकोड चार्ट-
कुछ यूनिकोड के सन्दर्भ