REVIEW 2 major objections 5 minor 9 references
A note on an effective Polish topology and Silver's Dichotomy theorem
T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The paper defines the Sigma-Delta topology on Baire space, proves it is Polish, and shows that every Pi-1-1 equivalence relation decomposes into a clopen part with countably many classes and a meager part, yielding Silver's dichotomy.
desk verdict A compact and honest note that introduces a genuinely useful Polish topology and gives a clean proof of Silver's dichotomy; the only soft spot is a compressed definability step that is fillable, not fatal. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central object is the Sigma-$\Delta$ topology S, defined by taking as its basis those Sigma-1-1 sets that are closed in the $\Delta$-topology S_Delta, which itself has as basis the $\Delta$-1-1 sets. The proof that S is Polish uses a lemma showing that any topology generated by a countable family of Polish topologies, with Hausdorff intersection, is Polish, and that adding countably many closed sets to a Polish topology preserves Polishness. The other key ingredient is the set G = { x : omega_1^x = omega_1^CK }, shown to be a dense G_delta, together with the consequence that every nonempty Sigma-1-1 set is nonmeager in S. These facts turn the classical Gandy-Harrington forcing argument into a purely Polish-space argument.
What would settle it
The decomposition theorem would be falsified by a Pi-1-1 equivalence relation on Baire space that remains nonmeager after removing its clopen countable part; the nonmeagerness lemma would be falsified by a nonempty Sigma-1-1 set that is meager in the Sigma-$\Delta$ topology.
Extended reading notes
Core claim
The central claim is that the Sigma-$\Delta$ topology S on the Baire space N = omega^omega is Polish and has a strong decomposition property: for every Pi-1-1 equivalence relation E, the space splits into two clopen pieces, one on which E has only countably many classes and is clopen, and one on which E is meager. From this decomposition, Silver's dichotomy follows directly: if the meager piece is nonempty, Mycielski's theorem supplies a perfect set of mutually inequivalent reals; otherwise the quotient is countable. The paper further claims that S is the largest regular topology on Baire space with a basis contained in Sigma-1-1, so the topology is not an ad hoc device but a maximal natural object for effective topology.
Load-bearing premise
The whole proof depends on the assumption that the classical boundedness property of hyperarithmetic reals lets every nonempty effectively analytic set be represented, inside the dense G-delta set G, as a clopen set; this is the most compressed step in the paper and the one point where, if it fails, the nonmeagerness theorem and the decomposition built on it would need a different proof.
Editorial extensions
If this is right
- Silver's dichotomy follows without forcing and without leaving the class of Polish spaces, so standard Polish-space tools such as Baire category, Kuratowski-Ulam, and Mycielski's theorem can be applied directly.
- Every Pi-1-1 equivalence relation carries a canonical two-part decomposition: one clopen part with countably many clopen classes and one meager part.
- Because S is the largest regular topology with a basis contained in Sigma-1-1, any regular effective topology on Baire space is coarser than S, so results proved for S automatically apply to all such topologies.
- In a Pi-1-1 equivalence relation with only countably many classes, every class is Pi-1-1 and clopen in S, giving a uniformly effective description of the quotient.
- The Sigma-Delta topology is Polish and finer than the standard product topology on N^2, with the diagonal open, which supports product-style arguments about equivalence relations.
Reading between the lines
- The same argument should transfer verbatim to recursively presented Polish spaces, giving a uniform decomposition theorem for effective equivalence relations in those settings.
- Because S is maximal among regular effective topologies, it is a natural ambient space for other dichotomies in effective descriptive set theory; one could test whether Pi-1-1 partial orders, graphs, or quasiorders admit the same clopen/meager decomposition.
- The nonmeagerness of all nonempty Sigma-1-1 sets suggests that S supports an effective form of the Baire category theorem for analytic sets, which may simplify other Gandy-Harrington-style proofs.
- The characterization theorem implies that any attempt to build a finer Polish topology with an analytic basis must sacrifice regularity, which may explain why the natural Gandy-Harrington topology is not Polish.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This note introduces the Σ∆-topology on Baire space, whose basic open sets are the lightface Σ1_1 sets that are closed in the ∆-topology (the topology generated by ∆1_1 sets). The main results are: (i) the ∆- and Σ∆-topologies are Polish (Theorem 1.3); (ii) every nonempty Σ1_1 set is nonmeager in the Σ∆-topology and the set G = {x | ω1^x = ω1^CK} is a dense Gδ (Theorem 1.4); (iii) using these facts, any Π1_1 equivalence relation decomposes into a clopen subspace on which it has only countably many classes and a clopen subspace on which it is meager, yielding Silver's dichotomy (Theorems 2.2 and 2.3); and (iv) the Σ∆-topology is the largest regular topology with a basis contained in Σ1_1 (Theorem 3.3). The arguments are concise and rely on standard results such as Gandy's basis theorem, Mycielski's theorem, the Kuratowski-Ulam theorem, and Σ1_1 separation.
Significance. If the technical gaps in the proof of Theorem 1.4 are repaired, the paper would provide a genuine Polish-space alternative to the Gandy-Harrington topology, with a clean proof of Silver's dichotomy and a compelling maximality property. The paper is clearly written and makes good use of known theorems; the constructions are explicit and the dependence on external results is transparent. The main contribution is the identification of the Σ∆-topology as a canonical effective Polish topology, which could simplify future work on effective dichotomies and related transfer theorems.
major comments (2)
- [§1.4, proof of Theorem 1.4(2)] The proof asserts that A− = A∩G is Σ1_1. This is not justified: G = {x | ω1^x = ω1^CK} is a Π1_1 set (and not shown to be Σ1_1), and the intersection of a Σ1_1 set with a Π1_1 set need not be Σ1_1. Consequently, the reduction x∈A− ⇔ F(x)∈WO and the representation of A− as G ∩ F^{-1}(WO_<ω1^CK) do not follow as written. This step is load-bearing: it is used in Proposition 1.5 and Lemma 2.1(1), and hence in the proof of Silver's dichotomy in Theorem 2.2. The gap appears repairable: if F0 is a recursive function witnessing that the original set A is Σ1_1, i.e., x∈A ⇔ F0(x)∈WO, then B = G ∩ {x | F0(x)∈WO_<ω1^CK} is a subset of A, is nonempty by Gandy's basis theorem (choose x∈A with ω1^x = ω1^CK), and is nonmeager because G is a dense Gδ and the second factor is clopen. Please revise the proof along these lines.
- [§1.4, proof of Theorem 1.4(1)] The proof asserts the equality G = ∩_k f_k^{-1}[~WO_ω1^CK] without proof, where f_k enumerates the total recursive functions. This equality is not evident: an arbitrary real recursive in x need not be of the form f_k(x) for a total recursive f_k, so the condition on the right-hand side is not obviously equivalent to ω1^x = ω1^CK. Since the theorem states that the set of low reals is a dense Gδ, the proof is incomplete as it stands. I note that the right-hand side is a dense Gδ set containing all low reals, and this weaker property suffices for the later applications; the author should either prove the equality (with an argument or reference) or restate Theorem 1.4(1) in terms of the set actually constructed.
minor comments (5)
- [Abstract] The abstract contains the typo 'toplogy' instead of 'topology'.
- [§1.4] The statement that WO_<ω1^CK is clopen 'for it is a Π1_1 union of ∆1_1 sets' is asserted without proof or reference; the effective complexity of WO_<ω1^CK is not immediate, so please add a short argument or citation.
- [§1.2, Lemma 1.2] The notation ⟨T∪F⟩ is ambiguous: the proof shows that a closed set F is added as an open set (so that F becomes clopen), rather than as a closed set. Please clarify this notation in the statement.
- [§3.3, proof of Theorem 3.3] The intersection CUx = ∩_i D_i is taken over an index set that may be uncountable; since there are only countably many ∆1_1 sets, the intersection reduces to a countable one, but this should be stated explicitly.
- [§2, after Theorem 2.3] The last paragraph of Section 2 is informal; consider stating the effective consequence about Π1_1 equivalence relations with countably many classes as a numbered corollary or a remark.
Circularity Check
No circularity found: the Σ∆-topology is built from independent effective descriptive set theory facts, and the Silver dichotomy proof does not assume its conclusion.
full rationale
The paper's derivation chain is self-contained in the relevant sense. The Σ∆-topology is defined in Definition 1.1 as the topology generated by Σ1-1 sets that are closed in the ∆-topology, and its Polishness (Theorem 1.3) follows from Lemma 1.2 about topologies generated by countable collections of closed sets over a Polish space. The nonmeagerness of nonempty Σ1-1 sets (Theorem 1.4(2)) uses Gandy's basis theorem, the standard coding of well-orders, and the auxiliary dense Gδ set G; none of these inputs is the target Silver dichotomy or a theorem equivalent to it. The proof of Silver's theorem (Theorem 2.2) uses Mycielski's theorem, the Kuratowski-Ulam theorem, and Σ1-1 separation applied to the given Π1-1 equivalence relation, with no step assuming the dichotomy or its consequences. The characterization theorem (Theorem 3.3) is not self-definitional: it proves by a regularity and separation argument that every regular topology with a Σ1-1 basis is contained in S, and the key Lemma 3.2, that the ∆-closure of a Σ1-1 set is Σ1-1 and S-clopen, is established independently. No fitted parameter is introduced, no quantity is predicted from data used to define it, and no load-bearing step is justified solely by a self-citation. Citations to Gandy, Mycielski, Louveau, and Harrington are external standard results and do not include Silver's theorem as an assumed input. Therefore the circularity score is 0.
Assumptions & free parameters
assumptions (6)
- standard math Gandy's basis theorem: every nonempty Sigma-1-1 set contains a real x with omega_1^x = omega_1^CK.
- standard math Mycielski's theorem: a meager equivalence relation on a Polish space has a perfect set of mutually inequivalent elements.
- standard math Kuratowski-Ulam theorem: a Baire-property equivalence relation is meager in the product iff all its classes are meager.
- standard math Sigma-1-1 separation: disjoint Sigma-1-1 sets can be separated by a Delta-1-1 set.
- standard math Delta-1-1 equals the effective Borel hierarchy union over xi less than omega_1^CK.
- standard math The lightface classes Sigma-1-1 and Delta-1-1 are countable.
Cite this review
Pith. "Pith review of A note on an effective Polish topology and Silver's Dichotomy theorem." pith.science (2026). https://pith.science/paper/GFEKORCO
@misc{pith2026190809214,
author = {Pith},
title = {Pith review of: A note on an effective Polish topology and Silver's Dichotomy theorem},
year = {2026},
howpublished = {\url{https://pith.science/paper/GFEKORCO}},
note = {Machine review of arXiv:1908.09214}
}
abstract
We define a Polish topology inspired from the Gandy-Harrington topology and show how it can be used to prove Silver's dichotomy theorem while remaining in the Polish realm. In this topology, a $\Pi^1_1$ equivalence relation decomposes into a "sum" of a clopen relation and a meager one. We characterize it as the largest regular toplogy with a basis included in $\Sigma^1_1$.
Reference graph
Works this paper leans on
-
[1]
Su Gao, Invariant Descriptive Set Theory, CRC Press/Chapman & Hall, Boca Raton, FL, 2009
work page 2009
-
[2]
Harrington, A powerless proof of a theorem of Silver, Unpublished manuscript, 1976
Leo A. Harrington, A powerless proof of a theorem of Silver, Unpublished manuscript, 1976
work page 1976
-
[3]
Leo A. Harrington, Alexander S. Kechris, and Alain Louveau, A Glimm-Effros dichotomy for Borel equivalence relations, J. Amer. Math. Soc. 3 (1990), no.\,4, 903--928
work page 1990
-
[4]
Alexander S. Kechris and Donald A. Martin, Infinite games and effective descriptive set theory. Analytic Sets, Academic Press, Inc., London-New York, 1980, pp. 440--470
work page 1980
-
[5]
Alain Louveau, Une nouvelle technique d'étude des relations d'équivalence coanalytiques, in S. Grigorieff, K. McAloon, and J. Stern, Théorie des ensembles, Publ. Math. Univ. Paris VII, vol. 5, Univ. Paris VII, Paris, 1979, pp. 35--42
work page 1979
-
[6]
Richard Mansfield and Galen Weitkamp, Recursive Aspects of Descriptive Set Theory, Oxford University Press, New York, 1985
work page 1985
-
[7]
Miller, The graph-theoretic approach to descriptive set theory, Bull
Benjamin D. Miller, The graph-theoretic approach to descriptive set theory, Bull. Symbolic Logic 18 (2012), no.\,4, 554--575
work page 2012
-
[8]
Moschovakis, Descriptive Set Theory, 2nd ed., American Mathematical Society, Providence RI, 2009
Yannis N. Moschovakis, Descriptive Set Theory, 2nd ed., American Mathematical Society, Providence RI, 2009
work page 2009
Show all 9 references
-
[9]
Silver, Counting the number of equivalence classes of Borel and coanalytic equivalence relations, Ann
Jack H. Silver, Counting the number of equivalence classes of Borel and coanalytic equivalence relations, Ann. Math. Logic 18 (1980), no.\,1, 1--28
1980
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.