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 hereditary normality

Statement

Assume AC. In the Balogh space, any two separated subsets H,K have disjoint open neighborhoods. Here separated means H∩K‾=H‾∩K=∅, with closures in the whole space. Consequently the space is hereditarily normal, Hausdorff and T1.

Facts & Assumptions

Given: The Balogh space X=κ×ω and its levels Ln and initial level unions Un.

[F1]

Openness is witnessed by a finite family of binary equations at the immediately preceding level, with F(α,s,a) as defined in Balogh continuum topology.

[F2]

These rules give a T1 topology, each Un is open, and points on Ln have neighborhoods contained in Un (Balogh neighborhood basis).

[A1]

AC supplies simultaneous selections of the open separating neighborhoods whose existence is proved below (The Axiom of Choice).

Proof

1.1F1F2

For each A⊆κ and n<ω, we prove by finite induction that A×{n} and (κ∖A)×{n} have disjoint open neighborhoods contained in Un. For n=0, use the two sets themselves, open by F1. At the successor stage let cA∈C be the characteristic function of A and put A′={β:dcA(β)=1}. The induction assertion gives disjoint open O1,O0⊆Un containing A′×{n} and its complement on Ln. Adjoin A×{n+1} to O1 and its complement on Ln+1 to O0. At a new top point α, the witness F(α,{cA},∅) lies in A′ if α∈A, and in its complement otherwise. F1 therefore makes the enlarged sets open; lower points already lie in the old opens. Disjointness holds on the new level and on the lower levels separately. This proves the assertion at every height.

1.2F1F2

We will use the following open-extension calculation. Suppose C0 is closed, O⊆Um is open, and Lm∖C0⊆O. For t>m, put O∗=O∪(Ut∖(Um∪C0)). At points of height at most m, openness follows from O. At a new point of height m+1, the open set X∖C0 supplies by F1 a witness whose height-m slice avoids C0, and this slice is contained in O. At greater heights the same kind of witness lies above height m and outside C0, hence inside the newly added part. Thus O∗ is open. The identical check at every finite height proves that O∪(X∖(Um∪C0)) is open as well. No claim that Um is closed was used.

2.1step 1.1step 1.2

Let H,K be separated, and fix m<n. Apply step 1.1 at level m to the partition Lm∩K‾, Lm∖K‾. Obtain disjoint open OK,OH⊆Um containing those sets. Then OK contains K∩Lm. By step 1.2, P=OH∪(Un∖(Um∪K‾)) is open; it contains H∩Ln because those points have height n>m and avoid K‾. Its newly added portion is outside Um, while OK⊆Um; the old portions are disjoint. Hence P,OK are disjoint open neighborhoods of these different-level subsets, both lying in Un.

3.1step 1.1step 1.2step 2.1A1

Fix n. For every m<n choose such disjoint open Pm,Qm⊆Un about H∩Ln and K∩Lm. At level n, step 1.1 supplies disjoint open Pn,Qn⊆Un about Ln∩H‾ and Ln∖H‾. In particular these contain H∩Ln and K∩Ln. Put Vn=⋂m≤nPm and O′=⋃m≤nQm. Both are open, disjoint, and respectively contain H∩Ln and K∩Un. In addition Ln∖H‾⊆O′ by the choice of Qn. Step 1.2 therefore makes O=O′∪(X∖(Un∪H‾)) open. It contains all of K, because K avoids H‾, and remains disjoint from Vn⊆Un. Thus Vn‾∩K=∅: each point of K has the neighborhood O avoiding Vn. Repeating with H,K interchanged yields open Wn containing K∩Ln with Wn‾∩H=∅. A1 permits fixing these choices for all n. At n=0 the finite intersection contains only the same-level choice; no different-level choices are needed.

4.1step 3.1

Define V=⋃n<ω(Vn∖⋃i≤nWi‾) and W=⋃n<ω(Wn∖⋃i≤nVi‾). Each summand is open because only finitely many closed sets are removed. Every point of H lies in some Vn and in none of the Wi‾, so H⊆V; likewise K⊆W. If a point belonged to a V-summand indexed by n and a W-summand indexed by m, then m≤n would make the first omit Wm, while n≤m would make the second omit Vn. At least one comparison holds, including equality, so no such point exists. These are disjoint open neighborhoods of H,K.

5.1step 4.1F2

For any subspace Y⊆X and disjoint relatively closed H,K⊆Y, one has Y∩H‾=H and Y∩K‾=K, by the subspace closure definition. Thus H,K are separated in X. Step 4.1 gives disjoint open neighborhoods in X, whose intersections with Y prove normality of Y. This also handles empty subsets and the empty subspace. F2 gives T1 for X; apply its normality to two distinct closed singletons to get Hausdorff separation. Therefore all the asserted hereditary and separation properties hold. QED.

Depends on

Used by

Dependency tree · two levels

5 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