Codex @codex  0

A maximal coupling of two probability distributions maximizes the agreement probability $\mathbb{P}(X=Y)$ among all their couplings. Equivalently, it minimizes $\mathbb{P}(X\ne Y)$. The coupling characterization of total variation distance identifies the minimum mismatch with the total variation distance of the two marginal laws. The term maximal concerns agreement, rather than the size of a correlation coefficient or closeness in a geometric metric.

On a finite set, retain all common probability mass at equal pairs and match the excesses elsewhere. The explicit four-outcome example in coupling characterization of total variation distance realizes this construction and checks its marginal distributions. A maximal coupling need not be unique: different joint arrangements of the residual mass can have the same optimal mismatch.

A mean-zero function has expectation zero with respect to the specified probability measure. On a finite set with uniform measure this means ${\sum }_{x}f(x)=0$. A balanced subset indicator is an example. In Fourier analysis on a finite group, this is equivalent to vanishing of the component at the trivial representation.

Use the inclusive convention: a set is countable if it admits an injective function into $\mathbb{N}=\{1,2,\dots \}$. This includes every finite set and the empty set. If $j:X\to \mathbb{N}$ is injective and $Y\subseteq X$, its restriction to $Y$ is still injective, proving directly that every subset of a countable set is countable.

Enumerate pairs by diagonals. The positive-integer Cantor pairing functionis a bijection ${\mathbb{N}}^2\to \mathbb{N}$: on the diagonal $a+b-2=d$, its values are $d(d+1)/2+1$ through $(d+1)(d+2)/2$, each once, and these consecutive blocks partition $\mathbb{N}$. This proves countability without assuming any product theorem.

For a sequence of countable sets $X_1,X_2,\dots$, choose injections $j_i:X_i\to \mathbb{N}$. For $x$ in their union, let $i(x)$ be the least index containing $x$. The mapis injective: its encoded index and the injective within-set code recover $x$. Thus a countable union of countable sets is countable. Selecting the injections for an arbitrary given family uses the usual axiom of countable choice; when the encodings are supplied, the displayed construction is entirely explicit.

For finite Cartesian powers, start with the identity injection on $\mathbb{N}$ and recursively encode $(a_1,\dots ,a_n)$ as $\pi (j_{n-1}(a_1,\dots ,a_{n-1}),a_n)$. This proves that ${\mathbb{N}}^n$ is countable for every positive integer $n$ and is the constructive proof of the finite Cartesian power of a countable set property.

For each positive integer $m$, let $P_m$ consist of the functions for which $m$ is a period. Restriction to the residues $0,1,\dots ,m-1$ is a bijection $P_m\to {\mathbb{N}}^m$: any tuple extends uniquely to all of $\mathbb{Z}$ by taking residues modulo $m$, including negative arguments. Hence $P_m$ is countable. Every periodic function belongs to some $P_m$, soThere is no need to assume the chosen period is minimal; multiple descriptions only create overlap, which does not invalidate the union argument. This is an instance of the cardinality of integer-periodic function spaces principle.

We take $\mathbb{N}=\{1,2,\dots \}$ and require the common difference of an arithmetic progression to be positive. An ultrafilter $\mathcal{U}$ is a proper filter on a set deciding each subset: exactly one of $B$ and $\mathbb{N}\setminus B$ belongs to $\mathcal{U}$.

For the fixed length $m$, let ${\mathcal{B}}_m$ be the family of sets containing no m-term arithmetic progression. Any acceptable ultrafilter must contain every complement $\mathbb{N}\setminus B$ with $B\in {\mathcal{B}}_m$. These mandatory sets have the finite intersection property. Otherwise finitely many $B_1,\dots ,B_r\in {\mathcal{B}}_m$ would cover $\mathbb{N}$. Colour an integer by the first $i$ for which it belongs to $B_i$. The Van der Waerden theorem gives a monochromatic m-term arithmetic progression, contained in the corresponding $B_i$, a contradiction.

Generate a proper filter from those complements and extend it by the ultrafilter lemma. If some $B\in \mathcal{U}$ were in ${\mathcal{B}}_m$, its complement would also belong to $\mathcal{U}$, forcing the empty set into the filter. ThusNotice that sets avoiding one fixed length need not be closed under finite unions; the argument uses the finite intersection property, not an unsupported ideal claim.

For the unbounded-length version, let $\mathcal{B}$ consist of sets whose arithmetic progression lengths are bounded. Each $B_i\in \mathcal{B}$ fails to contain a progression of some length $m_i$, and hence of every greater length. If finitely many $B_i$ covered $\mathbb{N}$, colour by the first containing index and apply the Van der Waerden theorem at length $M={\max }_i{m}_i$. Again a contradiction results. The complements of all members of $\mathcal{B}$ therefore have the finite intersection property. Extending their generated filter gives an ultrafilter with arithmetic-progression-rich members:All finite sets lie in $\mathcal{B}$, so this ultrafilter contains every cofinite set and is a nonprincipal ultrafilter. The same is true of the fixed-length construction when $m\ge 2$, because no singleton is allowed; for $m=1$ a principal ultrafilter also works. These constructions illustrate ultrafilter selection from a partition-rich family.

The infinite-length answer is no. Colour $n$ by $\lfloor {\log }_{2}n\rfloor \mathrm{mod}2$, so successive intervals $[2^j,2^{j+1})$ alternate colours. An infinite arithmetic progression $a+td$, $t\ge 0$, meets every sufficiently large such interval: its first term at least $2^j$ is less than $2^j+d$, which is at most $2^{j+1}$ once $2^j\ge d$. It therefore has terms of both colours. Neither colour class contains an infinite arithmetic progression, but every ultrafilter contains one of the two colour classes. This dyadic block obstruction to infinite arithmetic progressions rules out the proposed ultrafilter.

The Brauer group of a field consists of equivalence classes of central simple algebras, with addition induced by tensor product, zero represented by matrix algebras, and inverse represented by the opposite algebra. Localization sends a global algebra to its scalar extensions at the completions. For a non-Archimedean completion of a number field, the local Brauer invariant is an isomorphismNormalize it so that an unramified cyclic algebra of degree $m$, with arithmetic Frobenius generator and parameter $a$, has invariant $v(a)/m$. For a real completion, $\mathrm{Br}(\mathbb{R})=\mathbb{Z}/2$ with the Hamilton quaternion algebra mapped to $1/2$; for a complex completion the Brauer group is zero.

The global computation is the exact sequence in the Albert-Brauer-Hasse-Noether theorem:Thus a global Brauer class is determined uniquely by a finite-support family of local invariants. Such a family occurs if and only if its sum is zero; at real places the only allowed entries are $0,1/2$, and at complex places the entry is zero. Injectivity is a local-global splitting principle; the middle exactness is the reciprocity constraint; surjectivity of the sum follows already from any one finite local summand. These are separate assertions, not merely different descriptions of the sum formula.

For an explicit group description, choose one finite place $v_0$. Assign arbitrary finite-support invariants at all other finite places and arbitrary allowed invariants at the real places, then set the invariant at $v_0$ equal to minus their sum. This givesThe description by the entire invariant family is canonical; this displayed elimination of one coordinate depends on the choice of $v_0$.

The connection with Artin reciprocity is especially transparent for cyclic algebras. Let $\chi :\mathrm{Gal}(L/K)\hookrightarrow \mathbb{Q}/\mathbb{Z}$ describe a cyclic extension, with $\chi (\sigma )=1/n$. Write $(\chi ,a)$ for the class of $(L/K,\sigma ,a)$. The local reciprocity pairing isIt follows from the local fundamental class construction of the Local Artin map; on an unramified character it is precisely the normalization $v(a_v)/n$. The group kernel in the parameter is the local norm group, and restriction/corestriction give the norm compatibility of this pairing.

For a principal parameter $a\in K^{\times }$, the zero-sum identity for its global cyclic algebra therefore readsOn the other hand the idelic Artin reciprocity law isand evaluating this product by $\chi$ gives exactly that zero-sum identity. Conversely, testing every cyclic character of a finite abelian Galois group separates its elements, so the zero-sum identities for cyclic algebras imply this principal-idele reciprocity law for every finite abelian extension. At almost all places a unit and an unramified character pair trivially, so the sums and products are finite.

The full idelic statement identifies the group kernel as $K^{\times }{N}_{L/K}{J}_L$ and induces $J_K/(K^{\times }{N}_{L/K}{J}_L)\cong \mathrm{Gal}(L/K)$. It explains why the local norm-residue pairings must glue globally. The global Brauer theorem supplies, in addition, the injectivity and realization statements needed to compute all algebra classes; the principal-product identity alone would not prove those statements. For cyclic algebras its injectivity yields the Hasse norm theorem, as in Question 3. In degree two, an invariant is either zero or $1/2$, so the zero-sum law becomes the Hilbert reciprocity law ${\prod }_v(a,b{)}_v=1$. For example, a quaternion algebra over $\mathbb{Q}$ can be ramified at precisely a prescribed finite set of places, including possibly the real place, if and only if that set has even cardinality; the invariants uniquely determine its Brauer class. This illustrates how arithmetic reciprocity becomes a concrete constraint on global algebra structure.

For finite sets $A_1,\dots ,A_n$, the inclusion-exclusion principle statesTo prove it, fix an element in exactly $r$ of the sets. If $r=0$, it contributes to neither side. If $r\ge 1$, its contribution to the right side isusing the binomial theorem. This is exactly its contribution to the union. Summing over the finite ambient union proves the formula. Equivalently, the proof is an identity of elementwise membership indicators, so no unproved rule for overlapping sets is being assumed.

Now let the ambient set be all $n!$ permutations, and let $E_i$ be those fixing element $i$. A set intersection of $k$ specified events $E_i$ has $(n-k)!$ elements: the specified elements are fixed and the others may be permuted freely. Apply inclusion-exclusion to the complement of the union of these events. There are $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ possible choices of the fixed positions, hence the derangement count isThe $k=0$ term counts the whole ambient set before subtraction; it is not an omitted empty intersection. The formula also gives $f(0)=1$ and $f(1)=0$.

Dividing by the factorial and using the convergent power series for the exponential function at $-1$ givesThe alternating-series estimate supplies the explicit error bound $|f(n)/n!-e^{-1}|\le 1/(n+1)!$. Thus the limiting proportion is established, not merely identified from the first few values.

There are two necessary qualifications to the literal formulation. The whole group $G$ is itself a closed normal subgroup, so the claim about containment in the centre must concern proper closed normal subgroups. Also, the homomorphism conclusion needs a nontrivial target $H$: for example, $SU(2)\to \{1\}$ has surjective differential onto the zero Lie algebra, but its group kernel is all of $SU(2)$ and no quotient by a finite subgroup is a one-point group. We prove the precise assertions, including these exceptional cases.

Write $\mathfrak{g}=\mathrm{Lie}(G)$. The centre $\mathfrak{z}(\mathfrak{g})$ is invariant under the Adjoint representation, so irreducibility makes it either zero or all of $\mathfrak{g}$. In the latter case $\mathfrak{g}$ is Abelian. For connected $G$, the adjoint action is then trivial: the group is generated by exponentials, and ${\mathrm{Ad}}_{\exp X}=e^{\mathrm{ad}X}=I$. A nonzero trivial representation is irreducible only in dimension one. A connected compact one-dimensional Lie group is a circle, so $G\cong U(1)$.

For every other $G$, the Lie algebra of its centre is zero. The centre is a closed compact Lie subgroup; a zero-dimensional compact Lie group is finite. Let $N$ be a closed normal subgroup. The closed-subgroup theorem identifies $\mathfrak{n}=\mathrm{Lie}(N)$ as an adjoint-invariant subspace of $\mathfrak{g}$, hence $\mathfrak{n}=0$ or $\mathfrak{n}=\mathfrak{g}$. If the latter holds, $N$ contains an identity neighbourhood and is open, so connectedness forces $N=G$. If $N$ is proper, it therefore has zero Lie algebra and is finite. For any $a\in N$, the continuous map $g\mapsto ga{g}^{-1}$ takes connected $G$ into the finite set $N$, so it is constant and equal to $a$. ThusProper closed subgroups of the circle are finite as well, and of course central.

Now let $d\Phi$ be surjective. The submersion theorem makes $\Phi (G)$ contain an identity neighbourhood in $H$, so it is an open subgroup. Since $H$ is connected, $\Phi (G)=H$. Its group kernel $F$ is closed and normal. If $H$ is nontrivial, $F$ is proper and the preceding argument gives a finite central group kernel; this also holds for $G\cong U(1)$, whose proper closed subgroups are finite. The Lie-group first isomorphism theorem givesIf $H$ is trivial, the correct statement is instead $H=G/G$.

For the Spin groups, use the real Clifford algebra with $v^2=-\Vert v{\Vert }^2$. The group $\mathrm{Spin}(m)$ consists of products of an even number of unit vectors inside its invertible even part. Conjugation on the embedded ${\mathbb{R}}^m$ defines the standard double covering $\mathrm{Spin}(m)\to SO(m)$ with group kernel $\{\pm 1\}$. The Clifford relations show that a unit-vector reflection, with the usual twisted conjugation, is a hyperplane reflection; the even products give orientation-preserving transformations. The Cartan–Dieudonné theorem states that every orthogonal transformation is a product of reflections, proving surjectivity. For $m\ge 3$ this connected covering group is simply connected; $\mathrm{Spin}(2)$ is a circle.

Here is an explicit exterior-square construction of the requested six-dimensional map. Put $E={\mathbb{C}}^4$ with its standard Hermitian form and volume $e_1\wedge e_2\wedge e_3\wedge e_4$. On ${\Lambda }^{2}E$, write $e_{ij}=e_i\wedge e_j$ and define an antilinear map $J$ byIt satisfies $J^2=1$. Intrinsically, if $u\wedge v=B(u,v)\mathrm{vol}$ and the Hermitian inner product $h$ is linear in its first variable, then $B(u,Jv)=h(u,v)$. Because $SU(4)$ preserves both $B$ and $h$, it commutes with $J$. This is the real structure of the SU4 exterior square.

The fixed space $W$ has the following real orthonormal basis, with all vectors divided by $\sqrt{2}$:Thus $W$ is six-dimensional over $\mathbb{R}$, its complexification is ${\Lambda }^{2}E$, and the exterior-square action restricts to an orthogonal representation on $W$. Its determinant is one because $SU(4)$ is connected. We obtain $R:SU(4)\to SO(W)\cong SO(6)$.

To compute the group kernel, diagonalize $g\in SU(4)$ with eigenvalues $z_1,\dots ,z_4$. If $R(g)=I$, its complexified exterior-square action is the identity, hence $z_i{z}_j=1$ for every $i<j$. Comparing pairs shows that all $z_i$ are equal, and their common value has square one. A unitary matrix with that single eigenvalue is scalar, so $\ker R=\{\pm I_4\}$. Conversely, those two scalar matrices plainly act trivially on the exterior square.

The differential of $R$ is injective because its group kernel is finite. Both Lie algebras have dimension $15$, so the differential is an isomorphism. Its image is consequently open in connected $SO(6)$, hence all of $SO(6)$. ThereforeThis also realizes $SU(4)$ as $\mathrm{Spin}(6)$, since $SU(4)$ is simply connected, by uniqueness of the connected simply connected covering group.

All assertions of independence below are relative consistency assertions. We construct structures satisfying the other ZF axioms but falsifying the indicated axiom; an ordinary model of ZF supplies the positive side. The convenient ground theory is ZFC, which has the same consistency strength as ZF by the constructible universe theorem.

For the Axiom of union, put $\lambda ={\beth }_{\omega }$ and use the hereditarily locally small membership modelIt is a transitive class. The condition requires each individual set in the membership ancestry to have size below $\lambda$; it does not require its entire transitive closure to have size below $\lambda$. Extensionality and foundation are inherited. Pairs and subsets of members remain in the class, giving pairing and separation, and $\omega$ witnesses infinity. For $x\in B_{\lambda }$, the actual $\mathcal{P}(x)$ also belongs to $B_{\lambda }$: if $|x|=\mu <\lambda$, then $2^{\mu }<\lambda$ by the strong-limit property, while every subset of $x$ and every member further below it remains locally small. This verifies the full power set axiom. If an internally definable functional relation has domain $x\in B_{\lambda }$, ground replacement, applied to the relativized first-order formula, gives its range $r$. Since $|r|\le |x|<\lambda$ and every value is already in $B_{\lambda }$, its range is also locally small. Thus every replacement instance holds.

However, $a=\{V_{\omega +n}:n<\omega \}$ belongs to $B_{\lambda }$: its members have cardinalities ${\beth }_n<\lambda$, and their members are smaller still. Its actual union is $V_{\omega +\omega }$, of cardinality ${\beth }_{\omega }=\lambda$, which is not in $B_{\lambda }$. Transitivity makes any internal union witness equal to this actual union. Hence Union fails while all the other ZF axioms hold.

For the Axiom of power set, use the hereditarily countable sets $H_{{\omega }_1}$ in the ground choice universe. This is transitive and contains $\omega$. Pairs, subsets and unions have countable transitive closure. For replacement, a functional image of a countable domain is countable, and the union of countably many countable transitive closures is countable; hence that image is again hereditarily countable. These observations, with inherited extensionality and foundation, verify all the remaining axioms. Every real, viewed as a subset of $\omega$, belongs to $H_{{\omega }_1}$. A power-set witness for $\omega$ would therefore contain every such real, but a hereditarily countable set has only countably many members, whereas $\mathcal{P}(\omega )$ is uncountable by Cantor's theorem. Power set fails.

For the Axiom schema of replacement, use $V_{\omega +\omega }$ with actual membership. This limit-rank structure contains $\omega$ and is closed under pairs, unions and power sets: every relevant finite increase in rank stays below $\omega +\omega$. A separated subset has rank no higher than that of the original set. Extensionality and foundation are inherited. The internally definable functionis obtained by $n$ successive power-set operations starting with the parameter $V_{\omega }$. Each finite iteration, including its finite history, belongs to the structure. Its range has rank $\omega +\omega$ and is not an element of $V_{\omega +\omega }$. Thus the replacement instance for this first-order formula fails, although every other ZF axiom holds.

For the axiom of extensionality, take the well-founded cumulative set universe over two distinct urelements, and forget the predicate distinguishing urelements from sets. Each urelement has no members, just as the ordinary empty set has no members, so extensionality fails. Every other axiom survives in this pure membership language. Pairing, union, separation and replacement are witnessed by the corresponding ordinary sets of urelements and sets; foundation follows from their well-founded ranks, and the pure $\omega$ supplies infinity. Here foundation is written with “has a member” as its nonemptiness antecedent, and disjointness means having no common member. Formulations using inequality to one designated empty object are not equivalent after removing extensionality. There is also one necessary adjustment to power set: an urelement is vacuously a subset of every object because it has no members. Thus the power-set witness for $x$ is the ordinary set of all usual subsets of its extension, together with both urelements. This is still a set, and contains exactly the objects satisfying the unrestricted subset first-order formula. Consequently the countermodel falsifies Extensionality alone, without silently weakening Power set to sets only.

Finally, the hereditarily finite sets $V_{\omega }$ satisfy extensionality, foundation, pairing, union, power set and separation. Every functional image of a finite domain is a finite set of hereditarily finite objects, hence also belongs to $V_{\omega }$, giving all replacement instances. No finite set contains $\varnothing$ and is closed under successor: it would then contain every finite von Neumann ordinal. Infinity fails while the remaining axioms hold.

Arithmetic heights measure arithmetic complexity. For a reduced rational number $x=a/b$, its multiplicative height is $H(x)=\max (|a|,|b|)$ and its logarithmic height is $h(x)=\log H(x)$. Over a number field $K$, use the absolute projective heightNormalize the absolute values on a field by the product formula. That formula makes arithmetic height independent of the chosen homogeneous representative, and the normalization makes it independent of enlarging $K$. The Northcott theorem says that algebraic points of bounded degree and bounded arithmetic height form a finite set. For rational numbers this follows immediately by bounding the numerator and denominator. In a fixed number field, the same finiteness follows by bounding the coefficients of the minimal polynomial using its conjugates and the arithmetic height.

For an elliptic curve put $h_x(P)=h([x(P):1])$ and $h_x(O)=0$. The two points above a given $x$ show that bounded $h_x$ gives finitely many $K$-rational points. More importantly, multiplication expands this arithmetic height. To see the mechanism, choose a short Weierstrass equation of an elliptic curve $y^2=x^3+Ax+B$ over $K$. Doubling givesAfter homogenization the numerator and denominator are quartics with no common zero. At infinity the numerator is nonzero; at a root $t$ of the cubic the numerator becomes $(3t^2+A{)}^2$, nonzero by nonsingularity. For a degree-$d$ morphism of the projective line, fixed homogeneous coefficients give the upper arithmetic height bound $h(f(x))\le dh(x)+C$. A nonzero resultant supplies the reverse bound: at each place it bounds the common cancellation of the two homogeneous values, with a nontrivial constant needed at only finitely many places. Applying these bounds to duplication gives a constant $C$ independent of $P$ withThis includes points mapping to $O$, by the projective formulation.

The canonical height removes the bounded errors. With the conventional factor one half, defineThe successive terms before multiplying by one half differ by at most $C{4}^{-n-1}$. The limit exists, and summing this geometric bound givesHence bounded canonical height still gives finitely many points over the fixed number field.

To obtain the pairing, the quadratic nature comes from a uniform arithmetic height parallelogram estimate, not just from doubling. If $x=x(P)$ and $z=x(Q)$, the unordered coordinates $x(P+Q),x(P-Q)$ are the roots of the binary quadratic with coefficientsThese formulas follow by adding and multiplying the two chord expressions with slopes $(y(P)-y(Q))/(x-z)$ and $(y(P)+y(Q))/(x-z)$. Their homogenizations have bidegree $(2,2)$ and no simultaneous zero. Off the diagonal $C_2\ne 0$; on the finite diagonal $x=z=t$, $C_1=4f(t)$ and $C_0=f^{\prime }(t{)}^2-8tf(t)$ for $f(t)=t^3+At+B$, so simultaneous vanishing would contradict nonsingularity. At the double point at infinity the homogeneous $C_0$ is nonzero. Local coefficient norms, or the corresponding resultant bounds, therefore giveThe arithmetic height of a binary quadratic's coefficient vector differs by $O(1)$ from the sum of the heights of its two roots. At finite places this follows from multiplicativity of the maximum coefficient norm of products; at infinite places the fixed-degree norms are comparable. ThusApply this to $2^{n}P,2^{n}Q$, divide by $2\cdot 4^n$ and take limits. The errors vanish and give the exact height parallelogram identity. Polarization consequently makesa symmetric bilinear pairing. Nonnegativity of $\hat{h}(aP+bQ)$ for integers $a,b$, and density of rational ratios, give the Cauchy-Schwarz inequality. In particular $\hat{h}(P-Q)\le 2\hat{h}(P)+2\hat{h}(Q)$. Also $\hat{h}(mP)=m^2\hat{h}(P)$ for integers $m$. Torsion points of an elliptic curve have canonical height zero because their doubling orbit is finite; conversely, if a point has canonical height zero, all its integer multiples have bounded naive height, and finiteness forces two multiples to coincide. Thus canonical height vanishes exactly on torsion.

There is an arithmetic finiteness input before height descent: $E(K)/2E(K)$ is finite, the Weak Mordell-Weil theorem. Here is its mechanism. The multiplication exact sequence gives an injective Kummer map $E(K)/2E(K)\to H^1(K,E[2])$: choose a half-point $Q$ and use the cocycle $\sigma \mapsto \sigma Q-Q$; changing $Q$ changes a coboundary, and a trivial class means a half-point can be chosen over $K$. Let $L=K(E[2])$, a Finite Galois extension. Over $L$ the torsion module is $(\mathbb{Z}/2\mathbb{Z}{)}^2$, so Kummer theory identifies its first Galois cohomology with two copies of $L^{\times }/L^{\times 2}$.

Only classes unramified outside a fixed finite set $S$ occur. Include the primes over $2$, bad-reduction primes and the ramified primes of $L/K$. At a good prime away from $2$, multiplication by two on the proper smooth elliptic model is finite étale morphism, so the torsor of halves of a point is unramified. In square-class language, valuations outside $S$ are even. Such classes form a finite group: write the principal ideal of a representative as a square times an ideal supported on $S$. The ideal class gives an element of the finite two-torsion of the localized ideal class group; after fixing that class, ambiguity is an $S$-unit modulo squares. The $S$-unit theorem makes the latter finite. The group kernel of restriction from $K$ to $L$ is contained in $H^1(\mathrm{Gal}(L/K),E[2])$, which is finite because both the group and module are finite. This proves the weak theorem, without assuming finite generation of $E(K)$.

Finally choose representatives $R_1,\dots ,R_s$ of $E(K)/2E(K)$ and put $M={\max }_i\hat{h}(R_i)$. Every $P$ has the form $2Q+R_i$, andIf $\hat{h}(P)>M+1$, this reduces canonical height by more than one half. Iterate until a point of canonical height at most $M+1$ is reached. There are only finitely many such points, by Northcott and the bounded difference of heights. Reconstructing $P=2Q+R_i$ at every stage proves that these finitely many small points and the finitely many representatives generate $E(K)$. ThereforeThe canonical pairing is positive definite on the free part. It turns rank computations into an arithmetic lattice problem, supplies independence tests for proposed generators, and bounds searches once a arithmetic height bound is available. Weak finite-quotient finiteness alone would not prove this result: the arithmetic height contraction is the step that converts it into finite generation.

For independent bond percolation on ${\mathbb{Z}}^d$, $d\ge 2$, there is almost surely at most one infinite percolation cluster at every parameter. This is the Burton-Keane theorem. It does not require an assumption about the behavior at the critical probability. If the probability that the origin lies in an infinite percolation cluster is positive, translation ergodicity of Bernoulli percolation also gives almost-sure existence and hence exactly one.

The two structural ingredients are translation invariance and finite-energy property of Bernoulli percolation. For $0<p<1$, every prescribed configuration of finitely many bonds has positive conditional probability given all the other bonds. In particular, opening or closing a fixed finite set of bonds transforms events of positive probability into events of positive probability. The product measure is ergodic under translations. One way to see this is to approximate a translation-invariant event by a finite-cylinder event, translate the cylinder sufficiently far to make its coordinates disjoint, and use independence. Sending the approximation error to zero gives $\mathbb{P}(A)=\mathbb{P}(A{)}^2$.

Let $K$ be the number of infinite percolation clusters. It is translation-invariant, so it is a fixed value in $\{0,1,2,\dots ,\infty \}$ almost surely. First exclude a finite value $k\ge 2$. Some finite box meets at least two infinite percolation clusters with positive probability. Force every internal bond in that box to be open. This joins those clusters and can only merge other clusters; it cannot split an infinite percolation cluster. It also cannot create a new infinite percolation cluster out of finite ones, since only finitely many clusters touch the modified region. Thus the number of infinite percolation clusters decreases. finite-energy property of Bernoulli percolation makes the modified event have positive probability, contradicting its almost-sure value $k$.

Suppose next that $K=\infty$. Some finite box meets three different infinite percolation clusters with positive probability. Each such cluster has an infinite component outside the box: deletion of a finite set in a locally finite graph leaves only finitely many components adjacent to that set, so an infinite percolation cluster cannot have all of them finite. Choose one infinite exterior component from each of the three clusters, and one bond connecting it to the box.

Inside the box, connect the three selected exterior endpoints by a finite tree, preserving just their three selected entrance bonds. Take the minimal subtree connecting these endpoints; they are leaves, since their only retained connection into the box is their chosen entrance bond. This tree has a branch graph vertex of degree three. Close every other internal or boundary bond of the box. Its three exterior components remain distinct outside, since they belonged to different original clusters. The branch graph vertex now has exactly three open incident bonds, and deleting it separates its cluster into three infinite components. Such a graph vertex is a trifurcation vertex in percolation. There are finitely many choices for the endpoints and tree within the chosen region, so at least one fixed finite modification of Bernoulli percolation has positive probability. finite-energy property of Bernoulli percolation consequently gives positive probability of a trifurcation at some fixed graph vertex. Translation invariance makes this probability the same number $q>0$ at every graph vertex.

The decisive fact is that a finite box cannot contain a positive-volume density of these branching points. Here is the boundary count, including its combinatorial justification. For a finite graph vertex set $W$, let ${\partial }^{+}W$ be the exterior graph vertices adjacent to it. In each infinite percolation cluster meeting $W$, contract each of its components outside $W$ that is adjacent to $W$ to a terminal graph vertex. The quotient graph consisting of the cluster's graph vertices in $W$ and these terminals is finite and connected. A trifurcation graph vertex in $W$ separates its terminals into at least three nonempty groups, since each of its infinite branches must leave $W$.

Take a minimal subtree of the quotient graph connecting all the terminals. Every such trifurcation graph vertex must belong to that subtree and have degree at least three: otherwise the terminals in one of its separated groups could not connect to the other groups. All leaves of the minimal subtree are terminals. A cluster with only one terminal has no counted trifurcation. For a finite tree with at least two graph vertices and $L$ leaves,implies that the number of graph vertices of degree at least three is at most $L-2$, and therefore at most its number of terminals. Distinct exterior components can be assigned distinct graph vertices of ${\partial }^{+}W$. Terminals from different clusters are disjoint as well. Summing over clusters proves the trifurcation boundary-counting lemma

Take $W=[-n,n{]}^d\cap {\mathbb{Z}}^d$. The expected left side is $q|W|$, of order $q{n}^d$, while the right side is $O_d(n^{d-1})$. Division by $|W|$ and passage to infinity force $q=0$, contradicting the positive probability obtained by finite modification of Bernoulli percolation. Thus infinitely many infinite percolation clusters are impossible. The surface-to-volume comparison is the geometric reason for uniqueness on the lattice; the same argument is tied to amenability on more general graphs.

At $p=0$ there is no infinite percolation cluster, and at $p=1$ the whole lattice is the unique infinite percolation cluster. This completes all parameter cases. Finally, if the origin's infinite-cluster probability is zero, the countable union over all graph vertices shows there are no infinite percolation clusters almost surely. If it is positive, the translation-invariant existence event has positive probability and hence probability one. Together with uniqueness this distinguishes absence from the case of a single infinite percolation cluster, without making an unsupported assertion that every graph vertex belongs to it.

For finite $A\subset \mathbb{Z}$, define the occupation-product functionwith empty product one. Use the stirring representation of symmetric exclusion on the time interval $[0,t]$. Trace the labels at the sites of $A$ backwards to time zero, and call their set of ancestors $B_t$. Labels remain distinct under swaps, so $|B_t|=|A|$. Pathwise,Reverse time in the Poisson clocks. Their joint law is unchanged, and each interchange is its own inverse. Thus the backward set $B_t$ has the same law as the finite-particle symmetric exclusion set $A_t$ started from $A$. Taking expectations gives the product self-duality of symmetric exclusionThe argument holds for every deterministic initial configuration $\eta$ and every finite set $A$, including the empty set, and makes no stationarity assumption.

The generator identity confirms the same mechanism. For any edge $xy$, let $A^{xy}$ interchange membership of $x,y$. ThenSumming over edges gives $L_{\eta }D=L_{A}D$. In the finite-particle generator only edges joining an occupied to a vacant site contribute; in the occupation generator the same transpositions act on the other argument. Symmetry supplies the same rate in both operations.

To see why this qualification matters, suppose right jumps have rate $a$ and left jumps rate $b\ne a$. Take $A=\{0\}$ and an initial configuration whose only particle is at $1$. The derivative at zero of the left-hand probability is $b$, since that particle must jump left into zero. The derivative of the right-hand probability for the same asymmetric finite-particle process is $a$, since its particle must jump right from zero to the initially occupied site $1$. Thus the printed same-process identity would be false in that asymmetric interpretation. Under the symmetric convention established in the preceding part, the proof is complete.

For the given exchangeable law $\mu$, putwhich is well-defined by the stated assumption. Integrate the product self-duality of symmetric exclusion against $\mu$, and use boundedness to interchange expectation and integration:The finite-particle process conserves its cardinality. Hence the right side is ${\mathbb{E}}^A{m}_{|A_t|}=m_{|A|}$. All occupation-product moments are therefore unchanged by evolution.

These moments determine the law, not merely its one-site marginals. For disjoint finite sets $B,C$, the inclusion-exclusion principle givesEvery term is unchanged, so every finite cylinder probability is unchanged. Such cylinder events generate the product sigma-algebra on $\{0,1{\}}^{\mathbb{Z}}$, and probability laws agreeing on them agree everywhere. ConsequentlyThus every exchangeable probability law is invariant for the symmetric exclusion process. This proof of exchangeable invariant laws of symmetric exclusion needs only the given cardinality dependence and duality; no representation theorem for exchangeable measures is required.

The Simplicial approximation theorem states that a continuous map between realizations of finite simplicial complexes becomes homotopic to a simplicial map after sufficiently many barycentric subdivisions of the domain. More precisely, a vertex assignment is a simplicial approximation when the image of each open star is contained in the open star of its assigned vertex; sufficiently fine subdivision permits such an assignment. The resulting straight-line homotopy stays in the appropriate target simplices.

The vertices of a barycentric subdivision are the barycentres of nonempty faces. An $n$-simplex has $2^{n+1}-1$ such faces. A top-dimensional subdivided simplex corresponds to a full flag of faces of sizes $1,2,\dots ,n+1$, equivalently to an ordering of the original vertices. ThusTriangulate both copies of the sphere using finite complexes. For each fixed subdivision level there are only finitely many vertex maps to the finite target vertex set, hence only finitely many simplicial maps. Every continuous map is homotopic to one of them at some finite level. A countable union of finite sets is countable, proving at most countably many homotopy classes without needing their classification by degree.

For each integer $n\ge 1$, the open balls $\{B(x,1/n):x\in M\}$ cover the compact metric space $M$. Compactness supplies a finite subcover with centres forming a finite set $S_n$. Define $S={\bigcup }_{n\ge 1}{S}_n$, a countable union of finite sets and therefore countable.

For any $x\in M$ and $\epsilon >0$, choose $n$ with $1/n<\epsilon$. One of the covering balls contains $x$, so there is $s\in S_n\subseteq S$ with $d(x,s)<1/n<\epsilon$. Every open neighbourhood of $x$ therefore meets $S$, giving $x\in \mathrm{cl}(S)$. Thus $\mathrm{cl}(S)=M$, and $S$ is a countable dense subset. If $M$ is empty, simply take $S=\varnothing$.

Write $[M{]}^{\omega }$ for the set of all infinite subsets of $M$. A family $Y\subseteq [\mathbb{N}{]}^{\omega }$ is a Ramsey family in the homogeneous-cone sense if there is an infinite $M$ such that either $[M{]}^{\omega }\subseteq Y$ or $[M{]}^{\omega }\cap Y=\varnothing$. Thus membership in $Y$ is constant on an infinite homogeneous cone. We will prove the stronger version for open families: such a cone exists inside every prescribed infinite ground set, as in the definition of a Ramsey set of infinite subsets.

The symbols in the question refer to the ordinary topology on infinite subsets $\tau$ and the Ellentuck topology $\ast$. For a finite set $s$, letThese sets form a topological basis for $\tau$, equivalently the subspace topology inherited from the product topology on $\{0,1{\}}^{\mathbb{N}}$. For an infinite $A$ with $\max s<\min A$, the setsform a topological basis for $\ast$; take $\max \varnothing =0$. In particular $[s]=[s,\{n:n>\max s\}]$, so $\ast$ is finer than $\tau$.

For a non-Ramsey example use the finite-symmetric-difference parity colouring. On $[\mathbb{N}{]}^{\omega }$, define the equivalence relation $X\sim Z$ if their symmetric difference $X△Z$ is finite. By the axiom of choice, select a representative $R$ in every equivalence class. Give $X$ the colourwhere $R_X$ is its class representative. Deleting one point stays in the same class and toggles the parity. Thus for every infinite $M$, the sets $M$ and $M\setminus \{\min M\}$ are both in $[M{]}^{\omega }$ but have opposite colours. Either colour class, regarded as a family $Y$, is therefore not Ramsey.

Now let $U$ be $\tau$-open. We prove that for every infinite $A_0$ there is an infinite $C\subseteq A_0$ with $[C{]}^{\omega }\subseteq U$ or $[C{]}^{\omega }\cap U=\varnothing$. The proof uses acceptance and rejection of finite stems, which we define explicitly. For a finite stem $s$ and an infinite tail $A$ above $\max s$, say that $A$ accepts $s$ if $[s,A]\subseteq U$, and rejects $s$ if no infinite subset of $A$ accepts $s$. Both properties persist on taking infinite subsets. Every tail has an infinite subset that decides $s$: take an accepting subset if one exists, and otherwise it already rejects $s$.

First thin $A_0$ to decide the empty stem. Then construct $b_1<b_2<\cdots$ and nested infinite tails. At step $n$, choose $b_n$ from the current tail, discard its points at most $b_n$, and successively thin what remains to decide every stem $s\subseteq \{b_1,\dots ,b_n\}$. There are only finitely many such stems, so an infinite tail remains. Let $B=\{b_1,b_2,\dots \}$ and write $B/s=\{b\in B:b>\max s\}$. For every finite $s\subseteq B$, the tail $B/s$ decides $s$, since it lies in the tail obtained at the stage when the largest point of $s$ was selected. The empty stem is also decided. This is deciding all finite stems by fusion.

If $B$ accepts the empty stem, then $[B{]}^{\omega }\subseteq U$, as required. Otherwise $B$ rejects it. We need the finitely many accepting extensions of a rejected stem observation. Suppose a tail $B/s$ rejects $s$. Only finitely many $a\in B/s$ can have $B/a$ accepting $s\cup \{a\}$. Indeed, if infinitely many such $a$ formed a set $D$, every member of $[s,D]$ would have some first new point $a$ and all later points in $B/a$, hence would lie in $U$. This would make $D$ an accepting subset of $B/s$, contradicting rejection.

Choose $c_1<c_2<\cdots$ in $B$ recursively so that for every finite $s\subseteq \{c_1,\dots ,c_n\}$, the tail $B/s$ rejects $s$. The empty stem satisfies this initially. At the next step, each of the finitely many previous stems has only finitely many accepting one-point extensions by the observation. Choose $c_{n+1}$ larger than all previous points and outside all those finite exceptional sets. The first fusion ensured that the tail for every new stem decides it; since it does not accept it, it rejects it. This maintains the recursion.

Put $C=\{c_1,c_2,\dots \}$. If some $X\in [C{]}^{\omega }$ belonged to $U$, ordinary openness would give a finite initial segment $s$ of $X$ with $[s]\subseteq U$. In particular $[s,C/s]\subseteq U$. But $C/s$ is an infinite subset of $B/s$, which rejects $s$, a contradiction. Hence $[C{]}^{\omega }\cap U=\varnothing$. We have proved

The Weak Mordell-Weil theorem asserts that $E(K)/mE(K)$ is finite for an elliptic curve over a number field $K$ and an integer $m\ge 2$. The role of (i) is to make division by $m$ possible in the local formal group of an elliptic curve whenever the residue characteristic does not divide $m$.

Let $v$ be a finite place with good reduction of an elliptic curve and $v\nmid m$. The kernel of reduction of an elliptic curve is parametrized by $t=-x/y$ in the maximal ideal of the local valuation ring. Multiplication by $m$ is represented by an integral formal power seriesIts linear coefficient is a local unit. Part (i) supplies an integral compositional inverse. Both series converge on the maximal ideal, so multiplication by $m$ is a bijection on the reduction kernel, over the local field and over every finite unramified extension.

This implies unramified division torsors at good primes. For $P\in E(K)$, first divide its reduction by $m$ over the algebraic closure of the residue field. Multiplication by $m$ on the reduced curve is surjective and separable, so the chosen division point is defined over some finite residue extension. Smooth lifting gives a point $Q_0$ over the corresponding unramified local extension with the required reduction. The difference $P-m{Q}_0$ lies in the reduction kernel; the inverse series supplies $Q_1$ with $m{Q}_1=P-m{Q}_0$. Thus $Q=Q_0+Q_1$ divides $P$ over an unramified extension. Applying the same reasoning to all reduced $m$-torsion points lifts all of $E[m]$, so every point of $[m{]}^{-1}P$ lies in the maximal unramified extension. This excludes ramification outside a fixed finite set $S$ consisting of primes of bad reduction and primes over $m$.

For completeness, the remaining global finiteness step in the Kummer-theoretic proof of the weak Mordell-Weil theorem is as follows. Choose $Q\in E(\overline{K})$ with $mQ=P$. The cocycle $\sigma \mapsto \sigma Q-Q$ defines the Kummer map of an elliptic curveChanging $Q$ by an $m$-torsion point changes the cocycle by a coboundary. A zero class makes $Q$ rational after that change, so the map is injective.

Let $L=K(E[m])$, fixed independently of $P$. Since the torsion is rational over $L$, the cocycle restricted to its Galois group is a homomorphism into $E[m]$. Consequently $L(Q)/L$ is Galois of degree at most $m^2$, contains the entire division fibre, and is unramified outside $S$. Hence $[L(Q):K]\le m^2[L:K]$. There are only finitely many extensions of bounded degree unramified outside a fixed finite set: local extensions of bounded degree have bounded field discriminant exponents, and the Hermite–Minkowski theorem then applies to the bounded global field discriminants. Their finite Galois compositum $M$ contains every such division fibre; each $L(Q)$ is stable over $K$ because it contains $E[m]$ and the whole fibre above the rational point $P$. All the Kummer classes consequently factor through the fixed finite group $\mathrm{Gal}(M/K)$ with values in the fixed finite group $E[m]$. There are only finitely many such cocycles, provingThus (i) provides the local division step that bounds ramification; the global arithmetic finiteness completes the argument.