How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Ill-founded trees form an analytic non-Borel set
Statement
In ZFC, is analytic and not Borel; is coanalytic and not analytic.
Facts & Assumptions
The Polish space of trees and its well-founded rank gives the Polish coordinate space of trees and WF.
Countable tree ranks and monotonicity under extension maps identifies ill-foundedness with a branch and realizes every countable rank.
Analytic boundedness for well-founded trees bounds the ranks of an analytic family contained in WF.
Analytic countable operations and inclusion of Borel sets makes every Borel set analytic and coanalytic.
Assume The Axiom of Choice.
Proof
Given: ZFC and the tree space with the specified rank conventions.
The set in is closed. Failure is witnessed by n; fixing the first n coordinates of x and the tree coordinate excluding its prefix gives an open neighbourhood still failing that condition. By F2 its projection is exactly IF. Thus IF is analytic by the closed-projection convention, and its complement WF is coanalytic.
If WF were analytic, F3 with A1 would give a countable strictly bounding every well-founded tree rank. F2 with A1 supplies a tree of rank , contradicting that strict bound. Therefore WF is not analytic. If IF were Borel its complement WF would be Borel by the sigma-algebra axiom, hence analytic by F4 and A1, again a contradiction. Thus IF is not Borel. QED.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Example 4.7 pp35–36 and Theorem 5.3/Corollary 5.4 p44 (non-Borel conclusion); alternative proof from local direct boundedness (standard reference, not scraped)