Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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 T1 topology on X. Its Un are open and its Ln are relatively discrete. Define families B(α,n) recursively: B(α,0)={{(α,0)}}, and B(α,n+1) consists of the sets

{(α,n+1)}βFVβ,FFα,VβB(β,n).

These are open neighborhood bases at the indicated points; their members lie in Un at height n and meet Ln in exactly that point. The family Fα is closed under finite intersections and can omit any prescribed finite set. Empty members are allowed.

For every Aκ and every n<ω, the next-level closure trace is

Φ(A):={α:(α,n+1)A×{n}}={α:(FFα) FA},

which is independent of n.

Facts & Assumptions

Given: The displayed topology rule and families.

[F1]

F(α,s,a) is defined by simultaneous binary equations followed by removal of a, and openness is the immediate-lower-level condition (Balogh continuum topology).

[A1]

AC supplies simultaneous choices of recursively available neighborhoods (The Axiom of Choice).

Proof

1.1

For any s1,s2,a1,a2, membership in the intersection of the two corresponding F sets means satisfying both sets of binary equations and avoiding both finite excluded sets. Therefore F(α,s1,a1)F(α,s2,a2)=F(α,s1s2,a1a2). Also F(α,,)=κ, and enlarging a 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.

F1
1.2

Each Un satisfies the open rule because the immediate preceding level of any positive-height point in it is entirely in Un. The complement of a singleton (γ,m) is open: at a remaining point of height m+1 use F(α,,{γ}); at a positive height with preceding level different from m use κ. Thus the topology is T1.

F1
2.1

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 n. Each displayed recursive set at height n+1 is open: its lower points lie in one of the open Vβ, and its top point has the witness F because (β,n)Vβ for every βF. It lies in Un+1 and has only its designated point at height n+1. Conversely an open set O containing (α,n+1) has a witness F by F1. Each (β,n) for βF is in O and, by the induction assertion, has a member Vβ of its recursive base contained in O. A1 chooses these simultaneously; their union with the top point is contained in O. When F=, there are no such choices and the top singleton itself is open. This completes the finite-height verification of the bases.

step 1.1F1A1
3.1

The base in step 2.1 meets Ln in only its designated point, proving that Ln is discrete in its relative topology. If every FFα meets A, every open neighborhood of (α,n+1) has a lower-level witness meeting A×{n} by F1; the point is in its closure. Conversely if FA= for some F, the set O={(α,n+1)}(F×{n})Un1 is open. Its top has witness F, its height-n points have the whole preceding level as witness if n>0, and lower points are covered by the open Un1 of step 1.2. When n=0, U1 is empty and height-zero points need no witness. This O misses A×{n}, proving the reverse direction of the closure formula. The formula has no remaining dependence on n. Together with steps 1.1, 1.2 and 2.1 these prove all conclusions. QED.

step 1.1step 1.2step 2.1F1

Depends on

Used by

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.

Sources