Condensation Failure A: Closure Operators and the Finite-Chamber Axiom
Topological closure has a shape, but a shape is not a sieve. This paper fixesthe axiomatic coordinates for condensation failure: real and adelic closures haveconcrete shapes, yet they cannot be compressed directly into finitely many decidable, searchable chambers. We separate four operators — real topological closure,adelic closure, o-minimal definable closure, and the existential-quantifier projection— and insist that the last of these is a Diophantine image, not automatically aclosure operator. The finite-chamber axiom (FCP) asserts only the existence ofa finite tame cell decomposition of the real locus; density is a legitimate chamber state, not a failure. Effectivity and boundedness are quantified over a unifiedfamily of explicit representations and occupy distinct certificate tiers: FCP itself,effective FCP, the finite witness condition, and running-time boundedness. Theirconjunction is sufficient for chamber-state decisions and complete enumeration offinite chambers, but it is not necessary for every possible sieve implementation. Theprocedure theorem has four clauses. Height-bounded existence and enumeration forexplicit varieties are finite procedures that do not use FCP. If a chamber table, astate decider, and height witnesses are supplied uniformly, each chamber state isdecidable and finite chambers can be completely enumerated; a dense non-singletonchamber with infinitely many rational points has no finite complete enumeration.With finiteness but no height witness one generally obtains only semi-decision;uniform non-emptiness for an abstract family of finite sets is undecidable, whilethe arithmetic transfer of this no-go to FCP families remains open. Absence ofFCP only removes the procedure defined through chamber decomposition; it doesnot imply that no topological closure can ever serve as a Diophantine sieve. Themachine-check ledger uses the two-topology account of Pell units as its minimalwitness, and the four failure cells are recorded as complete-enumeration failure ina dense chamber, genuine non-finite chamber, closure overgrowth, and chamberinseparability.
Authors
- changzheng zhou (ORCID: https://orcid.org/0009-0002-4186-7877)
- ziqing zhou (ORCID: https://orcid.org/0009-0005-6883-6300)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24329925
- Primary Topic
- Advanced Topology and Set Theory
- Type
- preprint