Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

The invertible elements of a monoid form a group under the restricted operation

Statement

Let (M,∗,e) be a monoid (Semigroup and monoid) and let M× be its set of invertible elements (Left inverse, right inverse, and invertible element of a monoid). Then M× contains e, is closed under ∗ and under inversion, and (M×,∗,e) is a group (Group and abelian group), called the group of units of M.

Moreover M is itself a group exactly when M×=M.

Facts & Assumptions

Given: A monoid (M,∗,e) and its set of units M×={ g∈M:g has a two-sided inverse in M } (Left inverse, right inverse, and invertible element of a monoid).

[L1]

∗ is associative and e is a two-sided identity for it (Semigroup and monoid).

[L3]

A group is a monoid in which every element is invertible (Group and abelian group).

[L4]

If a subset of M is closed under ∗, the restriction of ∗ to it is a binary operation on it, and associativity is inherited (Binary operation on a set; associativity, commutativity, and a subset closed under the operation).

Proof

technique · direct
1.1

e∈M×, since e∗e=e exhibits e as a two-sided inverse of itself.

L1
1.2

Let g,h∈M× with inverses g−1,h−1. Then (g∗h)∗(h−1∗g−1)=g∗(h∗h−1)∗g−1=g∗e∗g−1=g∗g−1=e and (h−1∗g−1)∗(g∗h)=h−1∗(g−1∗g)∗h=h−1∗e∗h=h−1∗h=e, the regroupings being licensed by associativity. So h−1∗g−1 is a two-sided inverse of g∗h in M, whence g∗h∈M×.

L1L2
1.3

Let g∈M×. The equations g−1∗g=e=g∗g−1 read with g−1 as the element being inverted say that g is a two-sided inverse of g−1; hence g−1∈M×.

L2
1.4

If M×=M then M is a monoid in which every element is invertible, that is a group; conversely if M is a group then every element of M is invertible, so M⊆M×, and M×⊆M always, giving M×=M.

L3given
2.1

By step 1.2 the set M× is closed under ∗, so ∗ restricts to a binary operation on M×, associative because it is associative on M.

step 1.2L1L4
3.1

By step 1.1 the element e lies in M×, and e∗x=x=x∗e holds for every x∈M× because it holds for every x∈M; so (M×,∗,e) is a monoid.

step 1.1step 2.1L1
4.1

Every g∈M× is invertible in M×: its inverse g−1 lies in M× by step 1.3, and the two equations g−1∗g=e=g∗g−1 are equations between elements of M×. Hence (M×,∗,e) is a group.

step 1.3step 3.1L3
5.1

The units of M form a group under the restricted operation, with the same identity, and this group is all of M exactly when M is a group.

step 3.1step 4.1step 1.4∎

Remarks

  • The point of step 4.1 is that invertibility is a condition relative to a containing structure: g is a unit of M× because the witness g−1 was shown to lie in M×, not merely in M. Skipping step 1.3 would leave a genuine gap.

  • The lemma is the source of most of the small examples of groups: the units of (Z,⋅) are {1,−1}, and the units of a field under multiplication are exactly the nonzero elements.

Depends on

Used by

Dependency tree · two levels

9 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