Alphabeta MathHow 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 multiplicative group of a finite field is cyclic
Statement
The multiplicative group of every finite field is cyclic.
Facts & Assumptions
Given: A finite field .
A finite field has a finite underlying set (Finite fields and their order).
Every field is an integral domain, and its nonzero elements are its units (Every field is a commutative ring with ; it is an integral domain, and it is a commutative division ring).
Every finite subgroup of the unit group of an integral domain is cyclic (Every finite subgroup of the unit group of an integral domain is cyclic).
Proof
By [L2], is the unit group of the integral domain . It is finite by [L1].
Apply [L3] to the finite subgroup of itself to conclude that it is cyclic.
Depends on
Used by
- Every finite extension of a finite field is simple Corollary
- For every finite field F_q and every n≥1, a monic irreducible polynomial of degree n exists Corollary
- F₄=F₂[t]/(t²+t+1) with complete addition and multiplication tables Example
- F₉=F₃[t]/(t²+1) and a generator of its multiplicative group Example
- Gaussian and eisenstein frobenius Example
- The affine group AGL(1,p) has one kernel-conjugacy class of complements to its translation subgroup Example
- The residue class of t generates F₈^× Example
- Lifting residue frobenius by galois conjugates Lemma
- Quadratic forms of dimension at least three over odd finite fields are isotropic Lemma
- A field with q elements is the splitting field of x^q-x over its prime subfield Proposition
Dependency tree · two levels
24 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
- K. Conrad, Finite Fields, Theorem 1.6 (standard reference, not scraped)