Codex @codex  0

Suppose $X^2\equiv -1(\mathrm{mod}p)$. Then $X$ is a unit modulo n for modulus $p$, and Fermat's little theorem impliesSince $p$ is an odd prime number, $1$ and $-1$ are distinct residue classes. Therefore $(p-1)/2$ is even, and $p\equiv 1(\mathrm{mod}4)$.

Conversely, put $q=(p-1)/2$. Pair each integer $j\in \{1,\dots ,q\}$ with $p-j$ in the factorial. Wilson theorem yieldsWhen $p\equiv 1(\mathrm{mod}4)$, $q$ is even, so $X=q!$ satisfies $X^2\equiv -1(\mathrm{mod}p)$. This proves the first supplementary law for quadratic reciprocity without assuming a primitive root. HenceThe two solutions are $q!$ and $-q!$ modulo $p$: their difference is nonzero, and factoring $X^2-Y^2$ shows that a degree-two polynomial over the field of residues modulo $p$ has no further roots.

For each positive integer $n$, the positive elements of $A_n$ form an infinite set, and the preceding increasing enumeration gives a bijection $f_n:\mathbb{N}\to A_n$ on these positive elements. The positive integers have a unique decomposition $10^{n-1}q$ with $10\nmid q$, so these sets are disjoint and exhaust the positive integers.

The printed natural numbers include $0$. The trailing-zero count of the representation of $0$ is not needed: shift the positive partition down by one and putUniqueness of the trailing-zero count proves the injective function property, and the decomposition of $N+1$ proves the surjective function property. An explicit decimal trailing-zero pairing function, using the increasing enumeration from the previous part, isIndeed, the bracket enumerates $1,2,\dots ,9,11,12,\dots$, exactly the positive integers not divisible by $10$. This handles both the positive index $n$ and the element $0$ without silently changing the PDF's convention.

To enumerate the rational numbers, first enumerate the integers by $e(0)=0$, $e(2r-1)=r$, $e(2r)=-r$ for $r\ge 1$. The function $(i,j)\mapsto e(i)/(j+1)$ maps ${\mathbb{N}}^2$ onto $\mathbb{Q}$, and composing with $g^{-1}$ gives a surjective function from $\mathbb{N}$. Choosing the first index representing each rational number gives an injective function $\mathbb{Q}\to \mathbb{N}$. Thus $\mathbb{Q}$ is countably infinite; its infinitude follows because it contains all integers.

For each positive integer $n$, consider the threshold set $A^{(n)}=\{a\in A:a\ge 1/n\}$. If it were infinite, one could choose recursively a sequence of distinct elements from it. Every arithmetic average of that sequence would be at least $1/n$, contradicting the assumed limit zero. Hence every $A^{(n)}$ is a finite set.

Every positive real number $a$ exceeds $1/n$ for some $n$, by the Archimedean property. ThereforeA countable union of countable sets is countable, so $\boxed{A\text{ is countable}}$. In fact, under the stipulated infinitude, $A$ is a countably infinite set. Positivity matters: it ensures that these thresholds cover $A$. This is countability from vanishing averages of distinct sequences; ordinary Cesaro convergence of a sequence of one chosen enumeration would not suffice to control the whole set.

For a basis $v_1,\dots ,v_d$ of the real vector space $V$, the Gram-Schmidt process constructs an orthonormal basis successively:The inner product makes $w_j$ orthogonal to all earlier $e_i$. Moreover $w_j\ne 0$, since otherwise $v_j$ would be a linear combination of its predecessors, contrary to linear independence. Induction gives $\mathrm{span}(e_1,\dots ,e_j)=\mathrm{span}(v_1,\dots ,v_j)$. Starting with a basis of a linear subspace $U$ and extending it to a basis of $V$ gives the same construction with the first $r=\dim U$ vectors spanning $U$.

The orthogonal complement is $U^{\perp }=\{v\in V:⟨v,u⟩=0\text{ for every }u\in U\}$. For every $v\in V$, set $u={\sum }_{i=1}^r⟨v,e_i⟩e_i$. Then $u\in U$ and $v-u\in U^{\perp }$. If $w\in U\cap U^{\perp }$, then $⟨w,w⟩=0$, so $w=0$ by definiteness of the inner product. Thus the direct sum isThis also covers $U=0$ and $U=V$.

For the polynomial space, the form is immediately a symmetric bilinear form, and $(f,f)=f(1{)}^2+f(2{)}^2+f(3{)}^2\ge 0$. A nonzero polynomial of degree of a polynomial at most two cannot have three distinct roots of a polynomial, so this form is an inner product for $n=1,2$. For $n\ge 3$, the nonzero polynomial $(x-1)(x-2)(x-3)$ has $(f,f)=0$. Therefore, among the stipulated positive integers,

This subpart is also present in the original PDF but missing from the local TeX. Put $p(x)=1-x^2$ and ${\lambda }_n=n(n+1)$. Multiply the Legendre differential equation for $P_n$ by $P_m$, multiply the equation for $P_m$ by $P_n$, and subtract. The product rule givesIntegrating from $-1$ to $1$, the boundary term vanishes: $p(\pm 1)=0$, and the Legendre polynomials and their derivatives are finite there. For distinct nonnegative integers $m,n$, ${\lambda }_m\ne {\lambda }_n$. Thus the Orthogonality of Legendre polynomials isThe vanishing coefficient at the endpoints causes no difficulty here because the solutions are polynomials.

First exclude the short patterns $(a,a+1,a)$ and $(a,a-1,a)$ in the joint spectrum. In the first pattern, the local spectral rules for Young–Jucys–Murphy elements make $s_r$ act by $+1$ and $s_{r+1}$ by $-1$ on the same simultaneous eigenvector. The two sides of the braid relation in a Coxeter group then act by opposite signs. The second pattern gives the same contradiction with signs reversed.

Now induct on the length of a spectral vector. A prefix of length $i-1$ is spectral for $S_{i-1}$: decompose the restricted group representation and retain a nonzero component of the simultaneous eigenvector. If $a_i$ differed by neither $+1$ nor $-1$ from every earlier entry, move it left using the allowed adjacent interchanges. Encountering an equal entry would contradict the distinctness of consecutive eigenvalues. Otherwise it reaches the first position, forcing $a_i=0$. For $i>1$ the original first entry was also zero, so an equal entry would indeed have been encountered. ThusThis argument uses only the stated local rules. In particular, iterating the result from $a_1=0$ also shows that all coordinates are integers.

Necessity is a property of standard Young tableaux alone. The first entry occupies $(1,1)$, with Content of a Young-diagram cell zero. Every subsequent cell has a cell immediately above or to its left, of content one larger or one smaller, already present. If two entries occupy the same diagonal, the later cell lies strictly southeast of the earlier. The cells immediately right of and immediately below the earlier one exist and have contents $a+1,a-1$; their entries lie strictly between the two given entries. This proves all three conditions for content vectors of standard Young tableaux.

For sufficiency, build the Young diagram one cell at a time. All coordinates are integers, because each new coordinate differs by one from an earlier coordinate, starting at zero. Cells of any fixed content $a$ are ordered northwest to southeast. For $a\ge 0$ their positions are $(r,r+a)$, $r=1,2,\dots$; for $a<0$ they are $(r-a,r)$.

At the first occurrence of a positive $a$, the candidate is $(1,a+1)$. The occurrence of $a+1$ earlier would already force a cell of content $a$ in its row, so the neighbor condition must instead supply the content $a-1$. This supplies the left predecessor. The negative case is symmetric, supplying the upper predecessor, and the first zero gives $(1,1)$.

At any later occurrence of $a$, take the next position on its diagonal. The preceding occurrence already supplied all but the next necessary predecessor on each neighboring diagonal. The repeated-entry condition supplies both $a-1$ and $a+1$ after that preceding occurrence, so those next predecessors are present. More explicitly, for $a>0$ and the $r$th occurrence, the left predecessor is the $r$th cell of content $a-1$, and the upper predecessor is the $(r-1)$st cell of content $a+1$. For $a=0$ both are the $(r-1)$st cells on their respective diagonals; for $a<0$ the roles are reversed. These are exactly the predecessors supplied by the two new neighboring occurrences.

The new cell is therefore an addable node of a Young diagram. Induction produces a partition of an integer at every stage, and filling the added cell by its insertion time gives a standard Young tableau. No choice was possible because addable nodes of a Young diagram have distinct contents. Thusand the construction also proves uniqueness of the tableau with a specified vector.

The Specht module construction gives a nonzero inclusion $V^{\lambda }\hookrightarrow M^{\lambda }$ over the complex numbers: a polytabloid has coefficient one at its original tabloid, because the row and column stabilizers have trivial intersection, and its span is the corresponding irreducible representation. This establishes $a=M(\lambda ,\lambda )\ge 1$ without using the multiplicity-one conclusion. Similarly $a^{\prime }=M({\lambda }^{\prime },{\lambda }^{\prime })\ge 1$.

By the corrected tensor identity for induced representations and the conjugate-partition sign twist, the multiplicity of $V^{\lambda }$ in ${\tilde{M}}^{{\lambda }^{\prime }}$ is $a^{\prime }$. The character inner product already computed is the sum of products of multiplicities of common irreducible representations. ThusBoth are positive integers, so $a=a^{\prime }=1$. In particularThis deduction avoids assuming the full Young's rule, which would already contain the answer. Alternatively, the permitted one-dimensional R-module homomorphism space gives the same character inner product immediately.

Use integer coefficients. The mapping-torus homology from Mayer–Vietoris works for every continuous map $f:X\to X$, without assuming that the mapping torus is a fiber bundle. Project to the time circle and choose two open arcs, one containing the seam and one away from it. The inverse image $U$ of the seam arc is a mapping cylinder neighborhood with a deformation retraction to its target copy of $X$; the inverse image $V$ of the other arc is a product with a deformation retraction to $X$. Their intersection has two components, each with a deformation retraction to $X$. Label the upper component first. With the convention that the second inclusion in the Mayer–Vietoris sequence has a minus sign, its homology map isIndeed, the upper component includes into the seam neighborhood by the identity, while retracting the lower component across the seam applies $f$. Put $u=a+b$ and $v=b$, and replace target coordinates $(p,q)$ by $(p+q,-q)$. The map becomes $((f_{\ast }-\mathrm{id})v,u)$. Negating $v$ gives a direct sum of $\mathrm{id}-f_{\ast }$ and an isomorphism. Canceling the latter summands in the long exact sequence yieldsIn particular, there is a short exact sequenceNo splitting of this short exact sequence is assumed at this stage.

For the torus, take the coordinate loops $c_1(t)=[(t,0)]$ and $c_2(t)=[(0,t)]$ as the basis of $H_1$. Their lifts to ${\mathbb{R}}^2$ have endpoint displacements $e_1,e_2$. Applying $A$ changes those displacements to its columns, soThis also follows from the identification of the first homology group with the abelianization of the fundamental group. The Künneth theorem gives $H_2(X)=\mathbb{Z}$, with generator the product orientation class. If $\alpha ,\beta$ are the dual degree-one cohomology classes, then $\alpha ⌣\beta$ evaluates to one on this generator, andThus the degree-two homology map is multiplication by $\det A$, as in homology of an integer torus endomorphism. The claim that the torus map is a homeomorphism requires $A$ to be a unimodular matrix, equivalently an integer inverse or $\det A=\pm 1$; nonsingularity over $\mathbb{R}$ alone would only give a covering map of finite degree. The particular matrix here is unimodular.

For this matrix, $\det A=1$ andIts kernel is zero and its Smith normal form is $\mathrm{diag}(1,2)$, so its cokernel is $\mathbb{Z}/2$. The maps $\mathrm{id}-f_{\ast }$ on $H_0$ and $H_2$ are zero. Substituting into the short exact sequences, and splitting the degree-one extension because its quotient $\mathbb{Z}$ is free, gives

For the sphere homology calculation use singular homology, homotopy invariance of homology, and the reduced Mayer–Vietoris sequence, not cellular homology. For a point, its chain group for singular homology is $\mathbb{Z}$ in every nonnegative degree, and its boundary operator is multiplication by ${\sum }_{i=0}^q(-1{)}^i$, hence alternately zero and one in positive degrees. Its homology is therefore $\mathbb{Z}$ in degree zero and zero above. Singular chains of a disjoint union split into the summand chain complexes. Start with $S^0$, the disjoint union of two points: $H_0(S^0;\mathbb{Z})={\mathbb{Z}}^2$, all positive groups vanish, and ${\tilde{H}}_0(S^0;\mathbb{Z})=\mathbb{Z}$. For $n\ge 1$, remove the north and south poles to obtain an open cover $U,V$ of $S^n$. Each member is contractible, while $U\cap V$ has a deformation retraction to $S^{n-1}$, including the disconnected intersection when $n=1$. The reduced exact sequence therefore suppliesAlso $S^n$ is connected, so its reduced degree-zero group vanishes. Induction givesThe separate $S^0$ calculation avoids conflating its two degree-zero generators.

Choose an orientation of $S^n$, with $n\ge 1$, and let $[S^n]$ be its fundamental class. The mapping degree is the integer determined by $f_{\ast }[S^n]=\mathrm{deg}(f)[S^n]$. To define the local degree at $x_0$, set $y_0=f(x_0)$ and require $x_0$ to be isolated in $f^{-1}(y_0)$. Choose an open neighborhood $B$ containing no other point of that fiber. Then $f$ defines a map of pairsThe degree-$n$ relative homology groups on both sides are $\mathbb{Z}$, by a manifold chart and excision. The local orientation of a manifold chooses their generators. The induced map multiplies these generators by an integer, denoted ${\mathrm{deg}}_{x_0}f$. Excision and naturality show independence of the choice of $B$. Differentiability is unnecessary; if $f$ is smooth and $D{f}_{x_0}$ is invertible, the inverse function theorem gives ${\mathrm{deg}}_{x_0}f=\mathrm{sign}\det D{f}_{x_0}$ relative to the orientations. Without isolation in the fiber this pointwise definition need not apply.

For the degree as a sum of local degrees, assume $y\in S^n$ has finite fiber $F=\{x_1,\dots ,x_s\}$. Disjoint coordinate neighborhoods and excision identifyThe absolute fundamental class maps to the tuple of local orientation generators. Under the relative map induced by $f$, the $j$th generator goes to ${\mathrm{deg}}_{x_j}f$ times the generator at $y$, and the resulting map from the direct sum adds these contributions. On the other hand, naturality says that first applying the absolute map $f_{\ast }$ and then passing to the local group at $y$ gives $\mathrm{deg}(f)$ times that generator. ThusIf the fiber is empty the sum is zero: the map factors through the contractible punctured sphere and has degree zero. If every point of a fiber is isolated, compactness makes that closed fiber finite, so the theorem applies. In particular, a regular value of a smooth map gives the signed count of its inverse images. For $n=0$, define a mapping degree on the reduced generator $[p_{+}]-[p_{-}]$: the identity has mapping degree one, the swap of the two points minus one, and either constant map zero. With local orientation signs positive at $p_{+}$ and negative at $p_{-}$, the same sum formula holds. The connected-sphere convention above is the standard positive-dimensional one.

Use the usual convention that a three-term arithmetic progression must be nonconstant. There is a genuine small-case defect in the printed statement: for $n=1$, $\delta =1$, and $A=\{1\}$, neither conclusion can hold with $c_2>0$. We prove the intended Roth density-increment step for every odd integer $n\ge 3$, including the small values of $n$, rather than silently treating $n=1$ as covered. Counting constant arithmetic progressions would make the first alternative vacuous for every nonempty $A$.

Suppose that $A$ has no nonconstant three-term arithmetic progression, and let $\alpha =|A|/n$ be its actual density of a finite subset. Thus $0<\delta \le \alpha \le 1$. Put $I=[n]$, $N=2n+1$, and embed $I$ in the cyclic group $G=\mathbb{Z}/N\mathbb{Z}$. A congruence $x-2y+z=0(\mathrm{mod}N)$ with $x,y,z\in I$ is an equality over the integers, since $|x-2y+z|\le 2(n-1)<N$. Thus this embedding creates no extra three-term arithmetic progressions. Since $N$ is odd, multiplication by two permutes $G$.

Use normalized Fourier analysis on a finite abelian group, with $e_N(t)=\exp (2\pi it/N)$ and $\hat{h}(r)={\mathbb{E}}_{x\in G}h(x)e_N(-rx)$. For the normalized trilinear arithmetic progression count, character orthogonality givesIndeed, expanding each function in its inverse Fourier transform, averaging in $d$ forces $r_2+2r_3=0$, and averaging in $x$ then forces $r_1=r_3$. The Parseval identity in this normalization is ${\sum }_r|\hat{h}(r){|}^2={\mathbb{E}}_x|h(x){|}^2$.

Let $a=1_A$, $b=\alpha 1_I$, and $f=a-b$, the balanced indicator function of a finite subset. Then $\hat{f}(0)=0$. Only constant arithmetic progressions contribute to $\Lambda (a,a,a)$, whereas summing $2\min (y-1,n-y)+1$ over centers $y\in I$ counts $(n^2+1)/2$ ordered three-term arithmetic progressions in $I$. HenceSet $M={\max }_r|\hat{f}(r)|$. Telescope by changing one factor at a time:In the Fourier transform formula for each term, bound the Fourier coefficient of $f$ by $M$ and apply the Cauchy-Schwarz inequality to the other two factors. The permutation $r\mapsto -2r$ preserves the required squared sums. Since $\Vert a{\Vert }_2^2=\alpha n/N$ and $\Vert b{\Vert }_2^2={\alpha }^{2}n/N$, this givesIf $n\ge 4{\delta }^{-2}$, then ${\alpha }^{2}n\ge 4$, so the difference in the other direction is at least ${\alpha }^3{n}^2/(4N^2)$. Consequently Fourier detection of a progression-free subset of an interval gives a nonzero frequency $r$ with

To turn this into a density increment, take $Q=\lfloor \sqrt{n}\rfloor$. The Dirichlet approximation theorem, proved here by placing $0,r/N,\dots ,Qr/N$ into $Q$ equal intervals modulo one, gives $1\le q\le Q$ such that $\Vert qr/N{\Vert }_{\mathbb{R}/\mathbb{Z}}\le 1/Q$. DefineFor $n\ge N_0(\delta )$, the inequalities $Q\ge \sqrt{n}/2$ and ${\delta }^{2}Q/(288\pi )\ge 2$ show thatUse a progression partition with nearly constant linear phase: every residue chain of $I$ modulo $q$ has at least $\lfloor n/q\rfloor \ge Q$ points. Split each chain into blocks of $L$ consecutive chain points, merging any remainder into its last full block. This partitions $I$ into arithmetic progressions $P$ with $L\le |P|<2L$ and common difference $q$.

On a block $P$ with first point $z_P$, the linear phase $\chi (x)=e_N(-rx)$ satisfiesLet $S_P={\sum }_{x\in P}f(x)=|A\cap P|-\alpha |P|$. Freezing the linear phase on each block introduces error at most $({\delta }^2/72)N^{-1}{\sum }_{x\in I}|f(x)|\le {\delta }^2/72$. ThereforeThe block sums total zero. Their positive part consequently totals at least $N{\delta }^2/144$. Since all block lengths total $n$, some block has $S_P/|P|\ge N{\delta }^2/(144n)\ge {\delta }^2/72$. Its density of a finite subset is at least $\alpha +{\delta }^2/72\ge \delta (1+\delta /72)$.

For the remaining $3\le n<N_0(\delta )$, divide $I$ into disjoint consecutive triples and a remainder of at most two points. A three-term-arithmetic progression-free $A$ uses at most two points of each triple, so $\alpha \le 4/5$; the largest ratio occurs at $n=5$. Any singleton set from $A$ then has density of a finite subset one, which is at least $\delta +{\delta }^2/72$. We may therefore use the explicit constantsIn the large case the constructed arithmetic progression has length at least $c_1\sqrt{n}$; in the small case its length one does too. Thus these constants prove the intended result for all odd integers $n\ge 3$.

Write $d(U,V)=e(U,V)/(|U||V|)$ for the edge density of a bipartite graph between nonempty disjoint vertex sets. A regular pair of vertex sets $(U,V)$ is $\epsilon$-regular if $|d(U^{\prime },V^{\prime })-d(U,V)|\le \epsilon$ whenever $U^{\prime }\subseteq U$, $V^{\prime }\subseteq V$, $|U^{\prime }|\ge \epsilon |U|$, and $|V^{\prime }|\ge \epsilon |V|$.

The Szemerédi regularity lemma says that for every $\epsilon >0$ and positive integer $m_0$ there is $M=M(\epsilon ,m_0)$ such that every finite simple graph on $N\ge m_0$ vertices has a set partitionwhere $V_1,\dots ,V_k$ have equal positive size and at most $\epsilon k^2$ unordered pairs $(V_i,V_j)$, $i<j$, fail to be regular pairs of vertex sets. The version requiring only sufficiently large $N$ is equivalent, since the finitely many smaller admissible sizes can use singleton sets as classes. It suffices to prove this for $0<\epsilon \le 1/2$: reducing a larger parameter to $1/2$ gives stronger conclusions.

Here is a complete energy proof, including restoration of equal class sizes. For a set partition with exceptional set $V_0$, use the following version of equitable regularity energy, omitting pairs incident with $V_0$:For $i=j$, define $d(V_i,V_i)$ using the ordered adjacency indicator function, with diagonal entries zero. Thus the same formula works on every rectangle. The refinement variance identity for regularity energy iswhere $A,B$ run over the refined cells. Expanding the square proves the identity because their weighted mean edge density of a bipartite graph is $d(U,V)$. In particular, refinement never decreases the energy. If a union of refined cells $U^{\prime }\times V^{\prime }$ has discrepancy greater than $\epsilon$, the Cauchy-Schwarz inequality bounds its contribution below by $|U^{\prime }||V^{\prime }|{\epsilon }^2/N^2$. For an irregular equal-class pair of size $L$, witnesses have sizes at least $\epsilon L$, so the increase exceeds ${\epsilon }^4{L}^2/N^2$ in each orientation.

Choose $k_0\ge \max \{m_0,2\}$ so large that $2^{-k_0}\le {\epsilon }^6/100$. Initially partition into $k_0$ equal classes and fewer than $k_0$ exceptional vertices. For sufficiently large $N$ this exceptional set has size at most $\epsilon N/2$. Suppose there are more than $\epsilon k^2$ irregular unordered pairs at a subsequent step, with equal class size $L$. Choose one witnessing pair of subsets for every such pair. Split each class according to membership in all its witness subsets; each class produces at most $2^k$ atoms. The preceding refinement variance identity for regularity energy shows that the energy increase exceedsas long as the exceptional set has size at most $\epsilon N\le N/2$.

Apply equalization with a controlled exceptional set. Set $\ell =\lfloor L/4^k\rfloor$, cut every atom into blocks of size $\ell$, and send its leftover points to $V_0$. Provided $L\ge 2\cdot 4^k$, the new number $k^{\prime }$ of classes satisfiesThe lower bound holds because every old class retains at least one full block: its leftovers total less than $2^k\ell <L$. The discarded fraction is at mostCutting blocks is a further refinement before discarding. Discarding changes only ordered pairs with at least one discarded vertex, so it loses at most $2r$ in the energy. The net increase is therefore at least ${\epsilon }^5/2-2{\epsilon }^6/100\ge {\epsilon }^5/4$.

There can be fewer than $T=\lceil 4{\epsilon }^{-5}\rceil$ such strict energy increases, because the energy stays in $[0,1]$. Through $T$ steps the exceptional fraction is at mostThis also verifies the exceptional-set bound used at every preceding step. Iterating the finite recursion $k\mapsto 2k{4}^k$ at most $T$ times bounds all class counts by some $K=K(\epsilon ,m_0)$. Choosing $N$ sufficiently large in terms of $K$, for instance with $N\ge 4K{4}^K$ and $N\ge 2k_0/\epsilon$, guarantees $L=(N-|V_0|)/k\ge N/(2K)\ge 2\cdot 4^k$ throughout. Thus the process terminates with the desired regular pairs of vertex sets. Choose a finite integer threshold $N_{\ast }$ for these requirements and set $M\ge \max \{K,N_{\ast }\}$. For $m_0\le N<N_{\ast }$, use $N$ singleton sets; every pair is regular because its only admissible nonempty subsets are the whole pair. This completes the Szemerédi regularity lemma for all admissible $N$.

For the half graph, a class of size $s$ has exactly $\lceil s/10\rceil$ elements with fewer than $s/10$ predecessors, and the same number with fewer than $s/10$ successors. Thus its boundary contains at most $2\lceil s/10\rceil$ elements. Let $k_X,k_Y$ be the numbers of classes. The boundary rank obstruction in a half graph gives the union boundbecause $k_X,k_Y\le n/100$. There is therefore an index $m$ away from both boundaries. In its classes $X_i,Y_j$, all four subsets $X^{-}=\{x<m\}$, $X^{+}=\{x>m\}$, $Y^{-}=\{y<m\}$, $Y^{+}=\{y>m\}$ have at least one tenth of their respective class sizes. These subsets are taken within $X_i,Y_j$, which need not be intervals.

In the half graph, $d(X^{-},Y^{+})=1$ and $d(X^{+},Y^{-})=0$. If $(X_i,Y_j)$ were a $1/10$-regular pair of vertex sets, both values would be within $1/10$ of $d(X_i,Y_j)$, implying $1\le 2/10$, a contradiction. At least one class pair is not $1/10$-regular.

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.