Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Z sits inside Q as a subring that is not a subfield, so the inverse-closure clause of the subfield definition is doing work

Example

The integers are not literally a subset of the rationals in this library: Q is a set of equivalence classes of pairs of integers, so "Z inside Q" means the image of the embedding j:Z→Q, j(k)=[(k,1)], of The integers embed in the rationals. Write K:=j(Z)⊆Q and let 2:=1+1 in Z. Then:

  1. K is a subring of the ring Q (Subring: a subset containing 1R and closed under addition, additive inverses and multiplication);
  2. K is not a subfield of Q (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations): the element j(2) is a nonzero member of K whose inverse in Q does not lie in K;
  3. so the inverse-closure clause (K2) of Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations is not implied by being a subring.

Facts & Assumptions

Given: The embedding j:Z→Q, j(k)=[(k,1)], and K=j(Z); the numeral 2=1+1 in Z (The integers as equivalence classes of pairs of naturals).

[L1]

j is injective and preserves addition and multiplication; composing with the embedding of N it also preserves order (The integers embed in the rationals).

[L6]

A subfield of a field F is a subring closed under the inverses of its nonzero elements (Subfield: a subring of a field closed under inverses of its nonzero elements, and therefore a field with the restricted operations).

[L8]

ι:N→Z is injective and order preserving with ι(0)=0, ι(1)=1 (The naturals embed in the integers, Arithmetic on the integers).

Verification

technique · direct
1.1

j(0Z)=0Q and j(1Z)=1Q. The first: j(0)+j(0)=j(0+0)=j(0)=j(0)+0Q, and cancelling j(0) gives j(0)=0Q. The second: j(1)j(1)=j(1⋅1)=j(1), and j(1)≠0Q because 1Z≠0Z and j is injective with j(0Z)=0Q; so j(1)=1Q. Consequently j(−b)=−j(b) for every b, since j(b)+j(−b)=j(0)=0Q.

L1L2L3L4L8
1.2

0<1<2 in Z, and −1<0: the first because 1=ι(1) is nonnegative and 1≠0 by injectivity of ι, the second by adding 1 to 0<1, and the third by adding −1 to 0<1. Hence 2≠0, 2≠1 and 2≠−1, so 2∉Z× by [L7].

L3L7L8
2.1

1Q=j(1Z)∈K by step 1.1; and for u=j(a), v=j(b) in K we have u−v=j(a)+(−j(b))=j(a)+j(−b)=j(a−b)∈K and uv=j(a)j(b)=j(ab)∈K. So K is a subring of Q by [L5]. This is claim 1.

step 1.1L1L2L5
2.2

j(2)≠0Q: by step 1.2, 2≠0Z, and j is injective with j(0Z)=0Q by step 1.1. So j(2) has an inverse j(2)−1 in the field Q.

step 1.1step 1.2L1L2
3.1

j(2)−1∉K. Suppose it were, say j(2)−1=j(m) for some m∈Z. Then j(2m)=j(2)j(m)=1Q=j(1Z), so 2m=1Z by injectivity of j; commutativity also gives m2=1, so m is a two-sided inverse and 2 is a unit of Z, contradicting step 1.2.

step 1.1step 1.2step 2.2L1L3L7
4.1

Claims 2 and 3: by claim 1 the set K is a subring of Q, and by steps 2.2 and 3.1 it contains a nonzero element whose inverse in Q is not in K; so (K2) of [L6] fails and K is not a subfield. Since K satisfies (K1), the clause (K2) is not implied by (K1).

step 2.1step 2.2step 3.1L6∎

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

76 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