Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 E/F finite Galois and L/F finite inside a common field, [EL:F]=[E:F][L:F]/[EL:F]

Statement

Let E/F be a finite Galois extension (Finite Galois extensions and Gal(K/F)) and L/F a finite extension (The degree [K:F]=dimFK of a finite field extension), both subfields of a common field. Then the compositum EL is finite over F and

[EL:F]=[E:F][L:F][EL:F].

Only one of the two extensions is required to be Galois.

Facts & Assumptions

Given: Subfields E and L of a common field, both containing F, with E/F finite Galois and L/F finite; EL is a subfield containing F and contained in E, hence an intermediate field of E/F.

[L1]

For E/F finite Galois and L/F an extension inside a common overfield, EL/L is finite Galois and restriction gives Gal(EL/L)Gal(E/EL) (The Galois translation theorem).

[L2]

If K/F is finite Galois and FEK, then K/E is finite Galois (A finite Galois extension is Galois over every intermediate field).

[L3]

For fields FKM with K/F and M/K finite, M/F is finite and [M:F]=[M:K][K:F] (Tower law for finite extensions: [L:F]=[L:K][K:F]).

[L4]

For finite subextensions E/F and E/F of a common field, the compositum is finite and [EE:F][E:F][E:F] (For finite subextensions in a common field, [EE:F][E:F][E:F]).

[L5]

For a finite Galois extension M/K one has Gal(M/K)=[M:K] (Equivalent characterizations of a finite Galois extension).

Proof

technique · direct
1.1

EL is an intermediate field of E/F, so E/(EL) is finite Galois by [L2].

L2given
1.2

By [L4] the compositum EL is finite over F.

L4given
1.3

Applying [L3] to FELE gives [E:F]=[E:EL][EL:F], so [E:EL]=[E:F]/[EL:F].

L3given
2.1

By [L1] the extension EL/L is finite Galois with Gal(EL/L)Gal(E/EL), so [L5] applied to both sides gives [EL:L]=Gal(EL/L)=Gal(E/EL)=[E:EL].

step 1.1step 1.2L1L5
3.1

Applying [L3] to FLEL and substituting steps 2.1 and 1.3 gives [EL:F]=[EL:L][L:F]=[E:EL][L:F]=[E:F][L:F]/[EL:F].

step 2.1step 1.3L3

Remarks

  • The Galois hypothesis is not decoration. Without it the formula fails: over F=Q take E=Q(23) and L=Q(ω23) inside a splitting field of t32, where ω is a primitive cube root of unity. Both have degree three over Q, since t32 is irreducible there. The compositum contains ω=(ω23)/23, hence contains the splitting field Q(23,ω) and equals it, so [EL:Q]=6. And EL=Q: its degree over Q divides 3 by the tower law, and it cannot be 3, since E=EL=L would put ω in E and force [E:Q]6. The formula would predict 9. Neither E nor L is Galois over Q.

Depends on

Used by

Dependency tree · two levels

26 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