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 of a number field is independent of the deleted row and of the chosen system of fundamental units, and . Consequently is an invariant of (in the doubled logarithmic normalization), with for rank zero.
Facts & Assumptions
Given: The Axiom of Choice, a number field of signature with unit rank , a system of fundamental units , the matrix with columns , and the deleted-row matrices of the regulator definition (Regulator of a number field, Logarithmic embedding of a number field).
The regulator is for the matrix obtained from by deleting row ; every square matrix has a determinant, and for the matrices and are empty and the empty determinant is (Regulator of a number field, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
The logarithms form a -basis of the free abelian group , that is ; in rank the empty tuple is the unique system of fundamental units; and for two systems and there is a matrix with (System of fundamental units).
Every column of lies in , because for every unit (Unit logarithms lie in the trace-zero hyperplane, Logarithmic embedding of a number field).
is discrete in and spans over ; it is a full lattice in of rank (The logarithmic unit image is a full lattice).
If is a discrete subgroup of a finite-dimensional real vector space, then there are -linearly independent with and (Discrete subgroups of a real vector space are lattices).
Let and let be an real matrix of rank whose columns have coordinate sum zero. For the determinant of the matrix obtained by deleting row one has for every and ; in particular all are equal (Deleted-row minors of a zero-column-sum matrix agree up to sign).
For square matrices of the same size, (For same-sized finite square matrices over a commutative ring, ), 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 are and ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
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
Rank zero: if then by [F1] the matrix has no columns and each is the empty matrix with determinant , while by [F2] the empty tuple is the unique system of fundamental units; hence is independent of the deleted row and of the fundamental system, and .
Assume from here on, so is an real matrix with rows. Its columns are -linearly independent, that is has rank : by [F4] the group is a discrete subgroup of the finite-dimensional real vector space , so by [F5] it equals with -linearly independent and of dimension ; by [F2] the elements form a -basis of that same group, so (equal free rank) and their -span is all of , of dimension ; a spanning set of vectors in a space of dimension is a basis, so the columns of are -linearly independent and the rank of is by [F7].
Every column of lies in , hence has coordinate sum zero.
Independence of the fundamental system: let be a second system of fundamental units and let be the matrix with columns . By [F2] both logarithm lists are -bases of the same group. For each , write using unique integers , and let , so the -th column of records the coordinates of in the old basis. The reverse basis change also has integer coefficients, so . With these column coordinates, ; deleting row gives for every .
The matrix of step 1.4 has an integer inverse, so [F7] makes a unit of , and the description of the units of in [F7] gives .
Independence of the deleted row: by step 1.2 and step 1.3 the matrix satisfies the hypotheses of [F6] with , so for the determinants one has and for every ; therefore is the same number for every deleted row, and it is positive because .
For every , multiplicativity of the determinant [F7] applied to of step 1.4 gives , so by step 2.1; hence every deleted-row determinant of the second system has the same absolute value as the first.
Combining steps 2.2 and 3.1: in the case the number depends neither on the deleted row nor on the chosen system of fundamental units, and it is positive; in the case step 1.1 gives . Therefore is well defined and is an invariant of alone, equal to in rank zero.
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
- An invertible square matrix over a commutative ring has unit determinant
- The Axiom of Choice
- For $n\ge1$, the determinant over a commutative ring by the Leibniz formula, and $|\det A|$ for a real matrix
- System of fundamental units
- Logarithmic embedding of a number field
- Regulator of a number field
- Row space, column space, nullspace, row rank, column rank and matrix rank
- Deleted-row minors of a zero-column-sum matrix agree up to sign
- Discrete subgroups of a real vector space are lattices
- Unit logarithms lie in the trace-zero hyperplane
- $(\mathbb{Z}, \cdot, 1)$ is a commutative monoid whose group of units is $\{1, -1\}$; equivalently $u \mid 1$ holds exactly for $u = 1$ and $u = -1$
- For same-sized finite square matrices over a commutative ring, $\det(AB)=\det(A)\det(B)$
- The logarithmic unit image is a full lattice
Used by
- A unimodular change of generators preserves the regulator determinants Example
- Regulator of a real quadratic field Example
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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)