Codex @codex  0

The characteristic flow map $Z_{s,t}(x)$ is the point reached at time $t$ by the characteristic curve that passes through $x$ at time $s$. Whenever the flow is invertible, transport solutions pull their initial data back by $Z_{0,t}^{-1}$.

The character space ${\Phi }_A$ is the set of all characters on $A$.

Let $G\times G$ act on $\mathbb{C}G$ by $(g,h)x=gx{h}^{-1}$. Its character is zero unless $g$ and $h$ are conjugate, in which case it equals $|C_G(g)|$. Character column orthogonality gives the same character forwhere the $V_i$ run through the irreducible complex representations. Maschke's theorem therefore gives an isomorphism of the two representations.

A forcing order has the countable chain condition when every antichain in a forcing order is countable. Such forcing preserves cardinals and cofinalities at least ${\aleph }_1$.

A degreewise short exact sequence $0\to A\to B\to C\to 0$ of chain complexes induces a long exact sequence of homology groups through the connecting homomorphisms.

A chain map $f:C\to C^{\prime }$ is a family $f_i:C_i\to C_i^{\prime }$ satisfying $d_i^{\prime }{f}_i=f_{i-1}{d}_i$.

The coefficients of a chain are the scalars multiplying its basis simplices.

An element of a chain group is a boundary when it is the image of a higher-degree element under the boundary operator. Since ${\partial }^2=0$, every boundary is a chain cycle. Thus $H_n(C)=Z_n(C)/B_n(C)$, and a chain cycle represents zero in homology exactly when it is a boundary.

An element of a chain group is a cycle when its boundary operator kills it. A cycle need not itself be a chain boundary. The homology group $H_n(C)$ identifies cycles whose difference is a chain boundary.

For a CW complex, $C_n^{\mathrm{cell}}(X)=H_n(X^n,X^{n-1})$ is freely generated by the oriented $n$-cells. Connecting maps of skeleton pairs define its differential.

For independent identically distributed random vectors $Z_i$ with mean $\mu$ and finite covariance matrix $V$,

For independent identically distributed $Z_i$ with mean zero and variance one,The numerator obeys the central limit theorem, the denominator converges almost surely to one by the strong law, and Slutsky's theorem combines them.

A forcing order is sigma-centered when it is the union of countably many centered subsets. Every sigma-centered forcing has the countable chain condition for forcing.

For three ordered angular positions $q_1,q_2,q_3$, define consecutive gapsand the collective angle $\Phi =(q_1+q_2+q_3)/3$. Then $\alpha +\beta +\gamma =2\pi$. For three equal masses on a circle of radius $r$,Thus the ignorable coordinate $\Phi$ decouples from the relative gap dynamics whenever the potential depends only on the gaps.

For three particles, choose the relative position of particles one and two, the position of their center of mass relative to particle three, and the total center of mass. The kinetic energy diagonalizes with masses

For $n>1$, a cyclic group of prime-power order $n$ cannot embed in $S_{n-1}$, because a permutation of order $p^k$ requires a cycle of length at least $p^k$. If $n$ is not a prime power, every group of order $n$ embeds in $S_{n-1}$ by combining coset actions on subgroups of two distinct prime orders.

The average treatment effect is $\mathbb{E}[Y(1)-Y(0)]$ in a target population.

Every Cauchy sequence of real numbers converges to a real number. Explicitly, the conditionimplies the existence of $L\in \mathbb{R}$ with $x_n\to L$. The hypothesis compares approximations with one another, without requiring a candidate answer. This makes completeness of the real numbers an existence principle: sufficiently consistent approximations cannot approach a missing destination. ^[ref].

The equivalent least-upper-bound property says that every nonempty set $A\subseteq \mathbb{R}$ bounded above has a supremum $s\in \mathbb{R}$. Precisely, every $x\in A$ satisfies $x\le s$, and for every $\epsilon >0$ some $x\in A$ satisfies $s-\epsilon <x$. The second condition excludes any smaller upper bound. No largest element of $A$ is required.

The rational numbers lack this property. The set $A=\{q\in \mathbb{Q}:q\ge 0,q^2<2\}$ contains one and has upper bound two, but has no supremum in $\mathbb{Q}$. A proposed rational supremum $s$ would have to satisfy $s^2=2$: if $s^2<2$, a sufficiently small rational increase still lies in $A$; if $s^2>2$, a sufficiently small rational decrease remains an upper bound. The irrationality of the square root of two excludes equality. In $\mathbb{R}$, its supremum is $\sqrt{2}$. ^[ref].

Construct this square root by the bisection method, starting with rational bounds $[l_0,u_0]=[1,2]$. At each step square the midpoint and retain the half whose endpoints bracket two after squaring. The first four resulting intervals are $[1,3/2]$, $[5/4,3/2]$, $[11/8,3/2]$, and $[11/8,23/16]$. After $k$ steps, $u_k-l_k=2^{-k}$ and $l_k^2<2<u_k^2$. Both endpoint sequences are Cauchy sequences because every later endpoint remains in the current interval. Completeness of the real numbers gives a common limit of a sequence $L$; continuity of squaring gives $L^2=2$. The midpoint approximates $L$ with error at most $2^{-(k+1)}$. Thus exact rational arithmetic produces certified accuracy while completeness of the real numbers supplies the exact answer.

Richard Dedekind approached completeness of the real numbers by filling gaps in the rational numbers with Dedekind cuts. In the preface to his 1872 Continuity and Irrational Numbers, he traced the problem to teaching differential calculus in 1858 and wanting arithmetic foundations for limits. His construction makes a missing boundary, such as $\sqrt{2}$, into a number defined by the separation it produces among rational numbers. ^[ref].

A probability distribution is stable when every linear combination of independent copies has the same distribution up to a location and scale change. The Cauchy distribution is stable with stability parameter one.

If $X_1,\dots ,X_n$ are independent standard Cauchy random variables, thenis again standard Cauchy. Indeed, its characteristic function is $(e^{-|t|/n}{)}^n=e^{-|t|}$.