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.
The Souslin operation preserves the Baire property
Statement
In ZFC, in a topological space X with a specified countable basis, every subset E has a Baire-property envelope H containing E such that is meagre for every Baire-property D containing E. The Souslin operation preserves the Baire property. Consequently every analytic subset of a Polish space has the Baire property.
Facts & Assumptions
Baire property sigma-algebra and Borel regularity gives the Baire-property sigma-algebra, Borel inclusion and the meagre ideal.
The Souslin operation gives prefix normalization, including the root.
Closed Souslin schemes characterize analytic sets represents analytic sets by closed schemes.
Assume The Axiom of Choice.
Proof
Given: A specified countable basis of X. X need not be a Baire space.
Given E, let U be the union of those basis opens V for which is meagre. Countability of the basis and F1 with A1 make meagre. Put and . H differs from closed F by , so is Baire-property by F1. Suppose a Baire-property D contains E. Then is Baire-property by F1, disjoint from E and contained in F. If C were nonmeagre, choose open O with meagre. O is nonmeagre, for otherwise so would C be by the ideal property. Since is meagre and C misses E, is meagre. Every basis open inside O then belongs to the union defining U; hence and . This makes meagre, a contradiction. Thus is meagre as required.
For a Baire-property scheme normalize it by F2 to a decreasing scheme , using F1 for finite intersections. Let . Then and . By step 1.1 and A1 choose Baire-property envelopes H_s of E_s (a countable family of nonempty sets of subset witnesses). Define . These are Baire-property and decrease along extensions. Also , because for every prefix t. As , it remains an envelope of E_s.
The union is a Baire-property superset of E_s. Therefore the envelope property makes meagre. The union C of C_s over all finite words is meagre by F1 and A1. For , whenever there is a child with x in its B-set, since . Recursively choose the least such child index. This defines a branch f with for every n, and hence by F2. Conversely . Thus the Baire-property set differs from by a subset of meagre C, so F1 proves the latter Baire-property.
For a Polish X, dense metric centres and positive rational radii give a countable basis. F3 with A1 represents every analytic set by a closed scheme. Its entries are Baire-property by F1; step 3.1 applies to prove the analytic assertion. Empty entries, including an empty root, require no alteration of the envelope argument. QED.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
10 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
- Lemma 4.21, Theorem 4.22 and Corollary 4.23, printed pp39–40; complete proofs reread 2026-09-09. (standard reference, not scraped)