Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)audited 2026-10-02
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.

Integral basis and discriminant of a coprime-discriminant compositum

Statement

Let K and L be number fields inside a common algebraic closure, with compositum KL, let [KL:Q]=[K:Q] [L:Q], let α1,…,αm and β1,…,βn be integral bases of OK and OL, and suppose gcd⁡(dK,dL)=1. Then

OKL=OKOL,

the products αiβj form an integral basis of OKL, and

dKL=dK[L:Q] dL[K:Q].

Facts & Assumptions

Given: Number fields K,L inside a fixed algebraic closure of Q, with m:=[K:Q], n:=[L:Q], compositum KL, [KL:Q]=mn, integral bases α1,…,αm of OK and β1,…,βn of OL, and gcd⁡(dK,dL)=1.

[F1]

OK and OL are free Z-modules of ranks m and n, freely generated by the given integral bases (The ring of integers has rank the degree, Integral and power integral bases); OKL is free of rank mn.

[F2]

Degrees multiply in a tower and equal the dimension of the top field over the bottom one (Tower law for finite extensions: [L:F]=[L:K][K:F], The degree [K:F]=dim⁡FK of a finite field extension): [KL:L]=m and [KL:K]=n because [KL:Q]=[KL:L] [L:Q] and [L:Q]=n.

[F3]

The algebraic integers form a subring of C (Integral elements over a nonzero base ring form a subring, Integral elements over a commutative ring and algebraic integers); if γ is a root of a monic polynomial in Z[t] then so is u(γ) for every field homomorphism u fixing Z, because u commutes with the polynomial expression.

[F4]

OL is the integral closure of Z in L (Ring of integers, Integral closure in an extension ring and integrally closed domains), and it is integrally closed in L (The integral closure of a domain in a field extension is integrally closed). Hence L∩Z‾=OL, an element of OL has integer coordinates in the integral basis β1,…,βn, and a rational algebraic integer is an integer (The rational algebraic integers are exactly the integers).

[F5]

For a number field F of degree r a Q-basis x1,…,xr has discriminant disc⁡(x1,…,xr)=det⁡(σi(xj))2≠0, the determinant being taken over the r distinct embeddings F→C (Embedding determinant formula); for an integral basis this number is the well-defined nonzero integer dF (Discriminant of a basis and order, Number-field discriminant is well-defined and nonzero). In particular dK=D2 for D=det⁡(σk(αi)) and dK,dL≠0.

[F6]

If (u1,…,ur) is an F-basis of K and (v1,…,vs) is a K-basis of L, then the products uivj form an F-basis of L (Products of bases form a basis in a tower of finite extensions).

[F7]

If an m-dimensional vector space has a spanning list of m vectors, then that list is a basis: a dependence lets one vector be solved for in terms of the others, leaving an (m−1)-element spanning set, which cannot span a space containing an independent m-element basis by the finite-bound corollary. A basis is an independent spanning set (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 N, Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis).

[F8]

If a positive integer r and a finite list of integers aij have no common prime divisor, then repeated applications of integer Bézout give integers c,bij with cr+∑i,jbijaij=1. Also, gcd⁡(dK,dL)=1 gives integers u,v with u dK+v dL=1 (Bézout's identity: for integers a,b not both zero, gcd⁡(a,b) is the least positive element of { ax+by:x,y∈Z }; in particular ax+by=gcd⁡(a,b) has an integer solution).

[F9]

Q has characteristic zero and is perfect (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect), so the finite extension K/Q is simple: K=Q(α) for some α, with minimal polynomial f∈Q[t] of degree m and K≅Q[t]/(f) (Every finite extension of a perfect field is simple, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F10]

det⁡(S∘T)=det⁡(S)det⁡(T) for endomorphisms of a finite-dimensional space (Determinant multiplicativity follows from the top exterior power), and simultaneous reordering of the rows and columns of a square matrix does not change its determinant, being a similarity by a permutation matrix (Similar matrices over a commutative ring have the same determinant). The determinant of a matrix is given by the Leibniz sum ∑πsgn⁡(π)∏iaπ(i),i (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

Proof

technique · direct
1.1F1F2given

By [F1] the given bases are Q-bases of K and L, and [F2] gives [KL:L]=m and [KL:K]=n.

1.2F2F9given

Every embedding σ:K→C extends to an embedding σ~:KL→C with σ~∣L=idL. Indeed, by [F9] write K=Q(α) with minimal polynomial f of degree m; then KL=L(α), and [L(α):L]=m=deg⁡f shows that f has no factor of intermediate degree over L, so f is irreducible over L and KL≅L[t]/(f) as L-algebras. The evaluation homomorphism L[t]→C, t↦σ(α), kills f because σ fixes Q and f(α)=0; it therefore induces the required σ~ under the isomorphism L[t]/(f)≅KL.

2.1F7F2step 1.1given

Put V:=∑i=1mLαi⊆KL. Since α1,…,αm are a Q-basis of K, each product αiαj is a Q-linear combination of them; the same structure constants lie in L, so V is closed under multiplication. Also 1∈V, and V contains both L and K. It is finite-dimensional over L. For each nonzero x∈V, multiplication by x is an injective L-linear map V→V, because V lies in the field KL; finite dimensionality makes the map surjective, so some y∈V satisfies xy=1. Thus V is a field containing K and L, hence V=KL. By [F2] it has L-dimension m. Its m elements αi span V; if they were dependent, a nonzero coefficient in a dependence relation could be inverted in L to express one αi in terms of the others, so the remaining m−1 vectors would still span V. But an m-element basis of V is an independent subset of a space with that (m−1)-element spanning set, contradicting [F7]. Thus the αi are independent and spanning, hence an L-basis by [F7]. The symmetric argument with W:=∑j=1nKβj shows that β1,…,βn form a K-basis of KL by the same finite argument.

3.1F6step 2.1

Applying [F6] to the tower Q⊆L⊆KL with the Q-basis β1,…,βn of L and the L-basis α1,…,αm of KL, the products αiβj form a Q-basis of KL; in particular they are Q-linearly independent and there are mn of them.

3.2step 2.1F4given

Let γ∈OKL. By step 2.1 there are unique x1,…,xm∈L with γ=∑ixiαi. Each xi lies in L=Frac⁡(OL), so there are integers aij and a positive integer r with xi=∑j(aij/r)βj; dividing out common factors, we may assume that no prime divides r and all aij simultaneously.

4.1F3F5step 3.2step 1.2

Let σ1,…,σm be the distinct embeddings of K into C and let σ~k extend σk as in step 1.2. Applying σ~k to γ=∑ixiαi and using σ~k∣L=id together with xi∈L gives the linear system ∑iσk(αi)xi=σ~k(γ), k=1,…,m. Its coefficient matrix M:=(σk(αi)) has determinant D with D2=dK≠0 by [F5]; the entries σk(αi) of M are algebraic integers, and so are the entries σ~k(γ), by [F3] applied to the integral elements αi∈OK and γ∈OKL.

5.1F3F5F10step 4.1

Cramer's rule applied to the system of step 4.1 gives D xi=Di, where Di is the determinant of a matrix with algebraic-integer entries; hence D and every Di are algebraic integers by [F3], and Δxi=D⋅Di is an algebraic integer, where Δ:=D2=dK is a nonzero integer.

6.1F4step 3.2step 5.1

By step 3.2, Δxi=∑j(Δaij/r)βj lies in L, so Δxi∈L∩Z‾=OL by step 5.1 and [F4]. As β1,…,βn is an integral basis, the rational numbers Δaij/r are integers; equivalently r∣Δaij=dKaij for all i,j.

7.1F8step 3.2step 6.1

The denominator was reduced in step 3.2, so no prime divides r and every aij; therefore their common gcd is 1. By [F8], choose integers c,bij with cr+∑i,jbijaij=1. Multiplying by dK and using r∣dKaij from step 6.1 shows that every term on the left is divisible by r, hence r∣dK.

8.1F8step 3.2step 2.1step 6.1step 7.1given

Regroup the same expansion from step 3.2 as γ=∑jyjβj, where yj=∑i(aij/r)αi∈K. The symmetric trace-matrix argument, now using the K-basis αi and the L-basis βj from step 2.1, gives r∣dLaij for every same coefficient aij. The same reduced-denominator identity of [F8] therefore gives r∣dL. Together with step 7.1 and gcd⁡(dK,dL)=1, this implies r=1. Thus γ=∑i,jaijαiβj∈OKOL for every γ∈OKL, proving OKL⊆OKOL.

9.1F3step 3.1step 8.1

Conversely OKOL⊆OKL: products and sums of integral elements are integral by [F3], and they lie in KL. With step 8.1 this gives OKL=OKOL, and since the products αiβj are Q-linearly independent by step 3.1 and span OKOL over Z by construction, they form an integral basis of OKL.

10.1F5step 9.1

The restrictions of the mn distinct embeddings of KL into C to K and to L define a map Emb⁡(KL)→Emb⁡(K)×Emb⁡(L); it is injective, because an embedding of KL is determined by its restrictions to K and to L, which together generate KL over Q. Both sides have mn elements by [F5], so the map is a bijection. Order rows by pairs (k,l) and columns by pairs (i,j), with the first index slow in each order. The embedding matrix of the integral basis αiβj of step 9.1 then has entries σk(αi)τl(βj).

11.1F10step 10.1

The embedding matrix of step 10.1 is K1K2: summing over the intermediate pair (a,b) gives ∑a,bσk(αa)δlbδaiτb(βj)=σk(αi)τl(βj). Here (K1)(k,l),(i,j)=σk(αi)δlj and (K2)(k,l),(i,j)=δkiτl(βj). By [F10], det⁡(K1K2)=det⁡(K1)det⁡(K2). In the first-index-slow ordering of step 10.1, K2 is block diagonal with m blocks N=(τl(βj)), so det⁡(K2)=det⁡(N)m. For K1, reorder both its rows and its columns by the same perfect shuffle from (k,l) to (l,k) and from (i,j) to (j,i). These are the same permutation of mn positions, so their determinant signs multiply to 1; in the resulting ordering K1 is block diagonal with n blocks M=(σk(αi)). Hence det⁡(K1)=det⁡(M)n, using [F10] and the Leibniz formula for block diagonal matrices.

12.1F5step 11.1∎

By [F5], dKL=det⁡(σk(αi)τl(βj))2=(det⁡M)2n(det⁡N)2m=dKndLm=dK[L:Q]dL[K:Q], using det⁡(M)2=dK and det⁡(N)2=dL from [F5] and m=[K:Q], n=[L:Q]. This completes the proof.

Depends on

Used by

Dependency tree · two levels

107 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