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 in the Balogh space, fails even to cover the bottom level . Thus the increasing open cover has no closed shrinking covering , and is not countably paracompact.
More precisely, call separated if one can choose for such that, for distinct , both and . The cardinal is not a countable union of separated sets, whereas the bottom trace of a closed subset of is a union of separated sets, allowing empty pieces.
Facts & Assumptions
Given: with its Balogh topology.
For all typed , the fixed map supplies with equal -values, and for every (Balogh combinatorial map).
These equations and finite exclusions define and (Balogh continuum topology).
The form an increasing open cover, and the next-level closure trace is (Balogh neighborhood basis).
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)).
AC is assumed for simultaneous separation witnesses and their finite parameter representations (The Axiom of Choice).
Proof
Suppose 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 be the unique resulting piece index. Choose a witness for each point and finite parameters , with , using A1 and F2. Apply F1 to these typed functions. The resulting distinct lie in the same piece because their -values are equal. Their equations and imply by F2, contradicting that piece's separation. Thus cannot be such a countable union.
For put . If , then , so F3 supplies an missing . Choose these simultaneously using A1. For distinct in , both are in , giving and . Hence this difference is separated. Empty differences use the empty witness family.
Let now denote a single closed subset of , and define and for . These form a decreasing finite sequence. By induction, : the base is the definition, and at the next stage puts its points on height in by F3 and closedness. Since has no point on height , this proves . Consequently . Each piece is separated by step 1.2, giving exactly the claimed finite decomposition. For there is one piece, .
If closed covered , their bottom traces would cover . Apply step 2.1 to each . Enumerating the pairs with 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 were countably paracompact, F4 applied to the increasing open cover from F3 would supply closed whose interiors cover , hence whose sets cover . 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.