Glossary
Table of Contents
- 1. Terminology
- 1.1. Prepositions
- 1.2. Affixes
- 1.3. Objects
- 1.4. Properties
- 1.5. Actions
- 2. Notations
- 3. Translations
- 4. Special Objects
- 5. Reference
1. Terminology
1.1. Prepositions
- on
- Functions are defined on a domain
- under
- The domain and the codomain is under the function
- over
- A vector space is defined over a field.
- where
- Used for defining
- when
- Used for constraining
- for
- Used for constraining, defining
- \(a^2+b^2= c^2\), for integer \(a, b, c\).
- with
- Used for additional properties, constraining, defining
1.2. Affixes
- a-
- Not having a property.
- e.g. asymmetry: \(x \le y \not\Rightarrow y\le x\).
- anti-
- Refusing the property. Polar opposite.
- e.g. antisymmtry: \(x < y \Rightarrow \neg(y < x)\)
- skew-
- Symmetric with negative sign. Alternating
- e.g. skew-symmetry: \(x\times y = - y\times x\), or \(A^\top = -A\)
- semi-
- Half the case.
- e.g. Semilinearity:
- quasi-
- Not the case, but in some sense it is.
- sesqui-
- One and a half the case.
- e.g. algebra/Abstract Algebra.html#orga94437c
1.3. Objects
1.3.1. Ansatz
- German word for attempt, approach.
math
A rough guess of solution.
1.3.2. Necklace
- Circular object with rotational symmetry.
1.3.3. Bracelet
- Circular object with rotational and reflective symmetry.
1.3.4. Set Function
Function whose domain is a family of subsets of a set, and codomain is the extended real number line.
1.3.5. Telescoping Series
- It is a series \(\sum t_{n} \), such that \(t_{n}=a_{n+1}-a_{n}\) for some sequence \((a_{n})\).
- It is useful because the partial sum cancels down to only two terms. This cancellation technique is called method of differences, or sometimes telescoping.
1.3.6. Generating Function
- Olympiad level counting (Generating functions) - YouTube
- An expression which its series expansion contains the sequence as coefficients.
- This allows one to make a claim about the global properties of the coefficients.
1.3.6.1. Ordinary Generating Function
- OGF
- \[ G(a_n;x) = \sum_{n=0}^\infty a_nx^n \]
- \[ G(a_{m,n};x,y) = \sum_{m,n=0}^\infty a_{m,n}x^my^n \]
1.3.6.2. Exponential Generating Function
- EGF
- \[ \mathrm{EG}(a_n;x) = \sum_{n=0}^\infty a_n\frac{x^n}{n!} \]
1.3.6.2.1. Properties
- \[ G(a_n;x) = \int_0^\infty e^{-t}\mathrm{EG}(a_n; tx)\,dt \]
1.3.6.3. Poisson Generating Function
- \[ \mathrm{PG}(a_n;x) = \sum_{n=0}^\infty a_ne^{-x}\frac{x^n}{n!} = e^{-x}\mathrm{EG}(a_n;x) \]
1.3.6.4. Lambert Series
- \[ \mathrm{LG}(a_n;x) = \sum_{n=1}^\infty a_n\frac{x^n}{1-x_n} \]
1.3.6.5. Bell Series
- \[ \mathrm{BG}_p(a_n;x) = \sum_{n=0}^\infty a_{p^n}x^n \]
- for prime \(p\).
1.3.6.6. Dirichlet Series Generating Function
- DGF
- \[ \mathrm{DG}(a_n;s) = \sum_{n=1}^\infty \frac{a_n}{n^s} \]
1.3.6.7. Polynomial Sequence Generating Function
- \[ G(p_n(x); t) \]
- See binomial type
1.3.7. Envelope
1.3.8. Function Space
Set of functions between two fixed sets.
1.3.9. Class
Collection of objects that can be unambiguously defined by a property that all its members share.
1.3.9.1. Proper Class
A class that is not a set.
1.4. Properties
1.4.1. Well-Defined
1.4.2. Definite
- An object \( A \) is positive definite if there's a sense in which: \[ A > 0\quad \text{(positive)} \] for every cases, besides the trivial case in which \( A = 0\ \text{(definite)} \).
- The semidefiniteness also allows \( A=0 \) for non-trivial cases.
- It is similarly defined for negative definite ( \( < \) ) and negative semidefinite ( \( \le \) ).
1.4.3. Complete
A set \( A \) is complete, if every Cauchy sequence converges within \( A \).
1.4.4. Pathological
- The adjective for the edge cases.
- The opposite is well-behaved.
1.4.4.1. Examples
- Cauchy Distribution
- ./calculus/Analysis.html#org4dbfb9a
1.4.5. Bounded
1.4.5.1. Definition
- A set \( A \) is said to be bounded if \( \exists \varepsilon > 0, B_\varepsilon(a)\supset A, a\in A \) , where \( B_\varepsilon \) is the \( \varepsilon \)-ball.
1.4.5.2. Total Boundedness
- A set \( A \) is totally bounded if there exists finite cover of \( A \) by \( \varepsilon \) balls for all \( \varepsilon > 0 \) .
1.4.5.3. Upper and Lower Bound
- \( u \) is an upper (or lower) bound of a set \( A \) , if \( \forall a\in A, u\ge a\) (or \( u \le a \)).
1.4.5.4. Supremum and Infimum
- \(\sup A\), \(\inf A\)
- Supremum of a partially ordered set \(A\) is the smallest upper bound \(s\) which is not neccessarily in \(A\) and \(\forall a\in A, s\ge a\).
- Infimum is the largest lower bound.
1.4.5.5. Essential Supremum and Essential Infimum
- The supremum and infimum for \(\mu\)-almost all \(x\) in \(X\).
- The set essential upper bound \(U^{\rm ess}_f\) of \(f\) is: \[ U^{\rm ess}_f = \{a\in\mathbb{R}\colon \mu(f^{-1}[(a, \infty)]) = 0\}. \]
- The essential supremum is: \[ \operatorname{ess\,sup}f = \inf U^{\rm ess}_f. \]
1.4.6. Degree of Freedom
1.4.6.1. Change of Degree of Freedom
1.4.6.1.1. Loosening
- \(x = u + v\)
- Useful when faced with powers of \(x\).
- ((662fa8b9-659c-4406-8b8f-d412c8cc9d76)) is obtained by this substitution.
- \(a_n = b_n + c_n\)
- Generally, \(x = f(u, v).\)
- This can be done by introducing two variables for one.
- Now one is free to choose one additional constraint that hopefully simplifies the problem.
- ((66387e3d-af83-464c-ab9c-7092bae6adcf)) is another form of this, in which one of the variable is already present.
1.4.6.1.2. Tightening
- \(x+y = u\)
1.4.7. Degenerate
- The condition that gives rise to a qualitatively different object from the rest, the degenerate case.
1.4.7.1. Examples
- Three collinear points.
- A point is a degenerate circle.
1.4.8. Triangle Inequality
In a normed space, \[ \Vert\mathbf{a}+\mathbf{b}\Vert \leq \Vert \mathbf{a}\Vert +\Vert\mathbf{b}\Vert. \] It can be proved with the law of cosine within the Euclidean space
1.5. Actions
1.5.1. Inspection
Analyze the form of the problem and guess the solution.
- Noticing the pattern.
- Making an educated guess.
2. Notations
2.1. Quantifiers
- \(\forall x\in X(Px)\)
- \(\neg(\forall x\in X (Px)) \equiv \exists x\in X(\neg Px)\)
2.2. Indices
2.2.1. Component Equation
- This name I came up with.
- An equation in terms of the components that represents a set of equations one for each index.
2.2.2. Multi-Index Notation
2.2.2.1. Definition
- An \(n\)-dimensional multi-index is an \(n\)-tuple of indices.
2.2.2.2. Properties
2.2.2.2.1. Absolute Value
- \(|\alpha| = \sum_i \alpha_i.\)
2.2.2.3. Notations
2.2.2.3.1. Factorial
- \[ \alpha ! = \prod_i \alpha_i !. \]
2.2.2.3.2. Partial Derivative
- \[ \partial^\alpha = \prod_i\partial_i^{\alpha_i} \]
2.2.3. Abstract Index Notation
- Naming slots with indices
2.2.4. Einstein Notation
- Einstein Summation Convention, Einstein Summation Notation
- The implicit summation when indices gets paired.
- Covariant indices are lower and contravariant indices are upper. (sometimes ignored)
- The horizontal position of the index can be used to represent the order in which the tensor takes arguments.
2.3. Falling and Rising Factorial
- Factorial Powers
2.3.1. Falling Factorial
- Descending Factorial, Falling Sequential Product, Lower Factorial
2.3.1.1. Definition
- A falling factorial, sometimes called falling power, is defined as \[ x^{\underline{n}}=\prod_{k=0}^{n-1} (x-k) \]
- It is often wrote \((x)_{n}\), but I much prefer to write \(x^{\underline{n}}\).
2.3.2. Rising Factorial
- Pochhammer Function, Pochhammer Polynomial, Ascending Factorial, Rising Sequential Product, Upper Factorial
2.3.2.1. Definition
- \[ x^{\overline{n}} = \prod_{k=0}^{n-1}(x+k). \]
- Also written as \(x^{(n)}\).
2.4. Calculus
2.4.1. Derivative
2.4.1.1. Derivative
2.4.1.1.1. Newton's Notation
- Dot Notation
- \(\dot{y}\)
2.4.1.1.2. Lagrange's Notation
- \(y'\), \(f'(x)\)
2.4.1.1.3. Leibniz's Notation
- \[ \frac{d}{dx}f \]
- \[ \frac{\partial f}{\partial x} \]
2.4.1.1.4. Euler's Notation
- D-Notation
- \(Df\)
- \(\partial_x f\)
2.4.2. Fixing and Varying
These are my notations
- It does seem a little too unwieldy but, what do I know? it is a complicated operation in the first place.
- \[
D\bigg|_y
\]
- Fix \(y\) while taking derivatives.
- \[ \frac{\partial}{\partial x}\bigg|_\text{rot}\mathbf{r} \]
- hold the rotating frame of reference. take it to be invariant.
- \[ \frac{\partial}{\partial P}\!\!\!\!\!\!\mathop{\bigg|}\limits_{n, V, T} \]
- \[
D\bigg|^y
\]
- Vary only \(y\), that is, take derivative with respect to \(y\)
- This is to alleviate the conflicting notations \(D_x\) (with respect to \( x \)) and \(D_\mathbf{x}\) (in the direction \( \mathbf{x} \))
2.4.3. Laplacian
- \(\nabla^2\) is mathematically not convincing, \(\Delta\) gets confused with the difference, the spacing of \(|\nabla|^2\) looks horrible.
- Therefore, let's use \(\nabla^{\cdot 2}\).
2.4.4. Volume Form
- \(\mathrm{d}^{\wedge n}\mathbf{r}\). Imaging taking the parameters of \(\mathbf{r}\) and making a corresponding volume form out of it.
- This makes the dimension and the variable that the one is integrating with respect to clear.
2.5. Penrose Graphical Notation
2.6. Symbols
- \(\circ^*\)
- Dual in some sense.
- \(\circ^\top\), \(\circ^\mathsf{T}\)
- Transpose
2.7. Miscellaneous
2.7.1. Suppression
- The arguments of a function or the additional structures of an object can be omitted when it's clear—suppressed.
- e.g. \(f(x, y) \rightsquigarrow f\) and \((M, d) \rightsquigarrow M\)
- big list - Suggestions for good notation - MathOverflow
- \(\looparrowright\)
\looparrowright
: Immersion of smooth manifolds - \(\hookrightarrow\)
\hookrightarrow
: Is used for embeddings and inclusions. - \(G \curvearrowright X\)
\curvearrowright
: Group action of \(G\) on \(X\) - \(2^X\) : The power set of \(X\).
- Also for the homset \(\mathrm{hom}(A, B)\): \(B^A\), and set of functors from \(\mathcal{C}\) to \(\mathcal{D}\): \(\mathcal{D}^\mathcal{C}\)
- This is reasonable since:
- \[ (A^B)^C = A^{B\times C} \]
- \[ A^B \times A^C = A^{B\sqcup C} \]
- \(\displaystyle \binom{X}{k}\): Set of \(k\)-subsets of \(X\)
- Notice \[ 2^X = \bigcup_{k=0}^{|X|} \binom{X}{k} \]
- Which is analogous to binomial coefficient
2.8. ISO/IEC 80000
The international standard for various notations used in mathematics, physics.
3. Translations
3.1. Korean
Korean | English |
---|---|
윗, 아래 첨자 | Upper, Lower Index |
상, 하계 | Upper, Lower Bound |
상, 하한 | Supremum, Infimum |
위로, 아래로 유계 | Bounded from Above, Below |
옹골참 | compact |
3.2. Japanese
Japanese | English |
---|---|
添字(そえじ) | index |
函数(かんすう) | function |
変数(へんすう) | variable |
4. Special Objects
4.1. Dirichlet Function
The indicator function of the set of rational numbers. \[ \mathbf{1}_{\mathbb{Q}}(x) = \begin{cases} 1 & x\in \mathbb{Q}, \\ 0 & x\not\in \mathbb{Q}. \end{cases} \]
5. Reference
- Degeneracy (mathematics) - Wikipedia
- Glossary of mathematical symbols - Wikipedia
- Set function - Wikipedia
- Generating function - Wikipedia
- Function space - Wikipedia
- Infimum and supremum - Wikipedia
- Essential infimum and essential supremum - Wikipedia
- Degrees of freedom - Wikipedia
- Degrees of freedom (mechanics) - Wikipedia
- Index notation - Wikipedia
- Multi-index notation - Wikipedia
- Abstract index notation - Wikipedia
- Einstein notation - Wikipedia
- Notation for differentiation - Wikipedia
- Falling and rising factorials - Wikipedia