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.
Q_p is locally compact and totally disconnected
Statement
Assume the Axiom of Countable Choice of The Axiom of Countable Choice (). Then the field is locally compact and totally disconnected. In particular, is a compact open subring.
Facts & Assumptions
Given: The p-adic field and .
, and -adic balls are clopen (Z_p is the valuation ring of Q_p, P-adic balls are clopen and intersecting comparable balls are nested).
Every element of has a digit expansion (Every p-adic number has a unique digit expansion).
Assuming , a complete totally bounded metric space is compact (A complete, totally bounded metric space is compact, proved from countable choice used exactly once).
Proof
By [L1], is the closed unit ball, and by the clopen-ball lemma it is open. To prove compactness, note first that is complete as a closed subset of the complete field . It is totally bounded because for each , every element of differs by at most from one of the finitely many truncations with digits , by [L2]. Hence [L3] makes compact.
Every point of has a compact open neighborhood, namely a scalar multiple of , so is locally compact. If , choose a ball around whose radius is smaller than ; by [L1] this ball is clopen and does not contain . Therefore points are separated by clopen sets, so is totally disconnected.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
30 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
- J. S. Milne, Algebraic Number Theory, Proposition 7.46 and Remark 7.49(b) (standard reference, not scraped)