Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge 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.

Covolume of an integral ideal lattice

Statement

Let K be a number field of degree n with r2 complex places (Number field, Unscaled Minkowski embedding), ring of integers OK and discriminant dK≠0 (Number-field discriminant is well-defined and nonzero). Let σ:K→Rn be the unscaled Minkowski embedding and let a⊆OK be a nonzero integral ideal, with absolute norm Na=∣OK/a∣ (The absolute norm of an integral ideal). Then

covol⁡(σ(a))=2−r2∣dK∣⋅Na.

The formula is for integral ideals only. It is not applied below to an ideal that is merely fractional; such an ideal is first multiplied by a positive integer (or by an element of OK) to become integral.

Facts & Assumptions

Given: A number field K of degree n, its ring of integers OK, discriminant dK≠0, the unscaled Minkowski embedding σ, and a nonzero ideal a⊆OK.

[F1]

The image σ(a) of a nonzero integral ideal is a full lattice, and a has a Z-basis α1,…,αn; moreover σ(OK) is a full lattice with integral basis β1,…,βn of OK (Number-field integer rings and ideals are full lattices, Integral and power integral bases).

[F2]

For an ordered Q-basis α1,…,αn of K, the real n×n matrix A with columns σ(αj) satisfies ∣det⁡A∣=2−r2∣disc⁡(α1,…,αn)∣, the real determinant being obtained from the full complex embedding matrix by replacing each conjugate pair of rows by its real and imaginary parts (Unscaled Minkowski embedding).

[F3]

disc⁡(α1,…,αn)=det⁡(ψi(αj))2 for the full list of embeddings ψ1,…,ψn, and this determinant is nonzero (Embedding determinant formula).

[F4]

If βj=∑iaijαi for two ordered bases, then disc⁡(β1,…,βn)=det⁡(A)2disc⁡(α1,…,αn) (Change of basis for discriminants).

[F5]

For every integral basis β1,…,βn of OK one has disc⁡(β1,…,βn)=dK≠0 (Discriminant of a basis and order, Number-field discriminant is well-defined and nonzero).

[F7]

For C∈Mn(Z) with det⁡C≠0, the subgroup CZn⊆Zn has finite index ∣det⁡C∣ (The index of a full-rank subgroup of Zn is the absolute determinant of a generating matrix).

[F8]

covol⁡(Λ)=∣det⁡B∣ for a Z-basis b1,…,bn of a full lattice Λ with matrix B=(b1 ⋯ bn) (Full Euclidean lattice and covolume).

Proof

1.1F1F8given

By [F1] and [F8], covol⁡(σ(a))=∣det⁡A∣, where A is the matrix with columns σ(αj) for a Z-basis α1,…,αn of a; this basis is a Q-basis of K because σ is injective and σ(a) is a full lattice.

1.2F1algebra

Let β1,…,βn be an integral basis of OK [F1]. Each αj lies in a⊆OK, so αj=∑icijβi with uniquely determined integers cij; let C=(cij).

2.1F1step 1.1step 1.2algebra

The matrix C has det⁡C≠0: if det⁡C=0 there is a nonzero rational vector y with Cy=0, whence ∑jyjαj=0, contradicting Q-linear independence of the αj from step 1.1.

3.1F6F7step 1.2step 2.1

(Index.) The map φ:Zn→OK, (mi)↦∑imiβi, is a Z-linear bijection with φ(CZn)=a; hence [OK:a]=[Zn:CZn]=∣det⁡C∣ by [F7], and by [F6] this index is Na.

4.1F4F5step 3.1

By [F4] applied to αj=∑icijβi and [F5], disc⁡(α1,…,αn)=det⁡(C)2dK, so ∣disc⁡(α1,…,αn)∣=(Na)2∣dK∣ by step 3.1.

5.1F2F3step 1.1step 4.1

Steps 1.1, [F2] and [F3] give covol⁡(σ(a))=∣det⁡A∣=2−r2∣disc⁡(α1,…,αn)∣, and step 4.1 evaluates the discriminant, so covol⁡(σ(a))=2−r2(Na)2∣dK∣=2−r2∣dK∣ Na.

6.1step 5.1∎

Step 5.1 is the asserted formula.

Depends on

Used by

Dependency tree · two levels

37 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