Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-11
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 unit group modulo one hundred is isomorphic to C_20 times C_2

Example

In the unit group U(100), the class of 3 has order 20 and the class of −1 has order 2. Their subgroups form an internal direct product, so U(100)≅C20×C2, with invariant factors 2∣20.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Let n≥1 be an integer. Multiplication makes Z/n a commutative monoid with identity [1]n by thm-integers-modulo-n-basic-algebra. A class u∈Z/n is a unit when it is invertible in that monoid (def-invertible-element). The set of all units is (Z/n)×:={ u∈Z/n:some v∈Z/n satisfies uv=[1]n }. By lem-monoid-units-form-a-group, multiplication restricts to a group operation on (Z/n)×, called the unit group modulo n. The quotient Z/n is finite with cardinality n by thm-standard-representatives-modulo-n, and its unit set is a finite subset by thm-subset-of-a-finite-set. Euler's totient function is therefore defined for every positive integer n by φ(n):=∣(Z/n)×∣∈N (def-finite-cardinality). For n=1, the quotient has one element, which is its multiplicative identity and hence a unit, so φ(1)=1 follows from the definition. (The unit group (Z/n)× and Euler's totient φ(n)=∣(Z/n)×∣ for n≥1).

[L2]

Let G be a group and let N0,…,Nr−1 be normal subgroups, where r∈N. They form an internal direct product when they generate G and, for each i<r, Ni∩⟨Nj:j<r, j≠i⟩={e}. The empty family is an internal direct product of the trivial group. For two subgroups of an abelian group this says G=HK and H∩K={e}; in additive notation one writes G=H⊕K. Normal subgroups and generated subgroups are those of def-normal-subgroup and def-generated-subgroup, and the comparison product is def-external-direct-product-of-groups. (Internal direct products of finitely many normal subgroups).

[L3]

Let N0,…,Nr−1⊴G. The following are equivalent: the Ni form an internal direct product of G; every g∈G has a unique expression g=n0⋯nr−1 with ni∈Ni; and the multiplication map μ:∏i<rNi→G is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L4]

For every finite abelian group G there is a unique list 1<n1∣⋯∣nr such that G≅Cn1×⋯×Cnr. Moreover ∣G∣=n1⋯nr. The trivial group corresponds to the empty list and empty product. (Fundamental theorem of finite abelian groups: invariant-factor form).

Verification

technique · direct
1.1

Successive powers of 3 modulo 100 are 3,9,27,81,43,29,87,61,83,49,47,41,23,69,7,21,63,89,67,1. Thus the first positive exponent giving 1 is 20, so ord⁡(3)=20.

givenL1
2.1

The class of −1, represented by 99, has order 2. The list in step 1.1 contains all 20 elements of ⟨3⟩ and does not contain 99, so −1∉⟨3⟩. Hence the two cyclic subgroups intersect trivially.

step 1.1
3.1

Trivial intersection makes the 20⋅2=40 products distinct. A unit representative modulo 100 is divisible by neither 2 nor 5, since a multiple of either prime cannot have a product congruent to 1 modulo 100. Among 0,…,99, inclusion-exclusion leaves 100−50−20+10=40 representatives divisible by neither. Thus U(100) has at most 40 elements, so the displayed products exhaust it. The two subgroups therefore form an internal direct product; recognition gives the isomorphism, and 2∣20 gives the invariant-factor order.

step 2.1L1L2L3L4∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

22 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