Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-28
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.

12Z+18Z=6Z12\mathbb{Z} + 18\mathbb{Z} = 6\mathbb{Z} and 12Z18Z=36Z12\mathbb{Z} \cap 18\mathbb{Z} = 36\mathbb{Z}, the arithmetic of gcd\gcd and lcm\operatorname{lcm} read off the subgroups of (Z,+)(\mathbb{Z},+)

Example

Take a=12a = 12 and b=18b = 18. Then gcd(12,18)=6\gcd(12,18) = 6 and lcm(12,18)=36\operatorname{lcm}(12,18) = 36, and aZ+bZ=gcd(a,b)Za\mathbb{Z} + b\mathbb{Z} = \gcd(a,b)\,\mathbb{Z} and aZbZ=lcm(a,b)Za\mathbb{Z} \cap b\mathbb{Z} = \operatorname{lcm}(a,b)\,\mathbb{Z}; equivalently, in (Z,+)(\mathbb{Z},+) the subgroup generated by {a,b}\{a,b\} is gcd(a,b)\langle \gcd(a,b) \rangle and ab=lcm(a,b)\langle a \rangle \cap \langle b \rangle = \langle \operatorname{lcm}(a,b) \rangle turns these two numbers into two statements about subgroups of (Z,+)(\mathbb{Z},+):

12Z+18Z  =  6Z,12Z18Z  =  36Z.12\mathbb{Z} + 18\mathbb{Z} \;=\; 6\mathbb{Z}, \qquad 12\mathbb{Z} \cap 18\mathbb{Z} \;=\; 36\mathbb{Z} .

The first says that the integers expressible as 12x+18y12x + 18y are exactly the multiples of 66; the smallest positive one is 6=12(1)+1816 = 12 \cdot (-1) + 18 \cdot 1. The second says that the integers divisible by both 1212 and 1818 are exactly the multiples of 3636. The product check is gcdlcm=636=216=1218\gcd \cdot \operatorname{lcm} = 6 \cdot 36 = 216 = |12 \cdot 18|.

Numerals. For kNk \in \mathbb{N} the symbol kk inside Z\mathbb{Z} means ι(k)\iota(k), the embedding of The naturals embed in the integers.

Facts & Assumptions

Given: The integers 1212, 1818, 66, 3636 and 216216, and gZ={gk:kZ}g\mathbb{Z} = \{\, gk : k \in \mathbb{Z} \,\}.

[L1]

Z\mathbb{Z} is a commutative ring: multiplication is associative and commutative, x1=xx \cdot 1 = x, x(1)=xx \cdot (-1) = -x, and multiplication distributes over addition (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L6]

If xz=yzxz = yz and z0z \ne 0 then x=yx = y (The integers have no zero divisors; multiplicative cancellation).

Verification

technique · direct
1.1

gcd(12,18)=6\gcd(12,18) = 6. Indeed 606 \ge 0; 12=6212 = 6 \cdot 2 and 18=6318 = 6 \cdot 3, so 6126 \mid 12 and 6186 \mid 18; and 12(1)+181=12+18=612 \cdot (-1) + 18 \cdot 1 = -12 + 18 = 6, so every common divisor of 1212 and 1818 divides 66 by [L3]. By [L2] this characterises gcd(12,18)\gcd(12,18).

L1L2L3algebra
2.1

lcm(12,18)=36\operatorname{lcm}(12,18) = 36. By [L4], gcd(12,18)lcm(12,18)=1218=216=216\gcd(12,18)\operatorname{lcm}(12,18) = |12 \cdot 18| = |216| = 216; with step 1.1 this reads 6lcm(12,18)=2166 \cdot \operatorname{lcm}(12,18) = 216. Since 636=2166 \cdot 36 = 216 and 606 \ne 0, cancellation gives lcm(12,18)=36\operatorname{lcm}(12,18) = 36.

step 1.1L1L4L5L6algebra
3.1

Applying [L7] with a=12a = 12 and b=18b = 18: 12Z+18Z=gcd(12,18)Z=6Z12\mathbb{Z} + 18\mathbb{Z} = \gcd(12,18)\mathbb{Z} = 6\mathbb{Z} and 12Z18Z=lcm(12,18)Z=36Z12\mathbb{Z} \cap 18\mathbb{Z} = \operatorname{lcm}(12,18)\mathbb{Z} = 36\mathbb{Z}.

step 1.1step 2.1L7
4.1

Both right-hand sides are written with their canonical generator: 606 \ge 0 and 36036 \ge 0, and by [L8] no other nonnegative integer generates the same subgroup, so the two identities pin the subgroups down rather than merely exhibiting one description of each.

step 3.1L8
5.1

The two statements read concretely: an integer is of the form 12x+18y12x + 18y exactly when it is a multiple of 66 — with 6=12(1)+1816 = 12 \cdot (-1) + 18 \cdot 1 the smallest positive such value — and an integer is divisible by both 1212 and 1818 exactly when it is a multiple of 3636, which is the divisibility clause of [L4] instantiated here.

step 1.1step 3.1L3L4

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 82 results over 26 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources