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.
A unimodular change of generators preserves the regulator determinants
Example
Assume the Axiom of Choice. Let , the root in of , with conjugates , and , and let , be the two independent units of the cubic field example. Then:
- the tuples and generate the same lattice in the hyperplane ; the second logarithmic matrix is with the matrix acting on columns, a unimodular integer matrix of determinant ;
- every deleted-row determinant of the logarithmic matrix has the same value for the two tuples, namely with , , and its absolute value is in both cases (the three deleted rows have the signs );
- interchanging and , that is right multiplication by the unimodular integer matrix of determinant , reverses the sign of every deleted-row determinant and leaves its absolute value unchanged, which is why the regulator is defined from an absolute determinant.
Facts & Assumptions
Given: The Axiom of Choice, the element , the field , its three real embeddings with conjugates , , , and the units , (Two independent units in a real cubic field, Logarithmic embedding of a number field).
The cubic example gives: is irreducible with one of its three real roots; is totally real of signature , so and the logarithms of the three embeddings are the coordinates of ; the conjugates satisfy , , ; is strictly increasing on , so is its only root there; and ; and are units of ; and , are -linearly independent (Two independent units in a real cubic field).
The logarithmic embedding is on ; for the totally real of [F1] it is , and it is well defined because nonzero elements have nonzero images under every embedding (Logarithmic embedding of a number field).
is additive over products, so for the coordinatewise additivity holds, the absolute values of the conjugates being multiplicative (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
Every value of a unit lies in the hyperplane (Unit logarithms lie in the trace-zero hyperplane).
The regulator of is , where has the columns for a system of fundamental units and is obtained by deleting row ; deleting rows may be done before or after finite matrix products. The definition records that a change of fundamental system multiplies on the right by a matrix in , "which is why the absolute determinant, and not the signed one, is the invariant" (Regulator of a number field, For , the determinant over a commutative ring by the Leibniz formula, and for a real matrix).
Let and let be an real matrix of rank whose columns have coordinate sum zero. Then for the deleted-row determinants one has 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 over a commutative ring, (For same-sized finite square matrices over a commutative ring, ).
An invertible square matrix over a commutative ring has unit determinant (An invertible square matrix over a commutative ring has unit determinant), and the units of are ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
Assume the Axiom of Choice. For two systems of fundamental units of a number field the regulator is the same number: the absolute deleted-row determinant does not depend on the deleted row nor on the chosen system, and it is positive (The regulator is well defined).
The Axiom of Choice is assumed; it is used only through the unit-theoretic inputs quoted in [F1] and [F9] and the hyperplane input [F4] (The Axiom of Choice).
Verification
The setting is as in [F1]-[F4]: and are vectors in the hyperplane of , where , , ; these logarithms are defined because , and ; and is additive, .
Conjugate relations I: if is any root of , then is again a root: from one computes , , , hence and . Thus maps the set of the three distinct roots into itself. Now , because is strictly increasing on by [F1] and ; hence , and the only roots in are and , with because would give ; therefore . Similarly is the root in , namely . Finally , since for one has , so is strictly increasing on , and , so , and the only root in is ; hence .
Conjugate relations II: for every root of one has , hence . Applying this to and using gives ; applied to and using it gives ; applied to and using it gives .
Logarithmic coordinates: since is the inverse of , , that is ; since is the inverse of , ; and since is negative with , , that is . Moreover because . Therefore and with .
The logarithmic matrix of the tuple is Deleting row gives ; deleting row gives ; and deleting row gives , where is used in each reduction. In particular all three deleted-row determinants are nonzero and have absolute value .
The second tuple has the same lattice and the same determinants: by additivity , so , an equality of subgroups of . In coordinates, the logarithmic matrix of is with acting on columns, whose inverse is integral and whose determinant is ; deleting row commutes with right multiplication, so and by [F7]. Thus the determinants of the two tuples are equal, not merely equal in absolute value, and as well.
Swapping the two units, that is passing to , replaces by with , whose inverse is itself and whose determinant is ; then , so the sign of every deleted-row determinant is reversed and the absolute value is unchanged. Both and are invertible over , so by [F8] their determinants are units of , that is , in agreement with the direct computations and .
Numerical value: evaluating cosine gives , so , , and satisfies because by step 1.2; hence , satisfies , and So every deleted-row determinant of the two tuples has absolute value the number of the display, the signs for the tuple being as computed in step 4.1.
Relation to the regulator definition and choice accounting: the computation is the explicit step that [F5] and [F9] single out — right multiplication by an integral matrix of determinant changes the deleted-row determinants by that same factor, so the absolute value is the invariant and the regulator is defined from it. Nothing here asserts that or is a system of fundamental units: the common number is the absolute deleted-row determinant of the rank-two subgroup lattice generated by the tuple, and it coincides with the field regulator only when the tuple generates all of . AC enters only through the unit-theoretic inputs quoted in [F1] and [F9] and the hyperplane input [F4]; the algebraic relations among conjugates, the logarithmic matrix computations and the determinant identities use no choice.
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
- Logarithmic embedding of a number field
- Regulator of a number field
- Two independent units in a real cubic field
- Deleted-row minors of a zero-column-sum matrix agree up to sign
- 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)$
- Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm
- The regulator is well defined
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
93 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
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory (standard reference, not scraped)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)