Alphabeta Math
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.

✓ 8 results · all verified · 7 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Absolute Values Completions and P Adic Numbers -- Examples

1 · Prerequisites

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, p-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

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A geometric series that is p-adically convergent and really divergent

Example

For any prime p, the series

1+p+p2+⋯

diverges in the usual absolute value and converges in Qp to 1/(1−p).

Facts & Assumptions

Given: A prime p.

[L1]

The p-adic absolute value satisfies ∣p∣p=p−1<1 (The p-adic absolute value on the rationals).

Verification

technique · direct
1.1L1L2givenalgebra

The Nth partial sum is sN=(1−pN+1)/(1−p). By [L1], ∣pN+1∣p=p−(N+1)→0, so sN→1/(1−p) in Qp.

2.1step 1.1algebra∎

In the usual absolute value, ∣pN∣∞=pN does not tend to 0, so the same series cannot converge there.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The p-adic expansion of minus one

Example

In Qp one has

−1=(p−1)+(p−1)p+(p−1)p2+⋯ .

Facts & Assumptions

Given: A prime p.

[L1]

Every p-adic number has a unique digit expansion (Every p-adic number has a unique digit expansion).

Verification

technique · direct
1.1L1givenalgebra

The Nth partial sum is (p−1)(1+p+⋯+pN)=pN+1−1. Its difference from −1 is pN+1, whose p-adic absolute value tends to 0. Hence the series converges to −1.

2.1step 1.1∎

Every digit is p−1, so by the uniqueness part of [L1] this is the digit expansion of −1.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

A square root of minus one in Q_5

Example

The element −1 is a square in Q5.

Facts & Assumptions

Given: The polynomial f(X)=X2+1 over Z5.

[L1]

For odd p, a unit of Zp is a square in Qp exactly when its residue class is a square in Fp× (Square criterion in Q_p for odd p).

[L2]

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

technique · direct
1.1L1givenalgebra

Modulo 5 one has 22≡−1. Since −1 is a unit, [L1] shows that −1 is a square in Q5.

2.1L2step 1.1algebra∎

Concretely, f(2)=5≡0(mod5) and f′(2)=4≢0(mod5), so [L2] produces a unique 5-adic root congruent to 2 modulo 5.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

There is no square root of p in Q_p

Example

For every prime p, the element p is not a square in Qp.

Facts & Assumptions

Given: A prime p.

[L1]

The odd-prime and 2-adic square criteria describe exactly which elements are squares (Square criterion in Q_p for odd p, Square criterion in Q_2).

Verification

technique · direct
1.1L1givencases

If p is odd, then p=p1⋅1 has odd valuation, so [L1] rules out its being a square in Qp.

1.2L1givencases

If p=2, then 2=21⋅1 also has odd valuation, so the 2-adic criterion in [L1] rules it out as well.

2.1step 1.1step 1.2cases-exhaustive∎

Hence no prime has a square root in its own p-adic field.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

Hensel lifting a simple root of X squared minus 2 in Z_7

Example

The congruence x2≡2(mod7) lifts to a root of X2−2 in Z7.

Facts & Assumptions

Given: The polynomial f(X)=X2−2 over Z7.

[L1]

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

technique · direct
1.1L1givenalgebra

The residue class 3 satisfies 32−2=7≡0(mod7), and f′(3)=6≢0(mod7). By [L1], there is a unique root a∈Z7 with a≡3(mod7).

2.1L1step 1.1algebra∎

The Newton step from a0=3 is a1=3−76, which is well defined in Q7 and already lies in the same residue class modulo 7; iterating stays in that class and converges to the lifted root from step 1.1.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The two-adic square test separates 17 and 5

Example

In Q2, the number 17 is a square but 5 is not.

Facts & Assumptions

Given: The 2-adic square criterion.

[L1]

An element 2nu with odd u is a square in Q2 exactly when n is even and u≡1(mod8) (Square criterion in Q_2).

Verification

technique · direct
1.1L1givenalgebra

One has 17=20⋅17 with 17≡1(mod8), so [L1] shows that 17 is a square in Q2.

2.1L1givenalgebra∎

One has 5=20⋅5 with 5≡5(mod8)≠1, so [L1] shows that 5 is not a square in Q2.

ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-04Open item page →

The same sequence behaves oppositely in the real and p-adic metrics

Example

For a fixed prime p, the sequence (pn)n≥0 tends to ∞ in the usual absolute value and to 0 in Qp.

Facts & Assumptions

Given: A prime p.

[L1]

∣p∣p=p−1 by definition of the p-adic absolute value (The p-adic absolute value on the rationals).

[L2]

Qp is the p-adic Cauchy-sequence quotient with its named isometric embedding of Q (The p-adic numbers as a metric completion).

Verification

technique · direct
1.1L1L2givenalgebra

By [L1], ∣pn∣p=p−n→0, so under the named isometric embedding the sequence converges to 0 in Qp.

2.1step 1.1algebra∎

In the usual absolute value, ∣pn∣∞=pn→∞, so the same sequence runs away instead of converging to 0.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-04Open item page →

Z_p is not the integral closure of Z in Q_p

Statement refuted

The ring Zp is the integral closure of Z inside Qp.

Facts & Assumptions

Given: The ring Zp⊆Qp.

[L1]

Zp sits inside Qp and every element of Zp 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).

[L2]

Being integral over Z means satisfying a monic polynomial with integer coefficients (Integral elements over a commutative ring and algebraic integers).

Counterexample

technique · direct
1.1L1givenalgebra

The map (εn)n≥0⟼∑n=0∞εnpn from {0,1}N to Zp is injective by uniqueness of digit expansions in [L1]. Therefore Zp is uncountable.

1.2L2algebra

The subset of Qp consisting of elements integral over Z is countable: there are only countably many monic polynomials with integer coefficients, and each has only finitely many roots in the field Qp.

2.1step 1.1step 1.2L1L2∎

Hence some element of Zp is not integral over Z. That element lies in Zp⊆Qp by [L1], so Zp cannot equal the integral closure of Z in Qp.

Sources