Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-03 (gpt-5.6-sol-codex-subscription)
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.

Every positive divisor of the order of a finite cyclic group occurs as the order of a subgroup

Example

Let G=gG=\langle g\rangle be finite of order nn. If the positive integer dd divides nn, write n=dqn=dq with q>0q>0. Then

H=gqH=\langle g^q\rangle

is a subgroup of order dd.

Facts & Assumptions

Given: A finite cyclic group G=gG=\langle g\rangle of order nn, and positive integers d,qd,q satisfying n=dqn=dq.

[L4]

If a positive natural exponent rr satisfies xr=ex^r=e, then xx has finite order, and its order is the least such positive exponent and is at most rr; if there is no such exponent, its order is \infty (The order G|G| of a finite group and the order ord(g)\operatorname{ord}(g) of an element, with ord(g)=\operatorname{ord}(g) = \infty when no positive power of gg is the identity).

Verification

technique · direct
1.1

Put h=gqh=g^q. Then hd=gqd=gn=eh^d=g^{qd}=g^n=e, so hh has finite order and ord(h)d\operatorname{ord}(h)\le d.

givenL1L2L3L4
1.2

If hk=eh^k=e for a positive natural kk, then gqk=eg^{qk}=e, so [L1] gives nqkn\mid qk. Thus qk=nm=qdmqk=n m=qdm for some integer mm, and cancellation by the positive integer qq gives k=dmk=dm.

L1L2L3
2.1

No positive k<dk<d satisfies hk=eh^k=e: step 1.2 would give k=dmk=dm; positivity forces m1m\ge1, hence kdk\ge d, a contradiction. Together with step 1.1, this gives ord(h)=d\operatorname{ord}(h)=d.

step 1.1step 1.2L3
3.1

Therefore H=hH=\langle h\rangle is a subgroup with H=ord(h)=d|H|=\operatorname{ord}(h)=d.

step 2.1F1

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: 69 results over 20 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