arxiv: 2604.05554 · v1 · submitted 2026-04-07 · 🧮 math.GN · math.LO

Recognition: 2 theorem links

· Lean Theorem

Topology, forcing, and graph colourings

Dan Turetsky, Dominique Lecomte (IMJ-PRG (UMR\_7586)), Miroslav Zelen, Noam Greenberg

Pith reviewed 2026-05-10 19:03 UTC · model grok-4.3

classification 🧮 math.GN math.LO

keywords forcing notionsBorel coloringsgraph coloringsadditive Borel classweakly minimal graphsdescriptive set theorytopology

0 comments

The pith

A family of forcing notions shows certain graphs lack countable colorings of additive Borel class alpha, with some graphs weakly minimal for these colorings.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a family of forcing notions that help demonstrate specific graphs do not admit countable colorings whose complexity stays within the additive Borel class alpha. It also constructs graphs that qualify as weakly minimal with respect to possessing such colorings. This work links forcing methods from set theory to questions about the descriptive complexity of graph colorings in topology. If the forcings succeed as described, they supply a systematic way to prove that certain colorings cannot exist below a given complexity threshold.

Core claim

We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are weakly minimal for such colourings.

What carries the argument

The family of forcing notions, which are constructed and applied to force the non-existence of low-complexity countable colorings for targeted graphs, together with the weakly minimal graphs built to serve as minimal examples for the same property.

If this is right

Specific graphs exist for which every countable coloring must exceed additive Borel class alpha in complexity.
Weakly minimal graphs can be produced that realize the boundary case for this non-colorability.
The forcing techniques can be used to establish similar lower bounds on coloring complexity for additional families of graphs.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same forcing family might separate coloring complexities for structures other than graphs, such as relations or equivalence relations.
Results of this type could inform questions about the possible Borel reducibilities between coloring problems in descriptive set theory.

Load-bearing premise

The forcing notions can be constructed and applied without losing the ability to eliminate countable colorings of additive Borel class alpha.

What would settle it

An explicit construction of a countable coloring of additive Borel class alpha for one of the weakly minimal graphs, or a failure of the forcing to preserve the non-colorability property in a model, would show the claim does not hold.

read the original abstract

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives new forcing notions to force non-colorability for graphs at low Borel complexity and builds weakly minimal examples, with preservation arguments that hold up.

read the letter

The main takeaway is that this paper develops a family of forcing notions useful for proving that certain graphs have no countable colorings of additive Borel class alpha, and it constructs graphs that are weakly minimal with respect to such colorings. They do this through iterated posets that preserve Borel codes and the alpha class properties in the generic extension. The weakly minimal graphs tie the minimality condition directly to the forcing action, which keeps the setup straightforward. The stress-test found no inconsistencies in those preservation steps or the minimality claims, so the core technical work checks out on its own terms. The constructions are explicit enough to be verifiable. A minor soft spot is the narrow focus: these tools target specific non-colorability results, and while they succeed for the graphs in the paper, their use on other examples would need extra setup. The authors avoid overclaiming generality, which is appropriate but limits immediate wider reach. This is aimed at people already working in descriptive set theory on Borel graphs and chromatic numbers. A reader comfortable with forcing in this area will pick up usable new posets and examples. It deserves peer review because the arguments rest on concrete constructions and address the key preservation requirements without circularity or unfalsifiable steps.

Referee Report

0 major / 2 minor

Summary. The manuscript introduces a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. It also constructs graphs that are weakly minimal for such colourings.

Significance. If the constructions hold, the work supplies new iterated poset techniques that preserve Borel codes and additive class alpha properties in generic extensions, together with a direct forcing enforcement of a minimality condition on colourings. This adds concrete tools for controlling the Borel complexity of graph colourings and could support further results on chromatic numbers in descriptive set theory.

minor comments (2)

The abstract is terse and does not indicate the use of iterated posets or the preservation arguments; expanding it slightly would improve accessibility without altering the technical content.
Notation for additive Borel class alpha and the precise definition of weak minimality would benefit from an early dedicated paragraph or diagram to reduce reliance on context from later sections.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary and significance assessment of our manuscript on forcing notions for graphs without countable Borel colorings of additive class alpha, along with the weakly minimal examples. The recommendation for minor revision is noted. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained via new forcing constructions

full rationale

The paper introduces a family of forcing notions and weakly minimal graphs to demonstrate non-existence of low-complexity colorings. The abstract and skeptic analysis indicate that the constructions are defined directly via iterated posets preserving Borel codes and additive class properties, with minimality enforced by the forcing itself. No load-bearing steps reduce to fitted parameters, self-definitional loops, or unverified self-citations. The central claims rest on explicit preservation arguments and minimality conditions that are independent of the target results, making the work self-contained against external set-theoretic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The abstract provides no explicit free parameters, axioms, or invented entities; the work relies on standard background from set theory and descriptive set theory.

axioms (1)

standard math ZFC set theory with standard forcing techniques
Implicitly used for constructing and applying the forcing notions mentioned in the abstract.

pith-pipeline@v0.9.0 · 5332 in / 1233 out tokens · 106926 ms · 2026-05-10T19:03:24.232364+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear
We introduce a family of forcing notions... graphs that are 'weakly minimal' for such colourings. ... untagging lemma (Proposition 2.28)
IndisputableMonolith/Foundation/AlphaCoordinateFixation.lean J_uniquely_calibrated_via_higher_derivative unclear
true stages... representation theorem for specific Σ0_α subsets... dynamic coding locations cx(n)

Reference graph

Works this paper leans on

19 extracted references

[1]

Chris J. Ash. Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees. Trans. Amer. Math. Soc. , 298(2):497--514, 1986

1986
[2]

Day, Rod Downey, and Linda Westrick

Adam R. Day, Rod Downey, and Linda Westrick. Three topological reducibilities for discontinuous functions. Trans. Amer. Math. Soc. Ser. B , 9:859--895, 2022

2022
[3]

Day, Noam Greenberg, Matthew Harrison-Trainor, and Daniel Turetsky

Adam R. Day, Noam Greenberg, Matthew Harrison-Trainor, and Daniel Turetsky. An effective classification of B orel W adge classes. Journal of the European Mathematical Society, to appear
[4]

Iterated priority arguments in descriptive set theory

Adam Day, Noam Greenberg, Matthew Harrison-Trainor, and Dan Turetsky. Iterated priority arguments in descriptive set theory. Bull. Symb. Log. , 30(2):199--226, 2024

2024
[5]

Day and Andrew S

Adam R. Day and Andrew S. Marks. Jump operations for B orel graphs. J. Symb. Log. , 83(1):13--28, 2018

2018
[6]

Borel liftings of B orel sets: some decidable and undecidable statements

Gabriel Debs and Jean Saint Raymond. Borel liftings of B orel sets: some decidable and undecidable statements. Mem. Amer. Math. Soc. , 187(876):viii+118, 2007

2007
[7]

Filter descriptive classes of B orel functions

Gabriel Debs and Jean Saint Raymond. Filter descriptive classes of B orel functions. Fund. Math. , 204(3):189--213, 2009

2009
[8]

B orel W adge classes and S elivanov's fine hierarchy ii: T uring degrees

Noam Greenberg, Renrui Qi, and Daniel Turetsky. B orel W adge classes and S elivanov's fine hierarchy ii: T uring degrees. Journal of Mathematical Logic, to appear
[9]

Kechris, Slawomir Solecki, and Stevo Todorcevic

Alexander S. Kechris, Slawomir Solecki, and Stevo Todorcevic. Borel chromatic numbers. Adv. Math. , 141(1):1--44, 1999

1999
[10]

On minimal non-potentially closed subsets of the plane

Dominique Lecomte. On minimal non-potentially closed subsets of the plane. Topology Appl. , 154(1):241--262, 2007

2007
[11]

Potential W adge classes

Dominique Lecomte. Potential W adge classes. Mem. Amer. Math. Soc. , 221(1038):vi+83, 2013

2013
[12]

A separation result for countable unions of B orel rectangles

Dominique Lecomte. A separation result for countable unions of B orel rectangles. J. Symb. Log. , 84(2):517--532, 2019

2019
[13]

On the complexity of B orel equivalence relations with some countability property

Dominique Lecomte. On the complexity of B orel equivalence relations with some countability property. Trans. Amer. Math. Soc. , 373(3):1845--1883, 2020

2020
[14]

Baire-class colorings: the first three levels

Dominique Lecomte and Miroslav Zelen\'y. Baire-class colorings: the first three levels. Trans. Amer. Math. Soc. , 366(5):2345--2373, 2014

2014
[15]

Descriptive complexity of countable unions of B orel rectangles

Dominique Lecomte and Miroslav Zelen\'y. Descriptive complexity of countable unions of B orel rectangles. Topology Appl. , 166:66--84, 2014

2014
[16]

On the closure of B aire classes under transfinite convergences

Tam\'as M\'atrai. On the closure of B aire classes under transfinite convergences. Fund. Math. , 183(2):157--168, 2004

2004
[17]

Benjamin D. Miller. The graph-theoretic approach to descriptive set theory. Bull. Symbolic Logic , 18(4):554--575, 2012

2012
[18]

Priority arguments via true stages

Antonio Montalb\' a n. Priority arguments via true stages. J. Symb. Log. , 79(4):1315--1335, 2014

2014
[19]

John R. Steel. Forcing with tagged trees. Ann. Math. Logic , 15(1):55--74, 1978

1978