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.
A p-adic integer is encoded by a compatible sequence of residue digits
Example
For fixed digits , the sequence
defines an element of .
Facts & Assumptions
Given: Digits for .
An element of is a compatible residue-class tuple (The p-adic integers are the compatible residue-class tuples in the inverse limit of Z mod p^n).
Verification
For each , reducing modulo removes only the final term , so . Thus the tuple is compatible.
By [L1], every compatible tuple defines an element of . Hence the displayed digit data encodes a -adic integer.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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
- Jordan Bell, Explicit construction of the p-adic numbers (standard reference, not scraped)