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 failure of countable shrinking

Statement

Assume AC. For any sequence of closed Cn⊆Un in the Balogh space, ⋃n<ωCn fails even to cover the bottom level L0. Thus the increasing open cover (Un) has no closed shrinking covering X, and X is not countably paracompact.

More precisely, call S⊆κ separated if one can choose Fα∈Fα for α∈S such that, for distinct α,β∈S, both β∉Fα and α∉Fβ. The cardinal κ is not a countable union of separated sets, whereas the bottom trace of a closed subset of Un is a union of n+1 separated sets, allowing empty pieces.

Facts & Assumptions

Given: X=κ×ω with its Balogh topology.

[F1]

For all typed f,g,h, the fixed map supplies α<β with equal f-values, β∉h(α) and dc(β)=c(α) for every c∈g(α) (Balogh combinatorial map).

[F2]

These equations and finite exclusions define F(α,s,a) and Fα (Balogh continuum topology).

[F3]

The Un form an increasing open cover, and the next-level closure trace is Φ(A)={α:(∀F∈Fα) F∩A≠∅} (Balogh neighborhood basis).

[F4]

In a countably paracompact space every increasing open cover has closed subsets of its corresponding members whose interiors cover the space (Increasing-cover and decreasing-closed-set criteria, (ii)).

[A1]

AC is assumed for simultaneous separation witnesses and their finite parameter representations (The Axiom of Choice).

Proof

1.1F1F2A1

Suppose (Sn)n<ω were separated sets covering κ. Replace each by its difference from the preceding finite union; the resulting disjoint sets still cover and retain separation by restriction of the witnesses. Let f(α) be the unique resulting piece index. Choose a witness Fα for each point and finite parameters g(α)⊆C, h(α)⊆κ with Fα=F(α,g(α),h(α)), using A1 and F2. Apply F1 to these typed functions. The resulting distinct α<β lie in the same piece because their f-values are equal. Their equations and β∉h(α) imply β∈Fα by F2, contradicting that piece's separation. Thus κ cannot be such a countable union.

1.2F3A1

For A⊆κ put Ψ(A)=A∩Φ(A). If α∈A∖Ψ(A), then α∉Φ(A), so F3 supplies an Fα∈Fα missing A. Choose these simultaneously using A1. For distinct α,β in A∖Ψ(A), both are in A, giving β∉Fα and α∉Fβ. Hence this difference is separated. Empty differences use the empty witness family.

2.1step 1.2F3

Let C0 now denote a single closed subset of Un, and define A0={α:(α,0)∈C0} and Aj+1=Ψ(Aj) for 0≤j≤n. These form a decreasing finite sequence. By induction, Aj×{j}⊆C0: the base is the definition, and at the next stage Aj+1⊆Φ(Aj) puts its points on height j+1 in Aj×{j}‾⊆C0 by F3 and closedness. Since C0⊆Un has no point on height n+1, this proves An+1=∅. Consequently A0=⋃j=0n(Aj∖Aj+1). Each piece is separated by step 1.2, giving exactly the claimed finite decomposition. For n=0 there is one piece, A0∖A1=A0.

3.1step 1.1step 2.1F3F4

If closed Cn⊆Un covered L0, their bottom traces would cover κ. Apply step 2.1 to each Cn. Enumerating the pairs (n,j) with j≤n by successive finite rows turns those traces into a countable covering by separated sets, contrary to step 1.1. Therefore every such closed sequence misses some bottom point. If X were countably paracompact, F4 applied to the increasing open cover from F3 would supply closed Cn⊆Un whose interiors cover X, hence whose sets cover L0. This is impossible. All claimed failures follow. QED.

Depends on

Used by

Dependency tree · two levels

12 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