TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-02 (claude-opus-5)

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 Z + b Z = \gcd (a, b) Z$ and $a Z \cap b Z = lcm (a, b) Z$ ; equivalently, in $(Z, +)$ the subgroup generated by ${a, b}$ is $⟨ \gcd (a, b) ⟩$ and $⟨ a ⟩ \cap ⟨ b ⟩ = ⟨ lcm (a, b) ⟩$

Statement

Let $a, b \in Z$ , and put

$g Z : = {g k : k \in Z}, a Z + b Z : = {a x + b y : x, y \in Z} .$

Then $a Z + b Z$ and $a Z \cap b Z$ are subgroups of $(Z, +)$ (Subgroup), and

$a Z + b Z = \gcd (a, b) Z, a Z \cap b Z = lcm (a, b) Z$

(Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ , Common multiple, and the least common multiple $lcm (a, b)$ , taken to be $0$ when $a = 0$ or $b = 0$ ). Equivalently, in the group $(Z, +)$ ,

$⟨ {a, b} ⟩ = ⟨ \gcd (a, b) ⟩, ⟨ a ⟩ \cap ⟨ b ⟩ = ⟨ lcm (a, b) ⟩$

(The subgroup $⟨ S ⟩$ generated by a subset, the cyclic subgroup $⟨ g ⟩$ , and cyclic groups). Since $\gcd (a, b) \geq 0$ and $lcm (a, b) \geq 0$ , and every subgroup of $(Z, +)$ has exactly one nonnegative generator (Every subgroup of $(Z, +)$ is $⟨ n ⟩ = n Z$ for exactly one natural number $n$ ), these are identifications of subgroups by their canonical generator, not merely equalities of two sets that happen to coincide.

Facts & Assumptions

Given: Integers $a$ and $b$ ; $d : = \gcd (a, b)$ and $ℓ : = lcm (a, b)$ .

[L1]

$Z$ is a commutative ring: addition and multiplication are associative and commutative, $x + 0 = x$ , $x \cdot 1 = x$ , $x \cdot 0 = 0$ , multiplication distributes over addition, and every $x$ has an additive inverse; we write $u - v$ for $u + (- v)$ (The integers form a commutative ring, Arithmetic on the integers, The integers as equivalence classes of pairs of naturals).

[L2]

$(Z, +, 0)$ is an abelian group; $g Z = ⟨ g ⟩$ is a subgroup for every $g$ ; and every subgroup equals $ι (n) Z$ for exactly one $n \in N$ (Every subgroup of $(Z, +)$ is $⟨ n ⟩ = n Z$ for exactly one natural number $n$ , Group and abelian group).

[L3]

A subgroup contains the identity and is closed under the operation and under inverses; a nonempty $S \subseteq Z$ with $x - y \in S$ for all $x, y \in S$ is a subgroup of $(Z, +)$ (Subgroup, One-step subgroup test: a nonempty $H \subseteq G$ is a subgroup iff $g h^{- 1} \in H$ for all $g, h \in H$ ; the identity and the inverses of $H$ are then those of $G$ ).

[L4]

$⟨ S ⟩$ is the smallest subgroup containing $S$ : it contains $S$ and is contained in every subgroup containing $S$ (The subgroup $⟨ S ⟩$ generated by a subset, the cyclic subgroup $⟨ g ⟩$ , and cyclic groups).

[L5]

An intersection of subgroups is a subgroup (The intersection of a nonempty family of subgroups of $G$ is a subgroup of $G$ ).

[L6]

$u ∣ v$ means $v = u k$ for some $k \in Z$ ; equivalently $v \in u Z$ (Divisibility in $Z$ : $d ∣ a$ when $a = d q$ for some integer $q$ ).

[L7]

$\gcd (a, b) \geq 0$ and is a common divisor of $a$ and $b$ ; $\gcd (0, 0) = 0$ (Common divisor, and the greatest common divisor $\gcd (a, b)$ , with the convention $\gcd (0, 0) : = 0$ ).

[L8]

For $(a, b) \neq (0, 0)$ there are $x_{0}, y_{0}$ with $a x_{0} + b y_{0} = \gcd (a, b)$ (Bézout's identity: for integers $a, b$ not both zero, $\gcd (a, b)$ is the least positive element of ${a x + b y : x, y \in Z}$ ; in particular $a x + b y = \gcd (a, b)$ has an integer solution).

[L9]

$lcm (a, b) \geq 0$ and is a common multiple of $a$ and $b$ (Common multiple, and the least common multiple $lcm (a, b)$ , taken to be $0$ when $a = 0$ or $b = 0$ ).

[L10]

Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ (Every common multiple of $a$ and $b$ is a multiple of $lcm (a, b)$ , and $\gcd (a, b) \cdot lcm (a, b) = ∣ a b ∣$ ).

[L11]

The image of $ι : N \to Z$ is exactly the set of nonnegative integers, so every $x \geq 0$ is $ι (n)$ for a unique $n \in N$ (The naturals embed in the integers).

Proof

technique · direct

1.1

$I : = a Z + b Z$ is a subgroup of $(Z, +)$ : it contains $0 = a \cdot 0 + b \cdot 0$ , so is nonempty, and for $a x + b y$ and $a x^{'} + b y^{'}$ in $I$ the difference is $a (x - x^{'}) + b (y - y^{'}) \in I$ by distributivity, so the one-step test applies.

L1L3

1.2

$I \subseteq d Z$ . Since $d$ is a common divisor, write $a = d a_{1}$ and $b = d b_{1}$ ; then $a x + b y = d (a_{1} x + b_{1} y) \in d Z$ for all $x, y$ .

L1L6L7

1.3

$d \in I$ . If $(a, b) \neq (0, 0)$ this is [L8]. If $(a, b) = (0, 0)$ then $d = 0 = a \cdot 0 + b \cdot 0 \in I$ . The two cases are exhaustive.

L1L7L8

1.4

$a Z \cap b Z$ is a subgroup by [L2] and [L5], and by [L6] it is exactly the set of common multiples of $a$ and $b$ : $m \in a Z$ says $a ∣ m$ , and $m \in b Z$ says $b ∣ m$ .

L2L5L6

2.1

$I = ⟨ {a, b} ⟩$ . It contains $a = a \cdot 1 + b \cdot 0$ and $b = a \cdot 0 + b \cdot 1$ , so $⟨ {a, b} ⟩ \subseteq I$ by [L4]. Conversely any subgroup $H$ containing $a$ and $b$ contains $⟨ a ⟩ = a Z$ and $⟨ b ⟩ = b Z$ by [L2] and [L4], hence contains $a x + b y$ for all $x, y$ by closure under the operation; taking $H = ⟨ {a, b} ⟩$ gives $I \subseteq ⟨ {a, b} ⟩$ .

step 1.1L1L2L3L4

2.2

Hence $d Z = ⟨ d ⟩ \subseteq I$ , because $I$ is a subgroup containing $d$ and $⟨ d ⟩$ is the smallest such. With step 1.2, $I = d Z$ .

step 1.1step 1.2step 1.3L2L4

2.3

$ℓ Z \subseteq a Z \cap b Z$ : $ℓ$ is a common multiple by [L9], so $ℓ$ lies in the subgroup $a Z \cap b Z$ , and $ℓ Z = ⟨ ℓ ⟩$ is the smallest subgroup containing $ℓ$ .

step 1.4L2L4L9

3.1

$a Z \cap b Z \subseteq ℓ Z$ : every common multiple $m$ satisfies $ℓ ∣ m$ by [L10], that is $m \in ℓ Z$ . With step 2.3, $a Z \cap b Z = ℓ Z$ .

step 1.4step 2.3L6L10

4.1

Both identities are proved, and in group-theoretic form they read $⟨ {a, b} ⟩ = I = d Z = ⟨ d ⟩$ by step 2.1 and step 2.2, and $⟨ a ⟩ \cap ⟨ b ⟩ = a Z \cap b Z = ℓ Z = ⟨ ℓ ⟩$ by step 3.1 and [L2].

step 2.1step 2.2step 3.1L2

5.1

Finally $d \geq 0$ and $ℓ \geq 0$ , so each is $ι (n)$ for a natural $n$ by [L11], and by [L2] a subgroup of $(Z, +)$ has exactly one such generator; hence $d$ and $ℓ$ are the canonical generators of the two subgroups, and the identities identify the subgroups and not merely the underlying sets.

step 4.1L2L7L9L11∎

Remarks

This is the seam between the arithmetic and the group theory of this page, and it is the concrete shadow of the statement that $Z$ is a principal ideal domain. Read from left to right, it says that the set of integer combinations of $a$ and $b$ is exactly the set of multiples of their greatest common divisor — which is Bézout's identity and the divisibility characterisation of $\gcd$ packed into one equation between subgroups.
The classification is used for one thing only. Both inclusions above come from Bézout and divisibility; Every subgroup of $(Z, +)$ is $⟨ n ⟩ = n Z$ for exactly one natural number $n$ is invoked in step 5.1, for the uniqueness of the nonnegative generator, and nowhere else.
Boundary pairs. At $(a, b) = (0, 0)$ the theorem reads ${0} + {0} = 0 Z = {0}$ and ${0} \cap {0} = 0 Z$ , using $\gcd (0, 0) = 0$ and $lcm (0, 0) = 0$ ; at $a = 0$ and $b \neq 0$ it reads ${0} + b Z = ∣ b ∣ Z$ and ${0} \cap b Z = {0}$ . Both are true as stated, and neither needed a separate clause.

Depends on

Used by

Dependency tree · two levels

53 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

Bézout's identity (Wikipedia) (standard reference, not scraped)
Cyclic group (Wikipedia) (standard reference, not scraped)
Least common multiple (Wikipedia) (standard reference, not scraped)

aZ+bZ=gcd⁡(a,b) ZaZ+bZ=gcd(a,b)Z and aZ∩bZ=lcm⁡(a,b) ZaZ∩bZ=lcm(a,b)Z; equivalently, in (Z,+)(Z,+) the subgroup generated by {a,b}{a,b} is ⟨gcd⁡(a,b)⟩⟨gcd(a,b)⟩ and ⟨a⟩∩⟨b⟩=⟨lcm⁡(a,b)⟩⟨a⟩∩⟨b⟩=⟨lcm(a,b)⟩