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.
has four embeddings into
Example
The field has degree four over and has four embeddings into an algebraic closure. They are the independent sign choices
Facts & Assumptions
Given: Positive real square roots and an algebraic closure .
Eisenstein's criterion proves the irreducibility of the integer polynomials used below (Eisenstein criterion over the integers).
A simple algebraic extension has the power basis and degree of the minimal polynomial (A simple algebraic extension is its minimal-polynomial quotient and has power basis and degree ).
Ordinary degrees multiply in finite towers (Tower law for finite extensions: ).
Embeddings of a simple extension correspond to distinct roots of its minimal polynomial (-embeddings of into an algebraically closed field correspond to the distinct roots of ).
Restriction partitions embeddings in a finite tower into equal extension fibres (Restriction partitions embeddings in a finite tower into extension fibres).
The notation denotes the subfield generated by the named elements (Field extensions, generated subrings , generated subfields , and simple extensions).
Verification
Eisenstein at , , and makes , , and irreducible over by [L1]. Thus none of is rational, and [L2] gives the basis of .
If with , squaring and using the basis gives . If , then is rational; if , then is a rational square root of . Both contradict step 1.1. Hence has no root in and is irreducible there.
By [L2] the second tower step has degree two, and [L3] gives .
The first square root has two distinct images by [L4]. Over each image of , the second square root has the two distinct images ; [L5] shows these fibres exhaust all extensions. Thus the four independent sign choices are exactly the four embeddings.
Depends on
- $F$-embeddings of $F(\alpha)$ into an algebraically closed field correspond to the distinct roots of $m_{\alpha}$
- Restriction partitions embeddings in a finite tower into extension fibres
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- A simple algebraic extension is its minimal-polynomial quotient and has power basis $1,a,\ldots,a^{n-1}$ and degree $n$
- Field extensions, generated subrings $F[S]$, generated subfields $F(S)$, and simple extensions
- Eisenstein criterion over the integers
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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
- P. L. Clark, Field Theory, Chapter 4 (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, Chapters 2 to 6 (standard reference, not scraped)