Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

The regulator is well defined

Statement

Assume the Axiom of Choice. The regulator RK of a number field K is independent of the deleted row and of the chosen system of fundamental units, and RK>0. Consequently RK is an invariant of K (in the doubled logarithmic normalization), with RK=1 for rank zero.

Facts & Assumptions

Given: The Axiom of Choice, a number field K of signature (r1,r2) with unit rank r=r1+r2−1, a system of fundamental units (ε1,…,εr), the matrix A with columns λ(ε1),…,λ(εr), and the deleted-row matrices Ak of the regulator definition (Regulator of a number field, Logarithmic embedding of a number field).

[F1]

The regulator is RK=∣det⁡Ak∣ for the r×r matrix Ak obtained from A by deleting row k; every square matrix has a determinant, and for r=0 the matrices A and Ak are empty and the empty determinant is 1 (Regulator of a number field, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[F2]

The logarithms λ(ε1),…,λ(εr) form a Z-basis of the free abelian group λ(OK×), that is λ(OK×)=Zλ(ε1)⊕⋯⊕Zλ(εr); in rank r=0 the empty tuple is the unique system of fundamental units; and for two systems (εi) and (εi′) there is a matrix C=(cij)∈GL⁡r(Z) with λ(εi′)=∑jcijλ(εj) (System of fundamental units).

[F3]

Every column of A lies in H={x:∑ixi=0}, because λ(u)∈H for every unit u (Unit logarithms lie in the trace-zero hyperplane, Logarithmic embedding of a number field).

[F4]

λ(OK×) is discrete in H and spans H over R; it is a full lattice in H of rank r1+r2−1 (The logarithmic unit image is a full lattice).

[F5]

If Γ is a discrete subgroup of a finite-dimensional real vector space, then there are R-linearly independent v1,…,vs∈Γ with Γ=Zv1⊕⋯⊕Zvs and span⁡RΓ=Rv1⊕⋯⊕Rvs (Discrete subgroups of a real vector space are lattices).

[F6]

Let m≥1 and let B be an (m+1)×m real matrix of rank m whose columns have coordinate sum zero. For the determinant Δk of the matrix obtained by deleting row k one has Δk≠0 for every k and Δk=(−1)k−1Δ1; in particular all ∣Δk∣ are equal (Deleted-row minors of a zero-column-sum matrix agree up to sign).

[F7]

For square matrices of the same size, det⁡(BC)=det⁡(B)det⁡(C) (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)), the rank of a matrix is the dimension of its column space (Row space, column space, nullspace, row rank, column rank and matrix rank), and an invertible square matrix over a commutative ring has unit determinant (An invertible square matrix over a commutative ring has unit determinant); the units of Z are 1 and −1 ((Z,⋅,1) is a commutative monoid whose group of units is {1,−1}; equivalently u∣1 holds exactly for u=1 and u=−1).

[A1]

The Axiom of Choice is assumed; it is used only through the existence of a system of fundamental units supplied by the AC-qualified unit theorem [F2] (The Axiom of Choice).

Proof

technique · prove the two invariance statements of the definition separately. The deleted-row statement reduces to the sign pattern of the cofactors of a rank-$r$ matrix with zero column sums. For a change of fundamental system, form the integer matrix whose columns give the new basis vectors in the old basis; it is unimodular, so every deleted-row determinant is multiplied by $\pm1$. Positivity follows because the common determinant is nonzero
1.1F1F2

Rank zero: if r=0 then by [F1] the matrix A has no columns and each Ak is the empty matrix with determinant 1, while by [F2] the empty tuple is the unique system of fundamental units; hence RK=1 is independent of the deleted row and of the fundamental system, and RK>0.

1.2F2F4F5F7

Assume r≥1 from here on, so A is an (r+1)×r real matrix with r1+r2=r+1≥2 rows. Its columns are R-linearly independent, that is A has rank r: by [F4] the group λ(OK×) is a discrete subgroup of the finite-dimensional real vector space H, so by [F5] it equals Zv1⊕⋯⊕Zvs with v1,…,vs R-linearly independent and span⁡Rλ(OK×)=Rv1⊕⋯⊕Rvs of dimension s; by [F2] the elements λ(ε1),…,λ(εr) form a Z-basis of that same group, so s=r (equal free rank) and their R-span is all of span⁡Rλ(OK×), of dimension r; a spanning set of r vectors in a space of dimension r is a basis, so the columns of A are R-linearly independent and the rank of A is r by [F7].

1.3F3

Every column of A lies in H, hence has coordinate sum zero.

1.4F2

Independence of the fundamental system: let (ε1′,…,εr′) be a second system of fundamental units and let A′ be the matrix with columns λ(ε1′),…,λ(εr′). By [F2] both logarithm lists are Z-bases of the same group. For each i, write λ(εi′)=∑jbjiλ(εj) using unique integers bji, and let B=(bji), so the i-th column of B records the coordinates of λ(εi′) in the old basis. The reverse basis change also has integer coefficients, so B∈GL⁡r(Z). With these column coordinates, A′=AB; deleting row k gives Ak′=AkB for every k.

2.1F7step 1.4

The matrix B of step 1.4 has an integer inverse, so [F7] makes det⁡B a unit of Z, and the description of the units of Z in [F7] gives det⁡B=±1.

2.2F6step 1.2step 1.3

Independence of the deleted row: by step 1.2 and step 1.3 the matrix A satisfies the hypotheses of [F6] with m=r, so for the determinants Δk=det⁡Ak one has Δk≠0 and Δk=(−1)k−1Δ1 for every k; therefore ∣det⁡Ak∣=∣Δ1∣ is the same number for every deleted row, and it is positive because Δ1≠0.

3.1F7step 1.4step 2.1

For every k, multiplicativity of the determinant [F7] applied to Ak′=AkB of step 1.4 gives det⁡Ak′=det⁡Akdet⁡B, so ∣det⁡Ak′∣=∣det⁡Ak∣ ∣det⁡B∣=∣det⁡Ak∣ by step 2.1; hence every deleted-row determinant of the second system has the same absolute value as the first.

4.1F1step 1.1step 2.2step 3.1

Combining steps 2.2 and 3.1: in the case r≥1 the number RK=∣det⁡Ak∣ depends neither on the deleted row nor on the chosen system of fundamental units, and it is positive; in the case r=0 step 1.1 gives RK=1. Therefore RK is well defined and is an invariant of K alone, equal to 1 in rank zero.

5.1A1F2∎

Choice accounting: the only place where AC enters is the existence of the systems of fundamental units in [F2], inherited from the AC-qualified unit theorem; the linear algebra of ranks, determinants and unimodular change of basis is elementary and choice-free.

Depends on

Used by

Cited to discharge well-definedness by Regulator of a number field.

Dependency tree · two levels

111 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