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.
For the image of in is generated by
Statement
Let be a finite field of order (Finite fields and their order) and let with (Coprime integers: ). Then the image of the embedding
of is Galois and embeds its Galois group into is the cyclic subgroup generated by , and
the multiplicative order of in (The order of a finite group and the order of an element, with when no positive power of is the identity).
Facts & Assumptions
Given: A finite field of order , of characteristic with a power of (Every finite field has order for a unique prime characteristic and positive integer ), and an integer with ; the extension (The cyclotomic extension as a splitting field of ).
For a field and with , the extension is finite Galois and , determined by on a primitive -th root of unity, is an injective homomorphism into with for every ( is Galois and embeds its Galois group into ).
An extension of finite fields of degree is Galois with cyclic of order , where (A finite extension of a finite field of order is Galois with cyclic Galois group generated by , The relative Frobenius of an extension of finite fields).
For and , the class is a unit of if and only if (For , is a unit if and only if , The unit group and Euler's totient for ).
For a finite Galois extension one has (Equivalent characterizations of a finite Galois extension, The degree of a finite field extension).
Proof
The characteristic divides , and , so ; hence [L1] applies to and is finite Galois over . Also is a unit of by [L3].
is a finite field: it is a finite extension of the finite field by step 1.1, so it is a finite-dimensional -vector space over a finite field and therefore has finitely many elements. By [L2], with .
The exponent attached to by [L1] is , since for a primitive -th root of unity . Because the embedding is a homomorphism and is generated by , the image is the subgroup of generated by .
The embedding is injective, so equals the order of , which is ; and by [L4]. Hence .
Remarks
- What the coprimality hypothesis does. It makes a unit, so that the subgroup it generates is defined, and it puts the extension inside the scope of [L1] by ruling out . Without it the group collapses onto for the prime-to- part of (In characteristic the only -th root of unity is , and ), and the statement is about rather than .
Depends on
- $K(\mu_n)/K$ is Galois and $\sigma\mapsto a_\sigma$ embeds its Galois group into $(\mathbb Z/n)^\times$
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- The relative Frobenius $x\mapsto x^q$ of an extension of finite fields
- A finite extension of a finite field of order $q$ is Galois with cyclic Galois group generated by $x\mapsto x^q$
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- For $n\ge1$, $[a]_n$ is a unit if and only if $\gcd(a,n)=1$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- The degree $[K:F]=\dim_F K$ of a finite field extension
- Every finite field has order $p^n$ for a unique prime characteristic $p$ and positive integer $n$
- Finite fields and their order
- Equivalent characterizations of a finite Galois extension
- Coprime integers: $\gcd(a,b) = 1$
Used by
- F₃(μ₅)capF₃(μ₇) is larger than F₃ although five and seven are coprime Counterexample
- Φ₅ has four roots in F₁₁ Example
- Φ₇ factors over F₂ into the two monic irreducible cubics Example
- For gcd(n,q)=1 the reduction of Φₙ in F_q[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n Theorem
Dependency tree · two levels
71 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, Cyclotomic Extensions (expository blurb), Theorem 2.10 (standard reference, not scraped)
- K. Conrad, Finite Fields (expository blurb), Theorem 5.6 (standard reference, not scraped)