User:Prime.mover/Constructs

Useful Links to pages that use the Transclusion Extension

 * Definition:Many-to-One Relation
 * Definition:Many-to-One Relation/Defined


 * ... and some proof structures

Useful constructs
Useful constructs for anyone to cut and paste:

Structure of simple conditional within template:

Blackboard characters: $\N \Z \Q \R \C \P \S$

$fred := bert$

multiplying top and bottom by

subsuming $...$ into arbitrary constant

For how to use substack:


 * $\displaystyle \sum_{\Phi \left({j}\right)} a_j = \left({\lim_{n \to \infty} \sum_{\substack {\Phi \left({j}\right) \\ -n \mathop \le j \mathop < 0} } a_j}\right) + \left({\lim_{n \to \infty} \sum_{\substack {\Phi \left({j}\right) \\ 0 \mathop \le j \mathop \le n} } a_j}\right)$

Let $P = \left\langle{a_j}\right\rangle_{0 \mathop \le j \mathop \le n}$ be a geometric progression of integers.

Let $M_1 = \left({A_1, d_1}\right), M_2 = \left({A_2, d_2}\right), \ldots, M_n = \left({A_n, d_n}\right)$ be metric spaces.

Let $\displaystyle \mathcal A = \prod_{i \mathop = 1}^n A_i$ be the cartesian product of $A_1, A_2, \ldots, A_n$.

Let $d_\infty: \mathcal A \times \mathcal A \to \R$ be the Chebyshev distance on $\mathcal A$:
 * $\displaystyle d_\infty \left({x, y}\right) = \max_{i \mathop = 1}^n \left\{ {d_i \left({x_i, y_i}\right)}\right\}$

where $x = \left({x_1, x_2, \ldots, x_n}\right), y = \left({y_1, y_2, \ldots, y_n}\right) \in \mathcal A$.

Let $A$ be an algebra over the field $\R$ whose bilinear map $m: A^2 \to A$ is called multiplication.

Let the unity of $A$ be $1$ such that $\forall a \in A: m \left({1, a}\right) = a = m \left({a, 1}\right)$.

We can abbreviate $m \left({a, b}\right)$ as $a b$.

Let $\left({F, +, \circ}\right)$ be a field whose zero is $0_F$ and whose unity is $1_F$.

Let $X$ be transcendental over $F$.

Let $F \left[{X}\right]$ be the ring of polynomials in $X$ over $F$.

Let $\left({R, +, \circ}\right)$ be a commutative ring with unity.

Let $\left({D, +, \circ}\right)$ be an integral subdomain of $R$.

For arbitrary $x \in R$, let $D \left[{x}\right]$ be the ring of polynomials in $x$ over $D$.

Let $\left({R, +, \circ}\right)$ be a ring.

Let $\left({S, +, \circ}\right)$ be a subring of $R$.

For arbitrary $x \in R$, let $S \left[{x}\right]$ be the set $S \left[{x}\right]$ be the set of polynomials in $x$ over $S$.

Let $\left({\Omega, \Sigma, \Pr}\right)$ be a probability space.

Let $X$ be a discrete random variable on $\left({\Omega, \Sigma, \Pr}\right)$.

Let $\left \lfloor{x}\right \rfloor$ be the floor of $x$.

Let $\left \lceil{x}\right \rceil$ be the ceiling of $x$.

Let $T = \left({S, \tau}\right)$ be a topological space.

Let $M = \left({A, d}\right)$ be a metric space.

Let $a \in A$.

Let $B_\epsilon \left({a; d}\right)$ be an open $\epsilon$-ball of $a$ in $M$.

Let $\xi \in \R$ be a real number.

Let $\displaystyle \sum_{n \mathop = 0}^\infty a_n \left({x - \xi}\right)^n$ be a power series about $\xi$.

Let $f$ be a real function which is continuous on the closed interval $\left[{a \,.\,.\, b}\right]$ and differentiable on the open interval $\left({a \,.\,.\, b}\right)$.

Let $f$ have a primitive $F$ on $\left[{a \,.\,.\, b}\right]$.

Let $\displaystyle \sum_{n \mathop = 1}^\infty a_n$ be a convergent series in $\R$.

Let $\left \langle {s_n} \right \rangle$ be the sequence of partial sums of $\displaystyle \sum_{n \mathop = 1}^\infty a_n$.

Let $\left \langle {x_n} \right \rangle$ be a sequence in $\R$.

Let $\left \langle {x_n} \right \rangle$ be a Cauchy sequence.

Let $\displaystyle \lim_{n \to \infty} x_n = l$.

Let $x_n \to l$ as $n \to \infty$.

Let $\left \langle {x_{n_r}} \right \rangle$ be a subsequence of $\left \langle {x_n} \right \rangle$.

Let $\mathbf A = \left[{a}\right]_{m n}$ be an $m \times n$ matrix.

Let $\mathbf A = \left[{a}\right]_n$ be a square matrix of order $n$.

Let $\det \left({\mathbf A}\right)$ be the determinant of $\mathbf A$.

Let $\mathcal M_S \left({m, n}\right)$ be the $m \times n$ matrix space over $S$.

Let $\left\{{x, y, z}\right\}$ be a set.

Let $\mathcal P \left({S}\right)$ be the power set of the set $S$.

Let $\left({S, \circ}\right)$ be an algebraic structure or a semigroup.

Let $\left({G, \circ}\right)$ be a group whose identity is $e$.

Let $\left({S, \circ, *}\right)$ be a Huntington algebra whose identity for $\circ$ is $e^\circ$ and whose identity for $*$ is $e^*$.

Let $\left({R, +, \circ}\right)$ be a ring whose zero is $0_R$.

Let $\left({R, +, \circ}\right)$ be a ring with unity whose zero is $0_R$ and whose unity is $1_R$.

Let $\left({K, +, \circ}\right)$ be a division ring whose zero is $0_K$ and whose unity is $1_K$.

Let $\left \langle {S} \right \rangle$ be the group generated by $S$.

Let $\left \langle {g} \right \rangle = \left({G, \circ}\right)$ be a cyclic group.

Let $\left({G, +_G, \circ}\right)_R$ be an $R$-module.

Let $\left({G, +_G, \circ}\right)_K$ be a $K$-vector space.

Let $\left({G, +_G, \circ}\right)_R$ be a unitary $R$-module whose dimension is finite.

Let $\mathcal L_R \left({G, H}\right)$ be the set of all linear transformations from $G$ to $H$.

Let $\mathcal L_R \left({G}\right)$ be the set of all linear operators on $G$.

Let $\left[{u; \left \langle {b_m} \right \rangle, \left \langle {a_n} \right \rangle}\right]$ be the matrix of $u$ relative to $\left \langle {a_n} \right \rangle$ and $\left \langle {b_m} \right \rangle$.

Let $D \left[{X}\right]$ be the ring of polynomial forms in $X$ over $D$.

Let $P \left({D}\right)$ be the ring of polynomial functions over $D$.

Let $G^*$ be the algebraic dual of $G$.

Let $G^{**}$ be the algebraic dual of $G^*$.

Let $M^\circ$ be the annihilator of $M$.

Let $\left \langle {x, t'} \right \rangle$ be as defined in Definition:Evaluation Linear Transformation.

Let $J$ be an ideal of $R$.

Let $\left({R / J, +, \circ}\right)$ be the quotient ring defined by $J$.

Let $\left({D, +, \circ}\right)$ be an integral domain or a principal ideal domain whose zero is $0_D$ and whose unity is $1_D$.

Let $\left({F, +, \circ}\right)$ be a field whose zero is $0_F$ and whose unity is $1_F$.

Let $\left({K, +, \circ}\right)$ be a quotient field of an integral domain $\left({D, +, \circ}\right)$.

Let $\left({D, +, \circ, \le}\right)$ be a totally ordered integral domain whose zero is $0_D$ and whose unity is $1_D$.

Let $\left({S, \preceq}\right)$ be a totally ordered set.

Let $\left({S, \circ, \preceq}\right)$ be an ordered structure.

Let $\left({S, \circ, \preceq}\right)$ be a naturally ordered semigroup.

Let $\left({S, \circ, \ast, \preceq}\right)$ be a naturally ordered semigroup with product.

$\left[{m \,.\,.\, n}\right]$ is the closed interval between $m$ and $n$.

$\N$, $\N_{> 0}$, $\N_k$, $\N^*_k$

$\Z$, $\Z_{\ne 0}$, $\Z_{\ge 0}$, $\Z_{> 0}$,

Let $\Z_m$ be the set of integers modulo $m$.

Let $\Z'_m$ be the set of integers coprime to $m$ in $\Z_m$.

Let $\left({\Z, +}\right)$ be the additive group of integers.

Let $\left({\Z, +, \times}\right)$ be the integral domain of integers.

Let $\left({\Z_m, +_m, \times_m}\right)$‎ be the ring of integers modulo $m$.

Let $\left({\Z_m, +_m}\right)$ be the additive group of integers modulo $m$.

Let $n \Z$ be the set of integer multiples of $n$.

Let $\left({x}\right)$ be the principal ideal of $\left({\Z, +, \times}\right)$ generated by $x$.

Let $\operatorname{Char} \left({R}\right)$ be the characteristic of $R$.

The cardinality of a set $S$ is written $\left|{S}\right|$.

Let $\left \langle {s_k} \right \rangle_{k \in A}$ be a sequence in $S$.

Let $\gcd \left\{{a, b}\right\}$ be the greatest common divisor of $a$ and $b$.

Let $\operatorname{lcm} \left\{{a, b}\right\}$ be the lowest common multiple of $a$ and $b$.

Let $\left|{a}\right|$ be the absolute value of $a$.

$a \equiv b \left({\bmod\, m}\right)$: "$a$ is congruent to $b$ modulo $m$."

$a \equiv b \pmod m$ "$a$ is congruent to $b$ modulo $m$."

$\left[\!\left[{a}\right]\!\right]_m$ is the residue class of $a$ (modulo $m$).

Let $\left[{G : H}\right]$ be the index of $H$ in $G$.

Let $C_G \left({H}\right)$ be the centralizer of $H$ in $G$.

Let $N_G \left({S}\right)$ be the normalizer of $S$ in $G$.

Let $G / N$ be the quotient group of $G$ by $N$.

Let $Z \left({G}\right)$ be the center of $G$.

Let $x \in G$.

Let $N_G \left({x}\right)$ be the normalizer of $x$ in $G$.

Let $\left[{G : N_G \left({x}\right)}\right]$ be the index of $N_G \left({x}\right)$ in $G$.

Let $S_n$ denote the set of permutations on $n$ letters.

Let $S_n$ denote the symmetric group on $n$ letters.

Let $\operatorname{Fix} \left({\pi}\right)$ be the set of elements fixed by $\pi$.

Matrix (square brackets): $\begin{bmatrix} x & y \\ z & v \end{bmatrix}$

Matrix (round brackets): $\begin{pmatrix} x & y \\ z & v \end{pmatrix}$

two-row notation: $\begin{bmatrix} 1 & 2 & 3 & 4 \\ 2 & 1 & 4 & 3 \end{bmatrix}$

cycle notation: $\begin{bmatrix} x & y \end{bmatrix}$

Let $\operatorname{Orb} \left({x}\right)$ be the orbit of $x$.

Let $\operatorname{Stab} \left({x}\right)$ be the stabilizer of $x$ by $G$.

Let $\left({S, \ast_1, \ast_2, \ldots, \ast_n, \circ}\right)_R$ be an $R$-algebraic structure.

Logical Axiom references
These are for tableau proofs:


 * Declaration of a Premise: Premise


 * Rule of Assumption: Rule of Assumption


 * Rule of Conjunction: Rule of Conjunction


 * Rule of Simplification: Rule of Simplification: $\land \mathcal E_1$ or Rule of Simplification: $\land \mathcal E_2$


 * Rule of Addition: Rule of Addition: $\lor \mathcal I_1$ or Rule of Addition: $\lor \mathcal I_2$


 * Rule of Or-Elimination: Rule of Or-Elimination: $\lor \mathcal E$


 * Modus Ponendo Ponens: Modus Ponendo Ponens: $\implies \mathcal E$


 * Rule of Implication: Rule of Implication: $\implies \mathcal I$


 * Principle of Non-Contradiction: Principle of Non-Contradiction: $\neg \mathcal E$


 * Rule of Proof by Contradiction: Proof by Contradiction


 * Rule of Bottom-Elimination: Rule of Bottom-Elimination: $\bot \mathcal E$


 * Law of the Excluded Middle: Law of Excluded Middle


 * Double Negation Introduction: $\neg \neg \mathcal I$


 * Double Negation Elimination: $\neg \neg \mathcal E$

URM Programs
...etc.

input

output

register

terminate

basic instruction

instruction pointer

null URM program

exit jump

exit line

stage of computation

state

Let $P$ be a URM program.

Let $P$ be a normalized URM program.

Let $l = \lambda \left({P}\right)$ be the number of basic instructions in $P$.

Let $u = \rho \left({Q}\right)$ be the number of registers used by $Q$.

Trace Table:

...etc.