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 CnUn 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 cg(α) (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)={α:(FFα) FA} (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.1

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.

F1F2A1
1.2

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.

F3A1
2.1

Let C0 now denote a single closed subset of Un, and define A0={α:(α,0)C0} and Aj+1=Ψ(Aj) for 0jn. 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 C0Un has no point on height n+1, this proves An+1=. Consequently A0=j=0n(AjAj+1). Each piece is separated by step 1.2, giving exactly the claimed finite decomposition. For n=0 there is one piece, A0A1=A0.

step 1.2F3
3.1

If closed CnUn covered L0, their bottom traces would cover κ. Apply step 2.1 to each Cn. Enumerating the pairs (n,j) with jn 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 CnUn whose interiors cover X, hence whose sets cover L0. This is impossible. All claimed failures follow. QED.

step 1.1step 2.1F3F4

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