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.
Balogh neighborhood basis
Statement
Assume AC. The Balogh open-set rule defines a topology on . Its are open and its are relatively discrete. Define families recursively: , and consists of the sets
These are open neighborhood bases at the indicated points; their members lie in at height and meet in exactly that point. The family is closed under finite intersections and can omit any prescribed finite set. Empty members are allowed.
For every and every , the next-level closure trace is
which is independent of .
Facts & Assumptions
Given: The displayed topology rule and families.
is defined by simultaneous binary equations followed by removal of , and openness is the immediate-lower-level condition (Balogh continuum topology).
AC supplies simultaneous choices of recursively available neighborhoods (The Axiom of Choice).
Proof
For any , membership in the intersection of the two corresponding sets means satisfying both sets of binary equations and avoiding both finite excluded sets. Therefore . Also , and enlarging omits any specified finite set. The empty open set satisfies the rule vacuously; the whole space uses as each witness. At a point in a union, a witness from one containing open set is also a witness for the union. At a point in the intersection of two open sets, intersect their witnesses using the identity just proved. These checks prove arbitrary-union and finite-intersection closure, hence the topology axioms.
Each satisfies the open rule because the immediate preceding level of any positive-height point in it is entirely in . The complement of a singleton is open: at a remaining point of height use ; at a positive height with preceding level different from use . Thus the topology is .
We verify the recursive bases by induction on the finite height. At height zero, singletons are open by F1 and contained in every neighborhood of their point. Suppose the assertions hold at height . Each displayed recursive set at height is open: its lower points lie in one of the open , and its top point has the witness because for every . It lies in and has only its designated point at height . Conversely an open set containing has a witness by F1. Each for is in and, by the induction assertion, has a member of its recursive base contained in . A1 chooses these simultaneously; their union with the top point is contained in . When , there are no such choices and the top singleton itself is open. This completes the finite-height verification of the bases.
The base in step 2.1 meets in only its designated point, proving that is discrete in its relative topology. If every meets , every open neighborhood of has a lower-level witness meeting by F1; the point is in its closure. Conversely if for some , the set is open. Its top has witness , its height- points have the whole preceding level as witness if , and lower points are covered by the open of step 1.2. When , is empty and height-zero points need no witness. This misses , proving the reverse direction of the closure formula. The formula has no remaining dependence on . Together with steps 1.1, 1.2 and 2.1 these prove all conclusions. QED.
Depends on
Used by
- Balogh failure of countable shrinking Lemma
- Balogh hereditary normality Lemma
- Balogh continuum-sized ZFC Dowker space Theorem
Cited to discharge well-definedness by Balogh continuum topology.
Dependency tree · two levels
4 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.