Borel Toasts in Descriptive Combinatorics

• Borel Toasts are hierarchical decompositions used to partition standard Borel and Polish G-spaces into finite or compact orbit pieces in a coherent structure.
• They employ methods like weakly orthogonal decomposition and marker-region constructions to create nested tilings that control graph components and separations.
• The construction of Borel Toasts underpins applications in chromatic bounds, perfect matchings, equidecomposition, and equivariant liftings across various mathematical settings.

Searching arXiv for the cited papers to ground the article in current records. Borel toasts are hierarchical decompositions used in Borel combinatorics to organize a standard Borel or Polish $G$-space into larger and larger finite or compact orbit pieces in a coherent way. In graph-theoretic terms, a toast is “a way of carving $X$ into larger and larger finite ‘tiles’”; in low-complexity constructions it is a filtration by “thick finite pieces” that exhaust $X$ and are well separated at each stage; and in the general group-action setting it functions as a Borel analogue of Rokhlin towers from ergodic theory (Gao et al., 2024, Unger et al., 26 Jan 2026, Slutsky et al., 16 Jul 2025). The notion is therefore best understood as a family of closely related formalisms rather than a single canonical definition.

1. Formal definitions and principal variants

Three versions of toast appear prominently in recent work.

Setting	Toast object	Core conditions
Borel graph $\Gamma$ on $X$	Sequence $T_1,T_2,\dots$ of finite-class subequivalences of $E_\Gamma$	Covering, nesting, eventual internal growth
Schreier graph $G$ with parameter $q$	Sequence of Borel sets $T_0,T_1,\dots\subseteq X$	Exhaustion, bounded $X$0-components, boundary separation by $X$1
Free Borel action $X$2	Sequence $X$3 with $X$4	Disjointness, coherence, layeredness, directedness, lacunarity, exhaustivity, rationality

For a Borel graph $X$5 on $X$6, with connected-component equivalence relation $X$7 and graph metric $X$8, an unlayered Borel toast is a sequence of Borel equivalence relations

$X$9

such that each $X$0 is a finite-class subequivalence of $X$1, $X$2, lower-level classes nest inside higher-level classes whenever they intersect, and every $X$3-class $X$4 is eventually contained strictly inside a larger $X$5-class $X$6, in the sense that

$X$7

A layered toast imposes the same conditions but requires that the witnessing class $X$8 can always be taken at the next level $X$9 (Gao et al., 2024).

In the low-complexity setting of free continuous $\Gamma$0-actions, a $\Gamma$1-toast is a sequence of Borel sets

$\Gamma$2

such that $\Gamma$3; for each $\Gamma$4, every connected component of $\Gamma$5 has diameter bounded by some constant $\Gamma$6; and whenever $\Gamma$7,

$\Gamma$8

where

$\Gamma$9

This definition is explicitly presented as a variant: other formulations may require connected pieces or different separation conditions, but this form suffices for the intended applications (Unger et al., 26 Jan 2026).

For a free Borel action of a locally compact Polish group $X$0 on a standard Borel space $X$1, a Borel toast is a sequence $X$2, where each $X$3 is Borel and $X$4 is Borel. Writing

$X$5

the axioms are: disjointness of same-level regions, coherence between levels, layeredness, directedness, lacunarity, exhaustivity, and rationality. The rationality condition requires each $X$6 to be countable and the relevant cocycle values between orbit-equivalent centers to form a countable set (Slutsky et al., 16 Jul 2025).

2. Weakly orthogonal decompositions and the production of toast

A central mechanism for constructing toast is the weakly orthogonal decomposition. In the graph-theoretic framework, one builds a descending sequence of Borel “boundary layers”

$X$7

such that each tail

$X$8

cuts $X$9 into only finite $T_1,T_2,\dots$0-components, and such that an orthogonality condition controls how these finite regions interact with later boundary layers. Specifically, whenever a $T_1,T_2,\dots$1-component $T_1,T_2,\dots$2 of $T_1,T_2,\dots$3 lies within a fixed finite distance of some $T_1,T_2,\dots$4 with $T_1,T_2,\dots$5, that distance is forced to be exactly $T_1,T_2,\dots$6 (Gao et al., 2024).

The quantitative form of the method uses a polygonal bound $T_1,T_2,\dots$7 and an orthogonality constant $T_1,T_2,\dots$8. If $T_1,T_2,\dots$9 is such a decomposition, then for every $E_\Gamma$0 satisfying

$E_\Gamma$1

there is a Borel partition $E_\Gamma$2 such that both thickenings

$E_\Gamma$3

have only finite components. An elementary back-and-forth argument then converts this finite-component structure into a Borel unlayered toast $E_\Gamma$4. The underlying intuition is that one alternately peels off boundary layers and then verifies that every tile is eventually absorbed, with a boundary gap, into a strictly larger tile (Gao et al., 2024).

This passage from weak orthogonality to toast is significant because it separates geometric control from combinatorial output. The decomposition itself is a marker-region construction, while toast is the nested finite tiling structure needed for downstream applications.

3. Free $E_\Gamma$5-actions and chromatic consequences

For $E_\Gamma$6, every free Borel $E_\Gamma$7-action admits a Borel unlayered toast. Applied to the Schreier graph $E_\Gamma$8 of such an action, this yields the general upper bound

$E_\Gamma$9

The proof proceeds by showing first that the existence of a Borel unlayered toast implies the same inequality through a Conley–Miller argument: one splits $G$0 into two large pieces along the toast, uses a $G$1-coloring on each piece, and shifts colors by $G$2 on the second piece (Gao et al., 2024).

In the case of the free part $G$3 of the Bernoulli shift, the construction uses a standard weakly orthogonal decomposition with polygonal bound $G$4 and orthogonality constant $G$5. Choosing $G$6 makes the inequality $G$7 available, so the toast corollary applies. Since

$G$8

because each orbit carries a bipartite copy of the $G$9-Cayley graph, one obtains

$q$0

As a consequence, the Borel chromatic number of $q$1 is $q$2 for all $q$3 (Gao et al., 2024).

A common misconception is that toast is merely an auxiliary partition device. In this setting it is the combinatorial structure that bridges orbit geometry and Borel coloring bounds. The chromatic inequality is not stated as a formal property of arbitrary Borel graphs, but rather for graphs admitting the requisite weakly orthogonal decomposition under mild additional assumptions.

4. Two-dimensional regularity, disk atoms, perfect matchings, and linings

In dimension $q$4, the marker-region construction can be refined so that the atoms of the orthogonal decomposition have strong topological regularity. The key statement is that boundaries built from rectangles can be adjusted by small translations so that every final-stage region is simply connected, has connected circular boundary, and keeps each refinement corner well separated. Passing from the intermediate marked partitions $q$5 to the true orthogonal decomposition $q$6, where $q$7 is the common refinement of all $q$8-layers with $q$9, one proves inductively that each $T_0,T_1,\dots\subseteq X$0-atom is a finite rectangular polygon homeomorphic to a disk (Gao et al., 2024).

The consequence is stronger than regularity of the intermediate pieces: all $T_0,T_1,\dots\subseteq X$1-toast tiles, namely the components of

$T_0,T_1,\dots\subseteq X$2

are disks, even when the refinement process is highly intricate. This disk structure is then exploited combinatorially.

Once one has a Borel binary toast, a uniform toast-slicing argument yields a Borel perfect matching on $T_0,T_1,\dots\subseteq X$3 for all $T_0,T_1,\dots\subseteq X$4. In the two-dimensional case, the disk tiles can be straightened into long simple paths that wind through the smaller tiles and cover all vertices exactly once, producing a Borel Hamiltonian path in each orbit, referred to as a “lining.” The resulting theorem is that there is a Borel lining of $T_0,T_1,\dots\subseteq X$5 (Gao et al., 2024).

These corollaries show that toast is not limited to coloring theory. In dimension $T_0,T_1,\dots\subseteq X$6, the added topological control of the tiles directly feeds into the construction of orbitwise global structures.

5. Low-complexity $T_0,T_1,\dots\subseteq X$7-toasts and $T_0,T_1,\dots\subseteq X$8 equidecomposition

In the torus-action setting, low-complexity toast is designed to interact with the Borel hierarchy. For a free translation action $T_0,T_1,\dots\subseteq X$9 with Schreier graph $X$00, and for every $X$01, there exists a $X$02-toast

$X$03

such that each layer $X$04 is a $X$05 subset of $X$06, that is, simultaneously $X$07 and $X$08. More systematically, if one starts from a bounded-geometry decomposition by open sets, then the resulting toast layers lie in the algebra generated by finite Boolean combinations of open sets and translates, closed under countable unions and complements, and in this setting the output is again $X$09 (Unger et al., 26 Jan 2026).

The construction begins from clopen witnesses to asymptotic dimension $X$10, from which one builds a rainbow toast and then a bounded-geometry decomposition $X$11 by open sets. One assumes:

1. $X$12;
2. each component of $X$13 is finite of diameter $X$14;
3. any such component meets at most $X$15 of the layers $X$16 within graph-distance $X$17.

Choosing $X$18 so that

$X$19

one defines, for each $X$20,

$X$21

then assigns to each $X$22 a minimal stage $X$23 and an amplitude $X$24, restricts to maximal components $X$25, and for a maximal $X$26 enumerates

$X$27

as $X$28. The inner core is

$X$29

and the toast layer is

$X$30

Elementary metric-graph estimates show that $X$31 is a $X$32-toast and that each $X$33 is determined by the local pattern of the open layers and their tails (Unger et al., 26 Jan 2026).

The primary application is $X$34 circle squaring. The toast layers are used to round a bounded real-valued flow $X$35, obtained as the limit of approximate rational flows $X$36, into an integral bounded flow $X$37 satisfying

$X$38

on the Schreier graph. On each finite piece of $X$39, the Integral-Flow Theorem adjusts the flow by at most $X$40 to make boundary values integral, and the separation bounds ensure boundedness and Borel definability of the rounding. Since the layers are $X$41 and $X$42 are closed, every piece in the resulting equidecomposition is $X$43. In particular, a closed disk and a same-area square in $X$44 are translation-equidecomposable using $X$45 pieces. The same machinery extends to bounded sets $X$46 with $X$47 and $X$48 (Unger et al., 26 Jan 2026).

6. Equivariant liftings in complex analysis and PDE

In a more general locally compact group setting, Borel toast is one of the two main ingredients—alongside Runge-type approximation—in the construction of equivariant Borel liftings. For $X$49 or $X$50, every free Borel $X$51-action admits a Borel $X$52-toast, where $X$53 is the class of compact subsets diffeomorphic to the $X$54-ball, or products of such sets with $X$55 in the torus-factor case (Slutsky et al., 16 Jul 2025).

The core uniformization lemma fixes a Borel toast $X$56 and then inductively defines Borel partial sections

$X$57

with approximation error $X$58 in a chosen pseudometric. The toast axioms imply that each center has only finitely many predecessors relevant to the next step, which is crucial for Borel selection. These local choices are patched into genuine Borel functions

$X$59

where $X$60 is the unique toast center whose region contains $X$61. The sequence $X$62 is shown to be Cauchy in the equivariant pseudometrics, and completeness then gives a Borel fully equivariant limit $X$63 (Slutsky et al., 16 Jul 2025).

The general lifting theorem requires: an equivariant Borel surjection $X$64; an auxiliary group $X$65 whose orbits coincide with the fibers of $X$66; a compatible semidirect-product action of $X$67 on $X$68; a $X$69-invariant cofinal family $X$70 of compact sets; a $X$71-family of seminorms satisfying the $X$72-Runge approximation property; and a Borel $X$73-toast for the free action $X$74. Under these hypotheses, any Borel equivariant map $X$75 lifts to a Borel equivariant $X$76 with $X$77. This framework yields equivariant Borel right inverses on the free part for the divisor map of entire functions, the principal-part map, the distributional Laplacian, the $X$78-operator on smooth functions, and—after removal of a null set with respect to any invariant probability measure—the heat operator (Slutsky et al., 16 Jul 2025).

In this setting, toast serves as the orbitwise bookkeeping device that replaces measure-theoretic tower arguments by exact Borel nesting of compact tiles.

7. Limitations, nonexistence phenomena, and open problems

The recent literature also clarifies what toast does not provide automatically. In the equivariant-lifting framework, the free-action hypothesis is essential: on periodic strata of the range, where orbits are not free, no Borel equivariant inverses exist. Even on the free part, Borel liftings generally cannot be improved to continuous ones; this failure is proved for both the divisor map and the $X$79-operator (Slutsky et al., 16 Jul 2025).

A related point is that the existence of a Borel toast is itself a strong descriptive-set-theoretic hypothesis. It holds for all free Borel $X$80-actions and $X$81-actions, and in the low-complexity setting it can be driven down to $X$82 layers for free translation actions of $X$83 on $X$84. A plausible implication is that toast theory is as much about definability as about orbit geometry (Slutsky et al., 16 Jul 2025, Unger et al., 26 Jan 2026).

The current open problem singled out in the low-complexity theory is whether one can construct a $X$85-toast for a free $X$86-action on a zero-dimensional Polish space with closed layers. Even this minimal nontrivial separation by distance $X$87 remains open, and the problem is stated to have implications for finer Wadge-theoretic and difference-hierarchy analyses of Borel-combinatorial constructions (Unger et al., 26 Jan 2026).

Taken together, these results place Borel toast at the intersection of descriptive set theory, geometric group actions, measurable combinatorics, and effective topological complexity. Its role is not merely organizational: the exact form of the toast—layered or unlayered, graph-theoretic or group-theoretic, arbitrary Borel or $X$88—determines which downstream constructions can be carried out and at what definability cost.