Random Sperner Lemma Overview

• Random Sperner Lemma is an extension of classical topological combinatorics to random Euclidean spaces using L⁰-modules and σ-stable labeling functions.
• It guarantees a fully labeled random subsimplex through measurable concatenation of deterministic simplicial subdivisions.
• The lemma underpins a proof of the random Brouwer fixed point theorem by unifying various random fixed-point frameworks.

Searching arXiv for the cited papers and closely related work to ground the article. Searching for the primary paper on the random Sperner lemma. Random Sperner lemma is the extension of the classical Sperner lemma from finite simplicial subdivisions to the setting of random Euclidean spaces and $L^0(\mathcal F)$-modules. In the formulation established in "Random Sperner lemma and random Brouwer fixed point theorem" (Tu et al., 11 Jul 2025), the objects of classical combinatorial topology are replaced by $L^0$-simplexes, $L^0$-simplicial subdivisions, and $\sigma$-stable labeling functions with values in $L^0(\mathcal F;\{0,1,\dots,n\})$. The central conclusion is the existence of a fully labeled random subsimplex obtained by finite measurable concatenation. This provides the combinatorial mechanism for a complete proof of the random Brouwer fixed point theorem in random Euclidean spaces and unifies several earlier random fixed-point frameworks (Tu et al., 11 Jul 2025).

1. Probabilistic and $L^0$-module framework

The ambient setting is a complete probability space $(\Omega,\mathcal F,\mathbb P)$, with random variables understood modulo almost sure equality. The algebra of real-valued random variables is denoted $L^0(\mathcal F)$. For $n\in\mathbb N$, the random Euclidean space $L^0(\mathcal F;\mathbb R^n)$ is the free $L^0$0-module of rank $L^0$1, consisting of equivalence classes of $L^0$2-valued random vectors (Tu et al., 11 Jul 2025).

Two topologies are used. The $L^0$3-topology $L^0$4 is convergence in probability and is a metrizable linear topology. The locally $L^0$5-convex topology $L^0$6 is generated by random open balls

$L^0$7

Both topologies make $L^0$8 a topological $L^0$9-module.

The stability structure is essential. A subset $L^0$0 is $L^0$1-stable if, for any sequence $L^0$2 and any countable partition $L^0$3 of $L^0$4, the countable concatenation $L^0$5 belongs to $L^0$6. A mapping $L^0$7 on $L^0$8-stable sets is $L^0$9-stable if

$\sigma$0

for every such sequence and partition. The same framework uses $\sigma$1-convexity: $\sigma$2 is $\sigma$3-convex if, for $\sigma$4 and $\sigma$5 with $\sigma$6, one has $\sigma$7.

The module $\sigma$8 carries the $\sigma$9-norm

$L^0(\mathcal F;\{0,1,\dots,n\})$0

so it is also an RN module. The measure algebra $L^0(\mathcal F;\{0,1,\dots,n\})$1, the Boolean algebra of measurable sets modulo null sets, provides the eventwise bookkeeping for measurable concatenations. For $L^0(\mathcal F;\{0,1,\dots,n\})$2, $L^0(\mathcal F;\{0,1,\dots,n\})$3 denotes the equivalence class of the indicator of any representative set of $L^0(\mathcal F;\{0,1,\dots,n\})$4, and partitions in $L^0(\mathcal F;\{0,1,\dots,n\})$5 are written $L^0(\mathcal F;\{0,1,\dots,n\})$6.

2. $L^0(\mathcal F;\{0,1,\dots,n\})$7-simplexes and random simplicial subdivisions

Let $L^0(\mathcal F;\{0,1,\dots,n\})$8 be an $L^0(\mathcal F;\{0,1,\dots,n\})$9-module. A finite set $L^0$0 is $L^0$1-affinely independent if either $L^0$2 or $L^0$3 is $L^0$4-linearly independent. The associated $L^0$5-simplex is

$L^0$6

In $L^0$7, each $L^0$8 admits a unique $L^0$9-barycentric coordinate vector $(\Omega,\mathcal F,\mathbb P)$0 with $(\Omega,\mathcal F,\mathbb P)$1, $(\Omega,\mathcal F,\mathbb P)$2, and $(\Omega,\mathcal F,\mathbb P)$3 (Tu et al., 11 Jul 2025).

A decisive structural feature is the deterministic counterpart simplex

$(\Omega,\mathcal F,\mathbb P)$4

viewed in the underlying real vector space. Since $(\Omega,\mathcal F,\mathbb P)$5-affine independence implies classical affine independence, the paper uses $(\Omega,\mathcal F,\mathbb P)$6 to import classical combinatorics into the random setting. In particular,

$(\Omega,\mathcal F,\mathbb P)$7

Thus the random extreme points are countable concatenations of deterministic extreme points.

An $(\Omega,\mathcal F,\mathbb P)$8-simplicial subdivision of $(\Omega,\mathcal F,\mathbb P)$9 is a finite family $L^0(\mathcal F)$0 of $L^0(\mathcal F)$1-vertex $L^0(\mathcal F)$2-simplexes satisfying three conditions: $L^0(\mathcal F)$3; any two members intersect either trivially or in a common $L^0(\mathcal F)$4-face; and the counterpart family $L^0(\mathcal F)$5 is a classical simplicial subdivision of $L^0(\mathcal F)$6. This third condition is the formal bridge between random and classical geometry. The theory does not require fiberwise triangulations $L^0(\mathcal F)$7 in $L^0(\mathcal F)$8; instead, it proceeds through deterministic counterpart subdivisions and $L^0(\mathcal F)$9-stable concatenation, thereby avoiding delicate measurability issues (Tu et al., 11 Jul 2025).

A useful closure property under concatenation is explicit. If $n\in\mathbb N$0 is a sequence of $n\in\mathbb N$1-simplexes in $n\in\mathbb N$2 and $n\in\mathbb N$3, then

$n\in\mathbb N$4

is again an $n\in\mathbb N$5-simplex with vertices $n\in\mathbb N$6, $n\in\mathbb N$7, and is contained in $n\in\mathbb N$8.

3. Proper $n\in\mathbb N$9-labelings and the representation theorem

Let $L^0(\mathcal F;\mathbb R^n)$0 be an $L^0(\mathcal F;\mathbb R^n)$1-simplicial subdivision of

$L^0(\mathcal F;\mathbb R^n)$2

A labeling function is a $L^0(\mathcal F;\mathbb R^n)$3-stable mapping

$L^0(\mathcal F;\mathbb R^n)$4

It is proper if, for every $L^0(\mathcal F;\mathbb R^n)$5 and every $L^0(\mathcal F;\mathbb R^n)$6, writing $L^0(\mathcal F;\mathbb R^n)$7,

$L^0(\mathcal F;\mathbb R^n)$8

Equivalently, almost surely on the event $L^0(\mathcal F;\mathbb R^n)$9, one has $L^0$00. This is the random analogue of the classical Sperner boundary condition: a vertex may receive only a label corresponding to a vertex spanning the face that contains it (Tu et al., 11 Jul 2025).

An $L^0$01-simplex $L^0$02 is completely labeled by $L^0$03 if

$L^0$04

Thus every label appears somewhere among the vertices with probability one.

The key structural result is the representation theorem for proper $L^0$05-labelings. If $L^0$06, then at deterministic extreme points the random label $L^0$07 assigns values only from the deterministic face-index set

$L^0$08

where $L^0$09 with $L^0$10, $L^0$11. More precisely, $L^0$12, where $L^0$13 is the set of indices with positive mass in the random label $L^0$14.

The theorem then states that proper classical labeling functions $L^0$15 can be chosen so that the random label decomposes pointwise at deterministic extreme points, and globally there exist finitely many proper classical labeling functions $L^0$16 on the deterministic subdivision $L^0$17 together with a finite partition $L^0$18 such that, for every random extreme point

$L^0$19

with $L^0$20,

$L^0$21

This decomposition is the essential bridge from random proper labelings to finitely many deterministic proper labelings on $L^0$22 (Tu et al., 11 Jul 2025). A plausible implication is that the randomization is not carried by a pointwise random triangulation, but by measurable assembly of finitely many deterministic combinatorial patterns.

4. Statement and proof architecture of the random Sperner lemma

The random Sperner lemma asserts that if $L^0$23 is an $L^0$24-vertex $L^0$25-simplex in an $L^0$26-module $L^0$27, $L^0$28 is an $L^0$29-simplicial subdivision of $L^0$30, and $L^0$31 is a proper $L^0$32-labeling of $L^0$33, then there exist finitely many $L^0$34-vertex $L^0$35-simplexes

$L^0$36

and a finite partition $L^0$37 such that the concatenated $L^0$38-simplex

$L^0$39

is completely labeled by $L^0$40 and satisfies, for every $L^0$41,

$L^0$42

Equivalently,

$L^0$43

is a fully labeled random subsimplex of $L^0$44 (Tu et al., 11 Jul 2025).

The proof has three steps. First, the representation theorem expresses $L^0$45 as a finite concatenation of classical proper labeling functions $L^0$46 on the deterministic subdivision $L^0$47. Second, classical Sperner is applied to each $L^0$48, producing a completely labeled simplex $L^0$49. Third, these deterministic simplexes are lifted back to $L^0$50-simplexes in $L^0$51 and concatenated along the partition $L^0$52. The $L^0$53-stability of the construction guarantees that the result is again an $L^0$54-simplex and that the label identities are preserved.

The lemma is therefore neither a fiberwise application of classical Sperner at each $L^0$55 nor a purely abstract existence argument. The combinatorics is entirely housed in the deterministic counterpart subdivision $L^0$56, while randomness enters through measurable partitions in $L^0$57 and the concatenation machinery. The paper emphasizes that classical parity, such as oddness of the number of fully labeled simplexes, is not required for the random conclusion; only existence is assembled measurably (Tu et al., 11 Jul 2025).

5. Application to the random Brouwer fixed point theorem

The principal application is a fixed-point theorem on $L^0$58-simplexes. Let

$L^0$59

be an $L^0$60-simplex in an RN module $L^0$61, and let $L^0$62 be $L^0$63-stable and random sequentially continuous, equivalently $L^0$64-continuous on $L^0$65-stable sets. Then $L^0$66 has a fixed point (Tu et al., 11 Jul 2025).

The labeling used in the proof is Sperner-style. For

$L^0$67

one chooses $L^0$68 to be any index $L^0$69 with $L^0$70 and $L^0$71. The paper states that such an $L^0$72 exists almost surely, with the proof relying on measure-algebra arguments. This produces a $L^0$73-stable proper labeling on any $L^0$74-simplicial subdivision of $L^0$75. Applying the random Sperner lemma to successive $L^0$76-barycentric subdivisions $L^0$77 yields completely labeled $L^0$78-simplexes $L^0$79 whose diameters satisfy

$L^0$80

Using random sequential compactness of $L^0$81 together with random sequential continuity of $L^0$82, one extracts a convergent random subsequence $L^0$83 and $L^0$84. The labeling inequalities force equality of all barycentric coordinates, $L^0$85, hence $L^0$86.

The general random Brouwer theorem extends this from simplexes to random convex sets in $L^0$87. If $L^0$88 is $L^0$89-stable, almost surely bounded, $L^0$90-convex, and $L^0$91-closed, and $L^0$92 is $L^0$93-stable and $L^0$94-continuous, then $L^0$95 has a fixed point. The reduction chooses an $L^0$96-simplex $L^0$97 containing $L^0$98, uses the nonexpansive, $L^0$99-stable random projection $L^0$00 onto $L^0$01, defines $L^0$02, and sets $L^0$03. A fixed point $L^0$04 of $L^0$05 lies in $L^0$06 and satisfies $L^0$07 (Tu et al., 11 Jul 2025).

The same work also proves an equivalence with a random Borsuk-type statement: the random Brouwer fixed point theorem is equivalent to the nonexistence of a $L^0$08-stable $L^0$09-retraction from the random closed unit ball $L^0$10 onto the random unit sphere $L^0$11.

6. Unification, example, and distinction from other “random Sperner” results

One of the stated aims is unification. The paper proves equivalence among the $L^0$12 formulation above, the $L^0$13 version for $L^0$14-stable and $L^0$15-continuous maps on almost surely bounded, $L^0$16-closed, $L^0$17-convex sets, and Ponosov’s stochastic formulation for local, continuous-in-probability operators on measurable selection sets $L^0$18 represented by Carathéodory functions (Tu et al., 11 Jul 2025). It also clarifies that a $L^0$19-continuous $L^0$20-stable map is automatically almost surely sequentially continuous. This suggests that the random Sperner lemma functions as a common combinatorial core behind several apparently different random fixed-point theories.

A concrete two-dimensional illustration uses

$L^0$21

and the midpoints

$L^0$22

The subdivision $L^0$23 consists of the four $L^0$24-triangles

$L^0$25

The paper shows that this satisfies the definition of $L^0$26-simplicial subdivision. For any proper $L^0$27-labeling $L^0$28, the random Sperner lemma yields a finite partition $L^0$29 and random $L^0$30-triangles $L^0$31 from $L^0$32 such that $L^0$33 is completely labeled (Tu et al., 11 Jul 2025).

The expression “random Sperner” also appears in a different literature concerning Sperner’s theorem on antichains in the Boolean lattice. That direction studies random induced subposets of $L^0$34 and asks when the largest antichain is given by a middle layer intersection. In particular, "A sharp threshold for a random version of Sperner's Theorem" identifies a sharp threshold at $L^0$35 for that combinatorial property (Balogh et al., 2022). This is unrelated to the topological Sperner lemma on triangulations. The distinction is substantive: the $L^0$36-module theory concerns random labelings on random simplexes and leads to random Brouwer and Borsuk results, whereas the Boolean-lattice theory concerns widths of random posets and antichain structure (Balogh et al., 2022).

The main subtleties relative to classical Sperner are therefore threefold. First, labels are random variables in $L^0$37, so properness is eventwise: $L^0$38 Second, measurable existence of a fully labeled subsimplex relies on $L^0$39-stability and concatenation over partitions in $L^0$40, not on fiberwise triangulations. Third, the actual simplicial combinatorics remains deterministic at the level of the counterpart subdivision $L^0$41, while the random object is assembled from finitely many deterministic labeled simplexes by measurable concatenation (Tu et al., 11 Jul 2025).