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 degree of an intermediate field divides the degree of a finite extension
Statement
If and is finite, then and are finite and
Facts & Assumptions
Given: A tower with finite.
For finite subextensions the tower law is (Tower law for finite extensions: ).
Assuming the Axiom of Choice, if spans then there is a basis of with (Every spanning subset of a vector space contains a basis).
A linearly independent subset of a space spanned by vectors has at most elements (If has a spanning set with elements, then every linearly independent subset of is finite with at most elements; in particular has no linearly independent subset equinumerous with ).
Proof
Apply [L2] to the spanning set of the -vector space to obtain an -basis . This set is independent in the -space , so [L3] makes finite; hence is finite.
Any finite -basis of is also a finite -spanning set of . Applying [L2] over gives a finite -basis, so is finite.
The tower law [L1] now applies and writes as times the natural number , proving the divisibility.
Depends on
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
- Every spanning subset of a vector space contains a basis
- If $V$ has a spanning set with $n$ elements, then every linearly independent subset of $V$ is finite with at most $n$ elements; in particular $V$ has no linearly independent subset equinumerous with $\mathbb{N}$
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 63 results over 19 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
- A. W. Knapp, Basic Algebra, 2nd ed., Chapter IX, Section 1 (standard reference, not scraped)