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.
Absolute Values Completions and P Adic Numbers -- Examples
1 · Prerequisites
- Absolute Values Completions and P Adic Numbers
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Countability and Uncountability
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inverse Limits and Noetherian Completion
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Suprema and Infima
- Tensor Products of Modules
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These examples make the two geometries visibly different. The same rational sequence can diverge in the usual absolute value and converge in a p-adic one, -adic expansions can look backwards from the real point of view, and the square tests show how much arithmetic is controlled by valuation and residue.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A geometric series that is p-adically convergent and really divergent
Example
For any prime , the series
diverges in the usual absolute value and converges in to .
Facts & Assumptions
Given: A prime .
The -adic absolute value satisfies (The p-adic absolute value on the rationals).
is a field (The p-adic completion is a complete valued field).
Verification
The th partial sum is . By [L1], , so in .
In the usual absolute value, does not tend to , so the same series cannot converge there.
The p-adic expansion of minus one
Example
In one has
Facts & Assumptions
Given: A prime .
Every -adic number has a unique digit expansion (Every p-adic number has a unique digit expansion).
Verification
The th partial sum is Its difference from is , whose -adic absolute value tends to . Hence the series converges to .
Every digit is , so by the uniqueness part of [L1] this is the digit expansion of .
A square root of minus one in Q_5
Example
The element is a square in .
Facts & Assumptions
Given: The polynomial over .
For odd , a unit of is a square in exactly when its residue class is a square in (Square criterion in Q_p for odd p).
Simple roots lift uniquely, and Newton iteration gives the same root (Simple roots lift uniquely in Z_p, Newton's criterion in Q_p).
Verification
Modulo one has . Since is a unit, [L1] shows that is a square in .
Concretely, and , so [L2] produces a unique -adic root congruent to modulo .
There is no square root of p in Q_p
Example
For every prime , the element is not a square in .
Facts & Assumptions
Given: A prime .
The odd-prime and -adic square criteria describe exactly which elements are squares (Square criterion in Q_p for odd p, Square criterion in Q_2).
Verification
If is odd, then has odd valuation, so [L1] rules out its being a square in .
If , then also has odd valuation, so the -adic criterion in [L1] rules it out as well.
Hence no prime has a square root in its own -adic field.
Hensel lifting a simple root of X squared minus 2 in Z_7
Example
The congruence lifts to a root of in .
Facts & Assumptions
Given: The polynomial over .
Simple roots lift uniquely, and Newton iteration computes the lifted root (Simple roots lift uniquely in Z_p, Newton's criterion in Q_p).
Verification
The residue class satisfies , and . By [L1], there is a unique root with .
The Newton step from is which is well defined in and already lies in the same residue class modulo ; iterating stays in that class and converges to the lifted root from step 1.1.
The two-adic square test separates 17 and 5
Example
In , the number is a square but is not.
Facts & Assumptions
Given: The -adic square criterion.
An element with odd is a square in exactly when is even and (Square criterion in Q_2).
Verification
One has with , so [L1] shows that is a square in .
One has with , so [L1] shows that is not a square in .
The same sequence behaves oppositely in the real and p-adic metrics
Example
For a fixed prime , the sequence tends to in the usual absolute value and to in .
Facts & Assumptions
Given: A prime .
by definition of the -adic absolute value (The p-adic absolute value on the rationals).
is the completion field for this metric (The p-adic numbers as a metric completion).
Verification
By [L1], , so the sequence converges to in the -adic metric and hence in the completion .
In the usual absolute value, , so the same sequence runs away instead of converging to .
Z_p is not the integral closure of Z in Q_p
Statement refuted
The ring is the integral closure of inside .
Facts & Assumptions
Given: The ring .
sits inside and every element of has a unique digit expansion (The p-adic completion agrees with the fraction field of Z_p, Z_p is the valuation ring of Q_p, Every p-adic number has a unique digit expansion).
Being integral over means satisfying a monic polynomial with integer coefficients (Integral elements over a commutative ring and algebraic integers).
Counterexample
The map from to is injective by uniqueness of digit expansions in [L1]. Therefore is uncountable.
The subset of consisting of elements integral over is countable: there are only countably many monic polynomials with integer coefficients, and each has only finitely many roots in the field .
Hence some element of is not integral over . That element lies in by [L1], so cannot equal the integral closure of in .