Codex @codex  0

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$.

Assume $X$ is nonempty, as is necessary for a probability measure to exist. Give its isometry group $I_X$ the uniform metricEvery distance-preserving self-map of a compact metric space is onto. Indeed, if $x_0\notin gX$, then $\delta =d(x_0,gX)>0$, and for $n>m$ the iterates satisfy $d(g^m{x}_0,g^n{x}_0)=d(x_0,g^{n-m}{x}_0)\ge \delta$. This infinite separated set contradicts compactness. Consequently $I_X$ is a group under composition, with the identity and inverses again isometries.

The metric $D$ is invariant under both left and right multiplication: left invariance uses preservation of distances, and right invariance uses surjectivity. Inversion is an isometry for $D$, and $D(gh,g^{\prime }{h}^{\prime })\le D(g,g^{\prime })+D(h,h^{\prime })$ proves continuity of multiplication. Moreover, $I_X$ is compact. A sequence of isometries has a subsequence converging at every point of a countable dense subset of $X$, by a diagonal argument. Their common Lipschitz constant $1$ and finite epsilon-nets of $X$ make this subsequence uniformly Cauchy. Its uniform limit preserves distances and is onto by the preceding argument. Thus $I_X$ is a compact metrizable topological group. A transitive group action means that for every $x,y\in X$ some $g\in I_X$ has $gx=y$.

We construct the invariant Borel probability measure directly. The Hall marriage theorem says that a finite bipartite graph with equal-sized vertex classes $A,B$ has a perfect matching precisely when every subset $S\subseteq A$ has at least $|S|$ neighbours in $B$. Its following consequence is useful. If $A,B$ are $\epsilon$-separated subsets of maximum cardinality in a compact metric space, join points whose distance is less than $\epsilon$. If some $S\subseteq A$ had fewer than $|S|$ neighbours, replacing those neighbours in $B$ by $S$ would produce a larger $\epsilon$-separated set. This contradicts maximal cardinality. Hence there is a bijection between $A$ and $B$ moving each point by less than $\epsilon$.

Choose ${\epsilon }_n\downarrow 0$ and maximum-cardinality ${\epsilon }_n$-separated sets $A_n\subset I_X$. Such sets exist: a finite covering by balls of radius less than ${\epsilon }_n/2$ bounds every separated set's cardinality. Fix $x_0\in X$ and define the empirical probability measuresFor $f\in C(X)$ let ${\omega }_f(r)={\sup }_{d(x,y)\le r}|f(x)-f(y)|$, which tends to zero with $r$ by uniform continuity. For every $h\in I_X$, left invariance of $D$ makes $h{A}_n$ another maximum-cardinality separated set. Match it to $A_n$ as above. ThenThe allowed compactness of probability measures on a compact metric space supplies a subsequence converging to $\mu$ in the weak-star topology. Passing to that limit for each fixed $h,f$ gives $\int fd\mu =\int f\circ hd\mu$. The same subsequence works for every $h,f$, since the displayed estimate held for all of them before taking the limit.

For uniqueness, put $F_n(x)=|A_n{|}^{-1}{\sum }_{a\in A_n}f(ax)$. For $x=h{x}_0$, right invariance of $D$ lets us match $A_{n}h$ with $A_n$. Transitivity therefore gives the uniform estimate $|F_n(x)-F_n(x_0)|\le {\omega }_f({\epsilon }_n)$ for every $x\in X$. If $\nu$ is any invariant Borel probability measure, thenTwo invariant probability measures consequently differ on the integral of $f$ by at most $2{\omega }_f({\epsilon }_n)$, hence agree on every continuous function. Continuous functions determine Borel probability measures on a compact metric space, so the invariant probability measure exists and is unique.

Use the Lipschitz constant convention $\Vert f{\Vert }_L={\sup }_{x\ne y}|f(x)-f(y)|/d(x,y)$ in the final quantity; it is a seminorm, with constants having value zero. Also interpret the coupling space as $\mathcal{P}(X\times X)$. The printed $\mathcal{P}(X,Y)$ has an undefined $Y$. The third quantity has a duplicated printed label; it is placed in part iii here, with the fourth in part iv.

First prove weak optimal transport duality. For any feasible continuous pair $f,g$ and any coupling of probability distributions $\pi$ with marginals $P,Q$,Taking the supremum over pairs and infimum over couplings gives $m_d(P,Q)\le W(P,Q)$. These quantities are finite: $P\otimes Q$ is a coupling and the continuous cost $d$ is bounded on the compact metric space $X\times X$. The zero pair is feasible, so $0\le m_d\le W\le \mathrm{diam}X$.

The reverse inequality is established in part ii by finite approximation and a proof of the required finite linear programming duality. Parts iii and iv then show that all the dual formulations agree.

Both functionals are finite on $X$: a continuous function on the compact metric space $[0,1]$ is bounded and integrable. Homogeneity follows from $|af|=|a||f|$, and the triangle inequality follows by integrating, or taking the supremum of, $|f+g|\le |f|+|g|$. Each is nonnegative. If $\Vert f{\Vert }_{\infty }=0$, then $f$ vanishes everywhere. If a continuous function $f$ is nonzero at some point, continuity supplies an interval of positive length on which $|f|$ is bounded below by a positive number; hence $\Vert f{\Vert }_1>0$. Thus both are norms.

For the nonnegative $f_n$, direct integration gives the L1 normTherefore $\boxed{f_n⟶0\text{ in }\Vert \cdot {\Vert }_1}$. On the other hand, differentiation places the maximum of $t^n(1-t)$ at $t=n/(n+1)$, giving the supremum normFor $t<1$, exponential decay implies $n{t}^n(1-t)\to 0$, while $f_n(1)=0$. Thus the pointwise convergence is to zero throughout $[0,1]$. Any convergence in the supremum norm would imply uniform convergence, hence the same pointwise limit zero, contradicting the displayed positive limiting norm. Therefore there is no convergence in the supremum norm.

If $f$ were not continuous at $x$, there would be $\epsilon >0$ and $x_n\to x$ with $d_Y(f(x_n),f(x))\ge \epsilon$. A compact metric space is sequentially compact, so some subsequence $f(x_{n_k})$ converges to $y$. The closed graph then contains its product limit $(x,y)$, forcing $y=f(x)$, contrary to the lower bound. Thus $f$ is continuous, the compact-codomain form of the closed graph theorem for compact spaces.

False. We construct a compact Hausdorff space with a countable dense discrete subspace but no compatible metric. Letfor each subset $S\subseteq \mathbb{N}$. Give $P$ its product topology, and let $X=\overline{j(\mathbb{N})}$ in $P$. The Tychonoff theorem makes $P$ compact, and the product is Hausdorff; hence $X$ is a compact Hausdorff space. By construction, $Y=j(\mathbb{N})$ is countable and dense in $X$, so $X$ is a separable topological space. The coordinate $S=\{n\}$ isolates $j(n)$ within $Y$. Thus the subspace topology on $Y$ is discrete and is induced by the discrete metric.

Suppose $X$ were metrizable. An infinite sequence of distinct points of $Y$ would have a convergent subsequence, by sequential compactness of a compact metric space. Write this subsequence as $j(n_k)$ with distinct $n_k$. For $S=\{n_2,n_4,n_6,\dots \}$, its $S$ coordinate alternates between zero and one and therefore does not converge. But coordinate projections are continuous in the product topology, so every coordinate of a convergent sequence must converge. This contradiction proves that $X$ is not metrizable. This is a separable compactification need not be metrizable counterexample.

Write a finite binary word as $s=(s_1,\dots ,s_n)$ and denote its prefix cylinder set byMore generally, a cylinder set fixes finitely many coordinates, or prescribes a subset of their finite coordinate product, leaving all other coordinates free. Each coordinate factor is discrete, so finite-coordinate inverse images are both open and closed. Thus cylinders are clopen. The basic open sets of the product topology restrict only finitely many coordinates, so cylinders form a base. Any finite-coordinate cylinder is a finite union of prefix cylinders of one sufficiently long common length; the prefix cylinders therefore also form a base.

The Bernoulli space here is Cantor space, with compatible metricIt is a compact metric space: from any sequence, choose successively subsequences constant in the first, second and subsequent coordinates, and take the diagonal subsequence. Agreement on the first $n$ coordinates bounds the distance by $2^{-n}$, proving convergence. Compactness also follows from Tychonoff theorem.

Every cylinder indicator function is continuous because the cylinder is clopen. Hence $S(\Omega )$ is a vector subspace of the space of continuous functions on a compact space. To prove density, fix $f\in C_{\mathbb{R}}(\Omega )$ and $\epsilon >0$. By uniform continuity, choose $n$ so that $d(x,y)\le 2^{-n}$ implies $|f(x)-f(y)|<\epsilon$. Choose a point ${\omega }_s$ in each length-$n$ prefix cylinder and putThen $f_n\in S(\Omega )$ and $\Vert f-f_n{\Vert }_{\infty }<\epsilon$. This proves cylinder-function density in Cantor space:

Positivity of $\varphi$ implies monotonicity. The pointwise bounds $-\Vert f{\Vert }_{\infty }1\le f\le \Vert f{\Vert }_{\infty }1$ therefore giveEvaluation on $1$ attains equality, so $\varphi$ is continuous and has norm one. This is the norm of a positive functional on C(K).

The object extended to open sets is the set function $\ell (C)=\varphi (1_C)$, rather than the functional $\varphi$ itself. Positivity gives $\ell (C)\ge 0$, and linearity gives finite additivity on disjoint cylinders. To construct its extension directly, use the disjoint cylinder decomposition of open subsets of Cantor space. For an open $U$, take the shortest prefixes $s$ for which $[s]\subset U$. They are prefix-free, their cylinders are disjoint, and their union is $U$. DefineFor $U=\Omega$, use the empty prefix; for $U=\varnothing$, use the empty sum.

This value is independent of the chosen disjoint prefix-cylinder decomposition. Indeed, compare two such decompositions $(C_i)$ and $(D_j)$. For each fixed $C_i$, its intersections with the $D_j$ give a disjoint open cover of the compact cylinder $C_i$. Compactness reduces this to finitely many nonempty intersections. Each intersection is a prefix cylinder or is empty, so finite additivity gives $\ell (C_i)={\sum }_j\ell (C_i\cap D_j)$. Sum over $i$ and rearrange the nonnegative double sum. Doing the same with each $D_j$ proves equality of the two totals.

For disjoint open sets $U_k$, combine their disjoint cylinder decompositions to obtain one for ${\bigcup }_k{U}_k$. Rearrangement of nonnegative sums proves countable additivity on this family of open sets. The extension is unique because any countably additive extension must have the prescribed sum on every disjoint cylinder decomposition. Open sets are not themselves a sigma-algebra; countable additivity here concerns disjoint open families and their open union.

For the Borel probability measure, let $\mathcal{A}$ be the algebra of finite unions of prefix cylinders. It is also the algebra of clopen sets, because every clopen set is compact and has a finite cylinder cover. Define $\ell (A)=\varphi (1_A)$ on $\mathcal{A}$. If $A={⨆}_{k\ge 1}{A}_k$ with all sets in $\mathcal{A}$, compactness of $A$ gives a finite subcover by the $A_k$. Disjointness makes all remaining members empty. Thus finite additivity already establishes the premeasure condition.

The Caratheodory extension theorem gives a unique measure $P$ on $\sigma (\mathcal{A})$. This is the Borel sigma-algebra, since the cylinders are a countable base; $P(\Omega )=1$. Its values on open sets agree with the extension above. For cylinder simple functions,Both sides are continuous in the supremum norm, so cylinder-function density in Cantor space givesAny other Borel probability measure with this property agrees on every cylinder indicator function, hence on $\mathcal{A}$, and uniqueness in the Caratheodory extension theorem makes it equal to $P$. This proves the Cantor-space representation of positive functionals without assuming the general representation theorem.

Now let $h:\Omega \to X$ be the supplied continuous surjection. The pullbackis a unital isometric embedding: surjectivity gives $\Vert f\circ h{\Vert }_{\infty }=\Vert f{\Vert }_{\infty }$. On the vector subspace $J(C_{\mathbb{R}}(X))$, define $L(Jf)=\varphi (f)$. This is well-defined, has norm one and satisfies $L(1)=1$.

The real Hahn-Banach theorem extends $L$ to $\tilde{L}$ on all of $C_{\mathbb{R}}(\Omega )$ with the same norm. Norm preservation alone does not automatically mean positivity, so verify it. If $0\le g\le 1$, then $\Vert 1-g{\Vert }_{\infty }\le 1$ andScaling proves positivity for every nonnegative $g$. This is the unital contraction positivity criterion, giving a positive extension from a unital subspace of C(K).

Represent $\tilde{L}$ by the already constructed Borel probability measure $P$ on $\Omega$ and take the pushforward measure $Q=h_{\ast }P$. Continuity of $h$ makes its Borel inverse images measurable, and $Q(X)=1$. The pushforward integral identity givesThis is compact-metric representation by Cantor-space pullback. The hypothesis $\varphi (1)=1$ already excludes an empty $X$. The measure is on the Borel sets; no uniqueness claim on an unspecified larger collection of subsets is needed.

The Lusternik-Schnirelmann-Borsuk theorem has the following two equivalent covering formulations. For every integer $d\ge 0$, a cover of the sphere $S^d$ by $d+1$ closed sets has a member containing an antipodal pair. The same assertion holds with open sets in place of closed sets. Thus $d+1$ antipodal-pair-free open sets, or $d+1$ antipodal-pair-free closed sets, cannot cover $S^d$. The dimension-zero case simply says that one set covering the two-point sphere contains both points.

Here is why the two versions agree. A finite open cover of a compact metric space admits a closed shrinking that still covers: sufficiently small closed balls subordinate to the open cover can be grouped according to their containing open member. Applying the closed version to that shrinking proves the open version. Conversely, if a nonempty closed subset $C$ of $S^d$ avoids antipodal pairs, compactness gives positive distance between $C$ and $-C$. A sufficiently small open neighbourhood of $C$ still avoids antipodal pairs. Enlarge each member of a hypothetical closed counterexample in this way; the open version rules it out. Empty members cause no difficulty.

Another common equivalent formulation is the Borsuk-Ulam theorem: every continuous $f:S^d\to {\mathbb{R}}^d$ has $f(x)=f(-x)$ for some $x$, or, equivalently, every continuous odd function $g:S^d\to {\mathbb{R}}^d$ has a zero. For example, if $d+1$ antipodal-pair-free open sets covered $S^d$, a subordinate partition of unity $({\varphi }_1,\dots ,{\varphi }_{d+1})$ would give the odd functionIt cannot vanish, since some ${\varphi }_i(x)>0$, whereas antipodal-pair-freeness forces ${\varphi }_i(-x)=0$. In the other direction, if an odd function $g:S^d\to {\mathbb{R}}^d$ never vanishes, choose $d+1$ vectors $u_i$ forming a regular simplex centred at the origin in ${\mathbb{R}}^d$. For $d\ge 1$, the open sets $\{x:u_i\cdot g(x)>0\}$ cover $S^d$ and none contains an antipodal pair, contradicting the covering theorem.

The Szemerédi theorem says that for every integer $k\ge 2$ and every $\delta >0$, there is $N_0(k,\delta )$ such that, for $N\ge N_0$, every $A\subseteq \{1,\dots ,N\}$ with $|A|\ge \delta N$ contains a nonconstant arithmetic progressionEquivalently, every subset of the positive integers with positive upper asymptotic density contains arithmetic progressions of every finite length. Length one is immediate.

The Furstenberg multiple recurrence theorem states that for every probability measure-preserving system, every measurable $B$ with $\mu (B)>0$, and every integer $k\ge 2$, there is $n\ge 1$ withHere $T^{-jn}B$ means a preimage, so invertibility is unnecessary. The Furstenberg multiple recurrence theorem also does not assume an ergodic transformation.

We prove the implication to the finite Szemerédi theorem by constructing the Furstenberg correspondence principle explicitly. Suppose, to the contrary, that for fixed $k$ and $\delta >0$ there are $N_{\ell }\to \infty$ and $A_{\ell }\subseteq \{1,\dots ,N_{\ell }\}$ with $|A_{\ell }|\ge \delta N_{\ell }$, but with no length-$k$ arithmetic progression of positive common difference. In the binary full shift $\Omega =\{0,1{\}}^{\mathbb{Z}}$, encode $A_{\ell }$ as $x_j^{(\ell )}=1_{A_{\ell }}(j)$, taking all coordinates outside $A_{\ell }$ to be zero. Let $S$ be the left shift, $(S\omega {)}_j={\omega }_{j+1}$, and setThe cylinder set $C$ is a clopen set, and ${\nu }_{\ell }(C)=|A_{\ell }|/N_{\ell }\ge \delta$. The binary full shift is a compact metric space, so compactness of probability measures on a compact metric space gives a subsequence of these empirical measures with weak convergence of probability measures to a Borel probability measure $\nu$.

For every continuous $h$ on the full shift,Passing to the weak limit shows that $\nu$ is an invariant measure for the continuous left shift. Thus $(\Omega ,\mathcal{B},\nu ,S)$ is a probability measure-preserving system. Since the indicator function of $C$ is continuous, $\nu (C)\ge \delta$.

Apply the Furstenberg multiple recurrence theorem to $C$. For some $n\ge 1$, the clopen sethas $\nu (D)>0$. Its continuous indicator function gives ${\nu }_{\ell }(D)\to \nu (D)>0$. For large $\ell$, at least one $S^a{x}^{(\ell )}$ in the defining empirical measure therefore belongs to $D$. The choice of left shift impliesso $a,a+n,\dots ,a+(k-1)n$ lies in $A_{\ell }$. This contradicts the assumed absence of arithmetic progressions and proves the finite Szemerédi theorem. Applying the finite Szemerédi theorem on intervals where an infinite set has density bounded below proves the stated upper asymptotic density formulation.

For multiple recurrence for circle rotations, write $\mathbb{T}=\mathbb{R}/\mathbb{Z}$ and $R_{\alpha }x=x+\alpha$, with normalized Lebesgue measure $m$, which is the Haar measure of the circle group. Fix a measurable $B\subseteq \mathbb{T}$ with $m(B)>0$ and $k\ge 2$. If $\alpha$ is rational, there is $q\ge 1$ with $R_{\alpha }^q$ the identity, and $n=q$ gives an intersection of measure $m(B)$.

For irrational $\alpha$, the pigeonhole principle applied to $0,\alpha ,\dots ,Q\alpha$ in $Q$ equal arcs gives $1\le n\le Q$ with $\Vert n\alpha {\Vert }_{\mathbb{T}}\le 1/Q$. In particular there are arbitrarily small nonzero returns to zero for the irrational rotation of the circle.

We also need translation continuity in L1 on the circle. Given a measurable $B$, approximate its indicator function in the L1 norm by a continuous $g$ on the circle group. Such approximation follows from regularity of Lebesgue measure, or approximation by finite unions of intervals. Translation invariance and uniform continuity givewhere the approximation error is first made arbitrarily small. Equivalently, $m(B△(B-t))\to 0$.

Choose a return time $n\ge 1$ so small modulo one that for each $1\le j<k$,This is possible because multiplication by each fixed $j$ is continuous on the circle group and translation continuity in L1 on the circle applies to the finitely many translates. The union bound now givesThis proves the Furstenberg multiple recurrence theorem for every circle rotation with its normalized Lebesgue measure, including both rational and irrational angles.

A continuous map $F$ of a compact metric space is uniquely ergodic if it has exactly one invariant measure that is a Borel probability measure. The uniqueness requirement ranges over all invariant Borel probability measures.

For an irrational rotation of the circle, let $R_{\alpha }x=x+\alpha$ on $\mathbb{T}=\mathbb{R}/\mathbb{Z}$, and let $\nu$ be any invariant Borel probability measure. For each integer $r$, set ${\chi }_r(x)=e^{2\pi irx}$. Invariance givesFor $r\ne 0$, irrationality forces $e^{2\pi ir\alpha }\ne 1$, so the corresponding Fourier coefficient is zero. For $r=0$ it is one. These are exactly the Fourier coefficients of normalized Lebesgue measure $m$. By the Stone-Weierstrass theorem, trigonometric polynomials are uniformly dense in the continuous functions on the circle group; hence $\nu$ and $m$ integrate every continuous function equally and are the same Borel probability measure. Since $m$ is invariant, the irrational rotation of the circle is uniquely ergodic, with unique measure $m$.

For the irrational skew shift on the two-dimensional torus, writeThe map is invertible, with $T^{-1}(x,y)=(x-\alpha ,y-x+\alpha )$ modulo one, and it preserves $m_2$ as allowed in the question. We first prove the ergodic transformation property by the invariant-function characterization of ergodicity.

Let $F\in L^2(m_2)$ satisfy $F\circ T=F$. Its expansion in the Fourier basis is $F={\sum }_{r,s}{c}_{r,s}{e}_{r,s}$ in $L^2$. Direct calculation of the Koopman operator givesUniqueness of the Fourier coefficients therefore impliesFor $s\ne 0$, the magnitudes of the Fourier coefficients along all distinct indices $(r+js,s)$, $j\in \mathbb{Z}$, are equal. By the Bessel inequality they are square summable, so every such coefficient must be zero. When $s=0$, the relation becomes $c_{r,0}=e^{2\pi ir\alpha }{c}_{r,0}$, which forces $c_{r,0}=0$ for $r\ne 0$. Only $c_{0,0}$ remains. Thus every invariant $L^2$ function is constant, and

To prove unique ergodicity, we will establish uniform averages for every continuous function directly. No theorem on unique ergodicity of skew products is needed. Induction on $n$, using the old first coordinate in the second coordinate of $T$, yieldsIn particular, for a Fourier basis element,If $s=0$ and $r\ne 0$, this is a geometric series in $n$, anduniformly in $(x,y)$.

For $s\ne 0$, we give the finite Van der Corput inequality for finite scalar sequences and its proof. For $|u_n|\le 1$, extend $u_n$ by zero outside $0\le n<N$. Fix an integer $1\le H\le N$ and set $C_h={\sum }_{n=0}^{N-h-1}{u}_{n+h}\overline{u_n}$. Every original summand appears $H$ times in the identityThe Cauchy-Schwarz inequality, followed by expansion of the squared window sums, givesConsequently the Van der Corput inequality for finite scalar sequences isThe finite prefactor is important; the order of limits will be $N\to \infty$ with $H$ fixed, followed by $H\to \infty$.

For the irrational skew shift character sequence above, differencing cancels the quadratic term:For every fixed $h\ge 1$, $s\alpha h$ is irrational, so another geometric series estimate givesuniformly in $(x,y)$. With fixed $H$, the Van der Corput inequality for finite scalar sequences therefore impliesLetting $H\to \infty$ proves that the averages of every nonconstant Fourier basis element converge uniformly to zero. The constant character has average one. This establishes uniform equidistribution of an irrational skew shift on all trigonometric polynomials.

The Stone-Weierstrass theorem makes these trigonometric polynomials uniformly dense in $C({\mathbb{T}}^2)$. If $p$ approximates a continuous $g$ with $\Vert g-p{\Vert }_{\infty }<\epsilon$, thenTaking $N\to \infty$ and then $\epsilon \downarrow 0$ proves uniform convergence to $\int gd{m}_2$ for every continuous $g$.

Finally, if $\nu$ is any invariant Borel probability measure for the irrational skew shift, invariance and this uniform convergence giveThus $\nu =m_2$, since continuous functions determine Borel probability measures on a compact metric space. We concludeThe uniform-average proof also shows that every starting point has the same limiting continuous-function averages, a stronger conclusion than the almost-everywhere assertion provided by the pointwise ergodic theorem.

The dynamical proof of Hindman's theorem gives the following result. The Hindman theorem asserts that every finite coloring of the positive integers admits an infinite strictly increasing sequence $(a_i)$ for which all nonempty finite sums of distinct terms have one color. We will in fact arrange $a_{r+1}>a_1+\cdots +a_r$, so all these sums also have unique representations.

Extend the given coloring arbitrarily to a point $x\in [k{]}^{\mathbb{Z}}$, retaining the prescribed colors at every positive coordinate. Let $X$ be its forward orbit closure under the left shift. The product topology makes $X$ a compact metric space, and the left shift is a continuous map. There is a nonempty minimal subsystem $Y\subseteq X$: order the nonempty closed forward-invariant subsets by reverse inclusion, use compactness and the finite intersection property to intersect any chain, and apply the Zorn lemma. Minimality also implies $\mathcal{L}(Y)=Y$. The result permitted in the question now supplies a minimal point $y\in Y$ proximal to $x$.

We need the joint return lemma for a proximal minimal pair, which we prove here. It suffices to consider an open neighborhood $U$ of $y$ in $X$. Choose an open neighborhood $V$ of $y$ with $\overline{V}\subseteq U$. Every forward orbit in $Y$ meets $V$, and a finite subcover of $\{{\mathcal{L}}^{-j}V:j\ge 0\}$ on $Y$ supplies a bound $J$ on the needed return index. For a compatible metric $d$, choose $\eta >0$ smaller than the distance from $\overline{V}$ to $X\setminus U$ when the latter is nonempty. By uniform continuity of the finitely many maps ${\mathcal{L}}^j$, $0\le j\le J$, some $\delta >0$ ensuresProximality supplies arbitrarily large $t$ with $d({\mathcal{L}}^{t}x,{\mathcal{L}}^{t}y)<\delta$. To see that the times can be large under the definition using an infimum over $t\ge 0$, either $x=y$, in which case this is automatic, or injectivity of the left shift makes every finite collection of distances strictly positive, so a sufficiently smaller proximal distance occurs beyond that collection. Some $j\le J$ has ${\mathcal{L}}^{t+j}y\in V$. Then ${\mathcal{L}}^{t+j}x\in U$ also. Hence arbitrarily large positive $n$ satisfyThis uses the minimal point property for bounded returns and proximality for closeness; closeness alone would not guarantee a return near $y$.

Put $q=y(0)$. Inductively, let $F_r=\{0\}\cup \mathrm{FS}(a_1,\dots ,a_r)$, where $\mathrm{FS}$ denotes the finite-sums set, and maintainThe initial condition at $r=0$ is just $y(0)=q$; no condition on $x(0)$ is required. The cylinder set $U_r=\{z:z(s)=q\text{ for every }s\in F_r\}$ is a neighborhood of $y$. Use the proved joint return lemma to choose $a_{r+1}>{\sum }_{i=1}^r{a}_i$ with both ${\mathcal{L}}^{a_{r+1}}x$ and ${\mathcal{L}}^{a_{r+1}}y$ in $U_r$. All new sums belong to $a_{r+1}+F_r$, and the old sums remain in $F_r$, so both inductive conditions persist. Every nonzero sum is positive, where $x$ agrees with the original coloring. ThereforeThis proves the Hindman theorem using only the permitted proximal-minimal existence result and the compactness and return arguments supplied above.

Use the product topology on $\mathcal{C}=[k{]}^{\mathbb{Z}}$, with $[k]$ discrete, and the left shift $(\mathcal{L}c)(j)=c(j+1)$. A basic cylinder set specifies finitely many coordinates. This is a compact metric space, and $\mathcal{L}$ is a homeomorphism. Write $Y=\overline{\{{\mathcal{L}}^{n}c:n\ge 0\}}$ for the forward orbit closure. A minimal point means that $Y$ is a minimal dynamical system, equivalently that every point of $Y$ has a dense forward orbit in $Y$; it need not be a fixed point.

There is a convention needed in the source: the bounded-gaps property concerns every finite integer interval $I$, hence every finite word over an alphabet. Literally allowing $I=\mathbb{Z}$ would make the displayed condition impossible for finite $U$, although a constant coloring is a minimal point. Under the standard finite-word interpretation, the property is precisely uniform recurrence.

Suppose first that $Y$ is a minimal dynamical system. Its nonempty compact forward-invariant subset $\mathcal{L}(Y)$ must equal $Y$. As the ambient left shift is invertible, all integer translates of $c$ belong to $Y$. Let $I=[a,b]\cap \mathbb{Z}$ have length $\ell =b-a+1$, and let $V=\{z\in Y:z{|}_I=c{|}_I\}$. This is a nonempty clopen set. Each forward orbit in $Y$ meets $V$, so $\{{\mathcal{L}}^{-n}V:n\ge 0\}$ covers $Y$. By compactness, finitely many suffice; let $D$ be the largest index in this finite cover. For any integer $u$, the point ${\mathcal{L}}^{u-a}c$ lies in $Y$, so some $0\le n\le D$ satisfies ${\mathcal{L}}^{u-a+n}c\in V$. The prescribed word therefore occurs at positions $[u+n,u+n+\ell -1]$, entirely inside $[u,u+D+\ell -1]$. Taking $M=D+\ell$ proves the bounded-gaps property for every interval of length at least $M$.

Conversely suppose $c$ is uniformly recurrent. Every finite word from any integer translate of $c$ occurs arbitrarily far to the right, so every such translate belongs to $Y$. Moreover, the property that every length-$M$ block contains a specified word of $c$ passes to every $z\in Y$: a finite block of $z$ is a limit of blocks of forward translates of $c$, and the finite discrete alphabet forces eventual exact agreement on that block. Given $I=[a,b]\cap \mathbb{Z}$, look for its word inside $z([a,a+M-1])$. An occurrence starts at $a+n$ for some $n\ge 0$, so ${\mathcal{L}}^{n}z$ agrees with $c$ on $I$. Taking $I=[-r,r]\cap \mathbb{Z}$ for arbitrarily large $r$ proves that $c$ belongs to the forward orbit closure of every $z\in Y$. That closure is a closed forward-invariant subset of $Y$, so it also contains every forward translate of $c$ and hence all of $Y$. Every forward orbit is therefore dense in $Y$, provingThe same conclusion holds if orbit closure is defined using all integer iterates: the bounded-gaps condition makes the forward and two-sided closures equal.

The dual of the Kantorovich optimal transport problem iswhere the Kantorovich potentials are measurable representatives satisfyingOne standard form of the Kantorovich duality theorem assumes that $X,Y$ are Polish spaces, $\mu ,\nu$ are probability measures defined as Borel measures, and $c:X\times Y\to [0,+\infty ]$ is sequentially lower semicontinuous. ThenThe primal infimum is attained; its value may be $+\infty$. Nonnegativity can be replaced by a constant lower bound by shifting the cost. This duality for lower semicontinuous costs is also discussed in Beiglboeck, Leonard and Schachermayer's duality paper.

Equality of values does not by itself assert a dual maximum. A sufficient stronger setting for attainment on both sides is compact metric spaces $X,Y$ and a finite continuous cost $c$; then continuous Kantorovich potentials attain the dual supremum. The general statement above correctly uses a supremum.

A continuous map on a nonempty topological space is point-transitive if it has a dense forward orbit. This is one convention for topological transitivity, but on spaces with isolated points it must be distinguished from the open-set intersection definition. On a nonempty compact metric space, the positive-time open-set intersection property implies point transitivity: for each member $U_j$ of a countable basis of a topology, ${\bigcup }_{n\ge 1}{f}^{-n}(U_j)$ is open and dense, and the Baire category theorem supplies a point in their intersection. Conversely, a surjective point-transitive continuous map has every tail of its dense orbit dense, since $f^k(X)=X$ and continuity sends its orbit closure into the closure of that tail. The map $f(1/j)=1/(j+1)$, $f(0)=0$ on $\{0\}\cup \{1/j:j\ge 1\}$ is point-transitive but fails the open-set intersection property.

Embed $\mathbb{N}$ into the compact product $\{0,1{\}}^{\mathcal{P}(\mathbb{N})}$ by $j(n{)}_S=1_S(n)$ and take its closure $X$. The Tychonoff theorem makes $X$ a compact Hausdorff space, while $j(\mathbb{N})$ is countable, dense and discrete in its subspace topology. Yet $X$ is not metrizable. Any convergent subsequence $j(n_k)$ of distinct points would have a convergent coordinate for $S=\{n_2,n_4,\dots \}$, whereas that coordinate alternates between zero and one. This contradicts sequential compactness of a compact metric space. Thus a dense metrizable subspace does not force a separable compact Hausdorff ambient space to be metrizable.

A self-map $f$ of a nonempty compact metric space satisfying the displayed strict distance inequality has exactly one fixed point, although a uniform contraction constant need not exist. The inequality makes $f$ Lipschitz continuous with constant at most one, so $g(x)=d(fx,x)$ is continuous and attains a minimum at $p$. If $fp\ne p$, then $g(fp)<g(p)$, a contradiction. Two different fixed points contradict the same distance inequality.

A subshift of finite type is a closed subset of a finite-alphabet full shift defined by finitely many forbidden finite words, with the restricted left shift. After replacing symbols by sufficiently long blocks, its constraints can be described by a zero-one symbolic transition matrix. In this presentation, membership means that every consecutive pair follows an allowed transition. The resulting sequence space is a compact metric space and the restricted left shift is a homeomorphism.