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 residue class of generates
Example
In , the residue class of has order and generates .
Facts & Assumptions
Given: The quotient and the class .
A polynomial quotient over a field is a field exactly when its modulus is irreducible (For a nonconstant in , the ideal is maximal and is a field exactly when is irreducible).
An irreducible cubic quotient has the power basis (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
The ring is a field (For every prime , the two operations on make it a field).
The nonzero elements of a finite field form a cyclic group (The multiplicative group of a finite field is cyclic).
Verification
The cubic has no root in , so [L1] and [L3] make the quotient a field, and [L2] gives its eight elements. The defining relation is .
Reduction gives , , , , , , , and .
The first seven displayed powers are distinct and are all nonzero elements, so has order and generates , in agreement with [L4].
Depends on
- For a nonconstant $p$ in $F[x]$, the ideal $(p)$ is maximal and $F[x]/(p)$ is a field exactly when $p$ is irreducible
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- The multiplicative group $\mathbb F_q^\times$ of a finite field is cyclic
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: 90 results over 14 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
- K. Conrad, Finite Fields, Section 1 (standard reference, not scraped)