Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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 finite subextensions in a common field, [EE′:F]≤[E:F][E′:F]

Statement

Let E/F and E′/F be finite subextensions of a common field. Then their compositum is finite and

[EE′:F]≤[E:F][E′:F].

Facts & Assumptions

Given: Finite subextensions E/F and E′/F inside a field Ω.

[L1]

The compositum EE′ is the smallest subfield of Ω containing E∪E′ (The composite of two subfields is the subfield generated by their union).

[L2]

Extension degree is the size of a finite basis (The degree [K:F]=dim⁡FK of a finite field extension).

[L3]

Assuming the Axiom of Choice, if S⊆V spans V then there is a basis B of V with B⊆S (Every spanning subset of a vector space contains a basis).

[L4]

Every finite extension is algebraic (Every finite field extension is algebraic).

[L5]

A field generated by finitely many algebraic elements is finite over the base (An extension generated by finitely many algebraic elements is finite).

Proof

technique · direct
1.1givenL2algebra

Choose F-bases (u1,…,um) of E and (v1,…,vn) of E′. The F-span A of the mn products uivj contains E and E′ and is closed under addition and multiplication, because products are reduced separately in the two bases.

2.1step 1.1L1L4L5

By [L4], every ui and vj is algebraic over F, so [L5] makes EE′=F(u1,…,um,v1,…,vn) finite over F. Every r∈A⊆EE′ is therefore algebraic over F.

3.1step 2.1algebra

If 0≠r∈A, take a nonzero annihilating polynomial, factor out its largest power of t, and cancel the corresponding nonzero power of r in the ambient field. This gives c0+c1r+⋯+cdrd=0 with c0≠0. Then r−1=−c0−1(c1+c2r+⋯+cdrd−1)∈A, so A is a field.

4.1step 1.1step 3.1L1

Since A is a field containing E∪E′, [L1] gives EE′⊆A; the reverse inclusion is clear from the product span, so A=EE′.

5.1step 4.1L2L3∎

The mn products span EE′. By [L3] they contain a basis of at most mn elements, so [L2] yields [EE′:F]≤mn=[E:F][E′:F].

Depends on

Used by

Dependency tree · two levels

18 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