Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck 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.

(Z,⋅,1) is a commutative monoid whose group of units is {1,−1}; equivalently u∣1 holds exactly for u=1 and u=−1

Statement

(Z,⋅,1), with the multiplication of Arithmetic on the integers, is a commutative monoid (Semigroup and monoid). Its group of units (Left inverse, right inverse, and invertible element of a monoid, The invertible elements of a monoid form a group under the restricted operation) is

Z×  =  { 1, −1 },

and these are two distinct elements. Equivalently, for u∈Z the condition u∣1 (Divisibility in Z: d∣a when a=dq for some integer q) holds exactly when u=1 or u=−1.

Facts & Assumptions

Given: Z with the operations of Arithmetic on the integers, and the embedding ι:N→Z, ι(k)=[(k,0)], of The naturals embed in the integers.

[L1]

Z is a commutative ring: multiplication is a function Z×Z→Z and is associative and commutative, x⋅1=x, and every x has an additive inverse −x, with −(−x)=x and (−x)(−y)=xy (The integers form a commutative ring, Arithmetic on the integers).

[L2]

The order on Z is total, antisymmetric and transitive, and positives are closed under multiplication; x<y means x≤y together with x≠y (The integers form a totally ordered ring, Order on the integers).

[L3]

A binary operation on a set S is a function S×S→S; a monoid is a set with an associative binary operation and a two-sided identity, and it is commutative when the operation is (Binary operation on a set; associativity, commutativity, and a subset closed under the operation, Left identity, right identity, and two-sided identity for a binary operation, Semigroup and monoid).

[L4]

In a monoid M, u is a unit when it has a two-sided inverse, and M× denotes the set of units; M× is a group under the restricted operation (Left inverse, right inverse, and invertible element of a monoid, The invertible elements of a monoid form a group under the restricted operation, Group and abelian group).

[L5]

u∣a means a=uv for some v∈Z (Divisibility in Z: d∣a when a=dq for some integer q).

[L8]

ι is injective, preserves addition, multiplication and order, and its image is exactly the set of nonnegative integers; ι(0)=0 and ι(1)=1 (The naturals embed in the integers, The integers as equivalence classes of pairs of naturals).

[L9]

On N: m<n if and only if σ(m)≤n (Discreteness: σ(n) is the immediate successor); 0=∅, 1=σ(0)={0} and 2=σ(1)={0,1}, so 1≠0 and 2≠0 (The natural numbers N (von Neumann)); and 0≤k for every k (Order on the natural numbers).

Proof

technique · direct
1.1

Multiplication on Z is a function Z×Z→Z, hence a binary operation, and it is associative and commutative; 1 is a two-sided identity, since x⋅1=x and, by commutativity, 1⋅x=x. So (Z,⋅,1) is a commutative monoid.

L1L3
1.2

For u∈Z, being a unit of this monoid means uv=1 for some v, the two equations uv=1 and vu=1 being the same by commutativity; and uv=1 for some v is precisely u∣1. So Z×={ u:u∣1 }.

L1L4L5
1.3

Both 1 and −1 lie in Z×: 1⋅1=1 and (−1)(−1)=1⋅1=1.

L1L4
1.4

0≤1, since 1=ι(1) lies in the image of ι, which is the set of nonnegative integers; hence ∣1∣=1. Also 1≠0, since ι is injective and 1≠0 in N.

L7L8
1.5

Discreteness of Z: if 0<x then 1≤x. Indeed x≥0, so x=ι(k) for some k∈N; k≠0 because ι(0)=0≠x; hence 0<k in N, so 1=σ(0)≤k, and applying ι, which preserves the order, gives 1=ι(1)≤ι(k)=x.

L2L8L9
1.6

1≠−1: otherwise 1+1=1+(−1)=0, whereas 1+1=ι(1)+ι(1)=ι(1+1)=ι(2) and ι(2)≠ι(0)=0 because ι is injective and 2≠0 in N.

L1L8L9
2.1

Let u∣1. Since 1≠0, [L6] gives u≠0 and ∣u∣≤∣1∣=1.

step 1.4L6
3.1

Also ∣u∣≥0 and ∣u∣≠0, so 0<∣u∣, whence 1≤∣u∣; with step 2.1 and antisymmetry this gives ∣u∣=1.

step 1.5step 2.1L2L7
4.1

From ∣u∣=1: if u≥0 then u=∣u∣=1, and if u≤0 then −u=∣u∣=1, so u=−(−u)=−1. By totality one of the two holds, so u=1 or u=−1.

step 3.1L1L2L7
5.1

Combining, Z×={ u:u∣1 }={1,−1}, a two-element set, and by [L4] it is a group under multiplication, with identity 1 and with each of its elements its own inverse.

step 1.2step 1.3step 4.1step 1.6L4∎

Remarks

Depends on

Used by

Dependency tree · two levels

47 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