Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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=⟨g⟩ be finite of order n. If the positive integer d divides n, write n=dq with q>0. Then

H=⟨gq⟩

is a subgroup of order d.

Facts & Assumptions

Given: A finite cyclic group G=⟨g⟩ of order n, and positive integers d,q satisfying n=dq.

[L3]
[L4]

If a positive natural exponent r satisfies xr=e, then x has finite order, and its order is the least such positive exponent and is at most r; if there is no such exponent, its order is ∞ (The order ∣G∣ of a finite group and the order ord⁡(g) of an element, with ord⁡(g)=∞ when no positive power of g is the identity).

Verification

technique · direct
1.1

Put h=gq. Then hd=gqd=gn=e, so h has finite order and ord⁡(h)≤d.

givenL1L2L3L4
1.2

If hk=e for a positive natural k, then gqk=e, so [L1] gives n∣qk. Thus qk=nm=qdm for some integer m, and cancellation by the positive integer q gives k=dm.

L1L2L3
2.1

No positive k<d satisfies hk=e: step 1.2 would give k=dm; positivity forces m≥1, hence k≥d, a contradiction. Together with step 1.1, this gives ord⁡(h)=d.

step 1.1step 1.2L3
3.1

Therefore H=⟨h⟩ is a subgroup with ∣H∣=ord⁡(h)=d.

step 2.1F1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

49 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