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.
Dirichlets Unit Theorem Regulators and S Units — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Artinian Rings and Length
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Dedekind Domains and Ideal Classes
- Determinants of Matrices over a Commutative Ring
- Dirichlets Unit Theorem Regulators and S Units
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hall–Mal’cev Coordinates and Bass–Guivarc’h Growth
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Integral Extensions and Going Up
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Localisation of Modules and Support
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minkowski Theory and Number Field Class Groups
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Number Fields Rings of Integers and Discriminants
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pell Equations and Generalized Pell Orbits
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Prime Ideal Decomposition Ramification and the Different
- Prime Spectra and Radicals
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Regular Continued Fractions and Diophantine Approximation
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Solvability by Radicals and Kummer Theory
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Products of Modules
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Field of Fractions and Localisation
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Valuation Rings and Discrete Valuation Rings
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Volumes of Elementary Solids and Solids of Revolution
2 · Summary
The examples compute the unit group or the regulator in the three rank patterns the theorem allows. Rank zero is and the imaginary quadratic fields: the groups , and are found by solving the norm equation with the quadratic norm formula. Rank one is the real quadratic field , where the units of the maximal order are governed by the negative Pell equation through the period of the continued fraction of , the fundamental unit is for , and . Rank two is the totally real cubic field of : the elements and have norm and , their logarithmic vectors are independent, and the two independent units pin down the full rank.
Two computations make the regulator's conventions and invariance visible. The deleted-row minors of the cubic logarithmic matrix all have absolute value , and the unimodular tuple reproduces them exactly, illustrating the step of the well-definedness theorem; replacing the fundamental unit of by the Pell generator of the order would multiply the regulator by six. The page ends with the -units of , equal to of rank , and with the counterexample showing that is a subgroup of index three in .
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Units of and the imaginary quadratic fields
Example
Assume the Axiom of Choice. For one has and . For one has and . For , with , one has and . All three unit groups are finite of rank .
Facts & Assumptions
Given: The Axiom of Choice and the three number fields , and , with the element (number field).
The ring of integers is the integral closure of in (Ring of integers); a rational number integral over is an integer (The rational algebraic integers are exactly the integers), and conversely every integer is a root of the monic polynomial . Hence .
For squarefree one has if and otherwise (Integers in a quadratic field). Since and , this gives and .
For a number field and , the element is a unit of if and only if (A number-field unit is exactly an algebraic integer of norm plus or minus one).
Let be nonsquare and put . A degree- polynomial over is irreducible exactly when it has no rational root (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field), and is not a square in , so is the minimal polynomial of over (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element) and . By the correspondence between -embeddings and distinct roots of the minimal polynomial (-embeddings of into an algebraically closed field correspond to the distinct roots of ), the two -embeddings of into send to and to ; since , norm and trace are the product and sum over these embeddings (Norm and trace from embeddings, with the inseparable exponent in the norm formula). Hence for with ,
The units of are exactly and ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
For , is the set of -th roots of unity in , and denotes the group of all roots of unity in , the union of the subgroups (The group of -th roots of unity in a field, and primitive -th roots of unity).
If satisfies for some , then is a root of the monic polynomial , hence is integral over (Integral elements over a commutative ring and algebraic integers) and lies in , the integral closure of in (Ring of integers); also , so . In particular every root of unity in is a unit of , that is .
The unit rank is exactly for and for imaginary quadratic fields, and in the rank-zero cases is finite (Unit ranks by signature); a quadratic field with has no real embedding and two complex conjugate embeddings, hence signature (Archimedean embeddings and signature).
The Axiom of Choice is assumed; it is used only through the rank-zero unit structure [F8] (The Axiom of Choice).
Verification
and : the rational units are the units of , and are roots of unity while every element of is a unit of by [F7], so as well.
By [F2] and the congruences , one has and , where .
Applying [F4] with the nonsquare rational to with gives .
Writing with and applying [F4] with the nonsquare rational gives .
By [F3] and step 1.3, is a unit if and only if . Since , this is the equation with ; then , , and , so either and or and . Hence .
By [F3] and step 1.4, is a unit if and only if . Since , the value cannot occur, and is equivalent to ; then with forces . If then gives ; if then gives or ; if then gives or .
Direct computation in gives and , hence . Since have pairwise different coordinates in the -basis of , the elements are all different from , and the six units found in step 2.2 are exactly .
Each of the four elements of satisfies , so by [F6], while by [F7]; hence .
Each of the six units found in step 2.2 is a power of by step 3.1, hence satisfies ; therefore by [F6], and by [F7]; hence , because gives .
Finally has signature and both imaginary quadratic fields have signature , so [F8] gives unit rank for all three fields and exhibits the unit groups as finite torsion groups ; the computed groups , and have , and elements.
Choice accounting: AC is used only through the rank-zero structure [F8]; the norm computations, the enumeration of the norm-one solutions, and the powers of are elementary computations in and and use no choice.
Real quadratic units and Pell's equation
Example
Assume the Axiom of Choice. Let be squarefree and . If then , and the unit group is , where is the least positive solution of the negative Pell equation when that equation is solvable, and is the fundamental Pell solution of otherwise; in the solvable case and the norm-one Pell subgroup has index in . If then strictly contains ; the unit group of the order is as above, while the fundamental unit of may be a half-integer element solving that does not lie in , in which case (in particular the norm-one Pell subgroup ) is a proper subgroup of . For the fundamental unit of is (norm ), so , while in one has , the fundamental Pell solution is , and has index in .
Facts & Assumptions
Given: The Axiom of Choice, a squarefree integer , the field , the order with its Pell norm (The norm on the explicit order ), the fundamental Pell solution of (The fundamental Pell solution), and, when the negative Pell equation is solvable, its least positive solution .
If then , and if then , which strictly contains (Integers in a quadratic field).
For , is a unit of if and only if , and for a real quadratic field the norm of is (A number-field unit is exactly an algebraic integer of norm plus or minus one, Integers in a quadratic field).
The Pell norm is multiplicative: for (The Pell norm is multiplicative); consequently an element is a unit of the order if and only if (The norm on the explicit order , The units of a ring are the invertible elements of its multiplicative monoid, and is a group under multiplication; only in the zero ring).
The integral solutions of are exactly the elements with , and the positive solutions are with ; also (All integral Pell solutions are , All positive Pell solutions are powers of the fundamental solution, The fundamental Pell solution). The equation has a positive nontrivial solution (Every Pell equation has a positive nontrivial integral solution).
The negative Pell equation is solvable if and only if the period length of the continued fraction of is odd; when it is solvable, the numerator-denominator pair gives the least positive solution, and the least positive solution of is (Negative Pell is soluble exactly for odd period length, Generalized and negative Pell equations).
For a real quadratic field , ; in particular there is a unit with (Unit ranks by signature).
For : gives , and , so the complete quotients of are and ; hence the digit sequence is , that is , with period length (Complete quotients in the continued-fraction algorithm, Finite and infinite regular continued fractions, Eventually periodic regular continued fractions). The convergent recurrence gives and (Convergents of a regular continued fraction), and direct computation gives , and .
The Axiom of Choice is assumed; it is used only through the rank-one structure of in [F6]; the Pell solution theory quoted above is choice-free (The Axiom of Choice).
Verification
The ring-of-integers formula gives when and when .
An element is a unit of the order if and only if : if then , while for a unit one has with both factors in , so .
Seen in , every unit of has norm (its Pell norm is the field norm), and conversely a norm- element of is a unit; thus the units of the order are exactly the integral solutions of , with the norm-one solutions forming .
Take and . Its norm is , so ; direct multiplication gives and .
Suppose first that is solvable, and let be its least positive solution, whose coordinates are the numerator and denominator of the convergent in [F5]. Then is a positive solution of , so for a unique integer .
For the elements of are the numbers with , of norm ; such an element is a unit exactly when , and it fails to lie in exactly when and are both odd.
The exponent is odd: if , then in the domain , so and taking norms gives , contradicting .
The units of for are the elements with and ; for a unit one has , and according as , so are positive integers. Checking the admissible positive pairs in order of : for the equation gives , so (the unit ) or (the unit ); for it gives , so (the unit ); for one has , hence and . Therefore is the least unit of .
In fact . If , write and put . Both and are units of by [F3], so is a unit of that order as well; in particular for integers . From step 2.1, , and therefore and . Since and , the definition of gives , and gives . By [F3] the order norm is or . If , multiplicativity in [F3] and give , contradicting ; hence . Thus is a positive integral solution of : its conjugate is , so and . As and , ; moreover , so this solution has smaller first coordinate than the least positive solution , a contradiction. Therefore and .
Since for some and the least unit in such a group is , step 3.2 gives , so .
Consequently, in the solvable case every norm-one unit is and every norm- unit is , because multiplying it by gives norm ; thus , and the norm-one subgroup consists of the even powers of , of index .
If instead is unsolvable, every unit of has norm , so ; setting gives in both cases.
The order is a subring of , so its unit group is a subgroup of and equals the units computed in steps 5.1 and 6.1; if the fundamental unit of (its least unit ) is an element with both odd, then it is not in , so , and since also .
In the order, [F5] applied with the period length computed in [F7] makes the pair the least positive solution of and the pair the least positive solution of , whose associated element is the fundamental Pell unit ; by steps 5.1 and 6.1 applied to , , and by step 1.4 this is , while the identity of [F7] gives .
Finally with index , because the multiples of in have index ; a generator of the larger group, for instance , is not in the smaller order, so the two unit groups are not equal and the order's norm-one Pell subgroup is proper in .
Scope and choice accounting: the general statements of the example are steps 5.1, 6.1 and 7.1, and the failure of equality is witnessed by in steps 7.2 and 8.1; AC is used only through the rank-one structure [F6], all computations here being elementary arithmetic in .
Two independent units in a real cubic field
Example
Assume the Axiom of Choice. Let , the root in of . Then is a totally real cubic field with signature , so the unit rank is . The elements (norm ) and (norm ) are units of whose logarithmic vectors are linearly independent over ; hence is a rank- subgroup of of finite index, confirming the rank.
Facts & Assumptions
Given: The Axiom of Choice, the real number , the element , and the polynomial (cosine, number field).
and is the smallest positive zero of cosine (Pi as twice the smallest positive zero of cosine).
For every real one has and (Quarter-turn values and shifts by pi/2 and pi).
For every real one has (Parity and the Pythagorean identity for sine and cosine).
For every real one has (Triple-angle identities for sine, cosine, and tangent).
For every real one has (Double-angle and quadratic power-reduction identities).
Cosine is strictly decreasing on , with range (Signs, monotonicity intervals, and ranges of sine and cosine).
If a rational number in lowest terms is a root of a polynomial with integer coefficients , then divides and divides (Rational root theorem).
A polynomial of degree or over a field is irreducible if and only if it has no root in that field (A polynomial of degree two or three over a field is irreducible exactly when it has no root in the field).
A continuous real function on a closed bounded interval attains every value between its endpoint values (Intermediate value theorem, by bisection with a canonical left-half rule: a continuous function on takes every value between and ).
Sending an embedding of into an algebraically closed field to the image of is a bijection onto the set of distinct roots of the minimal polynomial of ; in particular the number of embeddings equals the number of distinct roots (-embeddings of into an algebraically closed field correspond to the distinct roots of ).
For a separable finite extension the field norm is the product of the images under the distinct embeddings: (Norm and trace from embeddings, with the inseparable exponent in the norm formula).
If splits over a commutative ring as , then for each ; in particular (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).
For , the element is a unit of if and only if (A number-field unit is exactly an algebraic integer of norm plus or minus one).
is the integral closure of in ; an element of that is a root of a monic polynomial in is integral over and hence lies in , and is a subring of containing (Integral elements over a commutative ring and algebraic integers, Ring of integers).
The unit rank of is , where is the signature; a totally real cubic field has signature and unit rank (Unit ranks by signature, Archimedean embeddings and signature).
The logarithmic embedding is the map on , and for (Logarithmic embedding of a number field, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm); for a totally real field its values are the vectors of the logarithms of the absolute values of the conjugates.
The image is contained in the hyperplane (Unit logarithms lie in the trace-zero hyperplane).
; in particular the unit group is finitely generated of rank with finite torsion subgroup (Dirichlet unit theorem).
A system of fundamental units of exists, its logarithms form a -basis of , and every unit has a unique expression with and (System of fundamental units).
For and with , the subgroup generated by the columns has finite index in (The index of a full-rank subgroup of is the absolute determinant of a generating matrix).
The Axiom of Choice is assumed; it is used only through the unit theorem [F19] and the existence of a system of fundamental units [F20] (The Axiom of Choice).
Verification
, hence for .
With one has by the shift and parity identities, while the double-angle identity gives ; hence , that is . Since and cosine is strictly decreasing on with , one has , so .
Values of : , , , , .
Hence .
Moreover : from and strict decrease of cosine on together with and one gets , hence .
The polynomial is irreducible over : by [F8] a rational root of the monic integer polynomial must be an integer dividing the constant term , hence equal to or ; but and , so has no rational root, and since it is irreducible by [F9].
The triple-angle identity gives , so .
The polynomial has exactly one root in , namely : by step 1.3 and [F10] the sign change from to gives a root in , and for one has , so is strictly increasing on and the root is unique; steps 3.1 and 2.2 show that is such a root.
By step 1.3 and [F10] there are also roots in and in , and these three roots are distinct because the intervals are disjoint; a cubic has at most three roots, so these are all the roots of and all of them are real.
Therefore is the minimal polynomial of over (monic, irreducible, with by step 3.1), so has degree over ; by [F11] the three embeddings send to the three roots of , which are all real by step 5.1, so is totally real with signature and unit rank by [F16].
By [F12] and [F13] applied to , where are the three conjugates of given by the embeddings of step 6.1, one has because the constant coefficient of is ; and , using .
Writing the three real embeddings as , the conjugates satisfy , and by steps 2.2 and 5.1; hence , , , , and .
The elements and lie in : is a root of the monic polynomial , hence integral over and in by [F15], and because is a subring of ; by [F14] with the norms of step 7.1, both are units of .
The vectors and are linearly independent over : if , then reading the first coordinate and dividing by gives with by step 7.2, while reading the second coordinate and dividing by gives with , a quotient of two negative numbers; subtracting the two equations gives , and because their signs differ, so and then from the first equation.
By [F17] the map turns products into sums, and by [F18] both and lie in , since and are units of by step 8.1.
Hence the subgroup is free abelian of rank : if for integers , then by [F17] and step 8.2 forces ; thus the homomorphism , , has trivial kernel, and its image is exactly .
The image has finite index in : by [F20] fix a system of fundamental units and write and with and integers ; since kills , and , so with respect to the -basis of the two vectors have the integer coordinate columns and , and the matrix has because a zero determinant would make the two coordinate columns, hence and , linearly dependent over , contradicting step 8.2; therefore the subgroup has finite index in by [F21].
Consequently has finite index in : the canonical map is surjective onto a finite group by step 10.1, and its kernel is a quotient of the finite group of [F19]; hence the quotient is finite, as claimed.
Choice accounting: AC is used only through the unit theorem [F19], which supplies the finite generation and rank, and through the existence of the system of fundamental units [F20]; the trigonometric, polynomial, norm and logarithm computations, and the independence argument via signs, are elementary and use no further choice.
Regulator of a real quadratic field
Example
Assume the Axiom of Choice. Let be a real quadratic field with fundamental unit (the least unit of greater than ). Then has signature , so its unit rank is and is a system of fundamental units; its logarithmic vector is and the absolute deleted-row determinant of the logarithmic matrix is , so . The factor of the doubled-complex convention never enters, since a real quadratic field has no complex place. For the fundamental unit is and ; the positive generator of the norm-one Pell subgroup of the order has , so using that generator of the nonmaximal order as if it were the fundamental unit of the maximal order would multiply the regulator by six.
Facts & Assumptions
Given: The Axiom of Choice, a squarefree integer , the field , its fundamental unit (the least unit of greater than ), and its two real embeddings (Real quadratic units and Pell's equation, Logarithmic embedding of a number field).
The logarithmic embedding is on , with one coordinate for each real embedding and one doubled coordinate for each complex place, and it is well defined (Logarithmic embedding of a number field).
is strictly increasing with , and , for (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
A quadratic field with has two real embeddings and no complex place, so its signature is ; its unit rank is , and with torsion subgroup (Unit ranks by signature).
For , is a unit of if and only if ; for the real quadratic field (A number-field unit is exactly an algebraic integer of norm plus or minus one, Real quadratic units and Pell's equation).
A system of fundamental units of is a tuple of units with (System of fundamental units).
The regulator is , where the columns of are the logarithmic vectors of a system of fundamental units and is obtained by deleting row ; is independent of the deleted row and of the chosen system and is positive. The definition records that for a real quadratic field the regulator is for its fundamental unit (Regulator of a number field, The regulator is well defined).
For : the element has norm , so it is a unit; it is the least unit of and ; moreover , the fundamental Pell solution is , and (Real quadratic units and Pell's equation).
The Axiom of Choice is assumed; it is used only through the rank-one structure [F3] and the unit-theoretic inputs of [F7] (The Axiom of Choice).
Verification
has signature and for : there are two real embeddings and no complex place by [F3], so [F1] has no doubled coordinate, and no logarithm of a nonzero element is undefined.
The fundamental unit generates the unit group: by [F3] the group has torsion subgroup and free part of rank , so there is a unit with ; every unit is then with , and because for , so is the least unit and hence ; therefore and, by [F2] and [F1], and for every , so Thus is a system of fundamental units of in the sense of [F5].
Logarithmic vector: may be taken to be the identity, so ; and , because is a unit and by [F4], so . Hence by [F2], a nonzero vector in the hyperplane .
Regulator: the logarithmic matrix of the system is the matrix with entries and , so deleting row gives the determinant and deleting row gives ; by [F6] and step 1.2, which is positive because and is strictly increasing with by [F2]. In particular the two deleted rows give the same absolute value, and the factor of the complex coordinates of [F1] is absent.
For : by [F7] the fundamental unit is , so
By [F7], the full order unit group is , and its norm-one Pell subgroup is . The Pell generator has logarithmic coordinate so its rank-one deleted-row determinant is six times the field regulator, which is defined using the maximal-order fundamental unit .
Conclusion and choice accounting: for every real quadratic field the fundamental unit is a system of fundamental units, its logarithmic vector is , and ; the doubled-complex normalization is vacuous here, and for the value is , six times smaller than the determinant obtained from the Pell generator of the order . Choice enters only through the rank-one unit structure [F3] and the input [F7]; the logarithm computations and the determinant of the matrix use no choice.
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.
S-units of Q
Example
Assume the Axiom of Choice. Let be a finite set of primes, let be the multiplicative subset of generated by (the empty product gives , so that when ), and let be the localisation of at . Then, under the canonical embedding of in , the group law on the right being addition of the exponent vector. This agrees with the -unit theorem for : applied to the finite set of nonzero prime ideals of it gives , of rank .
Facts & Assumptions
Given: The Axiom of Choice, a finite set of primes (Prime and composite integers: is prime when and its only positive divisors are and ), the multiplicative subset generated by , and the localisation (Multiplicative subsets and the localisation as equivalence classes of fractions).
is multiplicative and its elements are exactly the products with all , including the empty product . Elements of are classes with , , with and ; two classes are equal, , exactly when for some ; the localisation map is a ring homomorphism, and every maps to a unit, (Multiplicative subsets and the localisation as equivalence classes of fractions).
A product of two nonzero integers is nonzero, so with and forces ; since , the equality criterion of [F1] reduces to (The integers have no zero divisors; multiplicative cancellation).
Every positive integer is a finite product of primes, and the factorisation is unique up to order; a prime is an integer whose only positive divisors are and (The fundamental theorem of arithmetic: every integer is a product of primes, and the factorisation is unique up to order — if with every and prime, then and for some , Prime and composite integers: is prime when and its only positive divisors are and ).
The units of are exactly and ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
For every prime the principal ideal is a nonzero prime ideal of , indeed a maximal one: is a field (For every prime , the two operations on make it a field) and a quotient ring is a field exactly when the ideal is maximal ( is a field if and only if is a maximal ideal), while a maximal ideal is prime (Every maximal ideal of a commutative ring is prime); the ideal is nonzero because and proper because . Distinct primes give distinct ideals, since forces . The localisation of at the prime ideal consists of the fractions with , and every element of outside becomes a unit there (Localisation at a prime ideal: , Multiplicative subsets and the localisation as equivalence classes of fractions). Moreover, assuming the Axiom of Choice, is a Dedekind domain (Rings of integers are Dedekind domains), each localisation at a nonzero prime is a discrete valuation ring (Localizing a Dedekind domain at a nonzero prime gives a DVR), and every nonzero fractional ideal carries prime-ideal valuations defined by (Fractional ideals, Prime-ideal valuations on fractional ideals); the nonzero ideals of the discrete valuation ring are the powers with (Ideals in a DVR are powers of the maximal ideal), and for a nonzero rational the principal fractional ideal localises to (Localisation of a module at a multiplicative subset).
For a number field (Number field) and a finite set of nonzero prime ideals of , consists of zero and the nonzero elements whose principal fractional ideal involves no prime outside in a denominator, and for every nonzero prime ; no infinite place belongs to , and the rank formula is (S-integers and S-units of a number field).
Assume the Axiom of Choice. For a number field of signature and a finite set of nonzero prime ideals, (S-unit theorem).
: the ring of integers is the integral closure of in (Ring of integers), a rational number integral over is an integer (The rational algebraic integers are exactly the integers), and every integer is a root of the monic polynomial . Also has a single archimedean place, which is real, so its signature is (Archimedean embeddings and signature).
For a field and , and is the group of all roots of unity in , the union of the (The group of -th roots of unity in a field, and primitive -th roots of unity).
The Axiom of Choice is assumed. It is used through the -unit theorem [F7] and through the Dedekind structure of quoted in [F5], where the ring-of-integers corollary is itself AC-qualified; the localisation, exponent and sign computations of the verification use no choice (The Axiom of Choice).
Verification
The localisation embeds in by : the map is well defined because if in , then for some by [F1] and hence by [F2], so the two rationals agree; it respects the fraction arithmetic of [F1], which is the arithmetic of the field ; and it is injective, since forces , and then gives by [F1]. Hence is identified with the subring of , in which is the inverse of for every .
Fix and write its prime factorisation as with all but finitely many exponents zero; existence and uniqueness of the triple (sign, exponent vector) is [F3], applied to the numerator and denominator of in lowest terms. Writing in lowest terms with and fixing a prime , one has ; if this is the nonnegative integer , while if then and by coprimality, so . Thus if and only if .
For a prime , the localisation consists of the fractions with by [F5], so for in lowest terms with one has if and only if : if then has the required form, while if with , then , and would give and hence , contradicting coprimality.
For a nonzero prime ideal of and , [F5] writes as the unique integer with . The powers with are exactly the ideals of the discrete valuation ring , and for the fractional ideal properly contains ; hence if and only if , that is, if and only if .
An element lies in if and only if for every prime . If with and , then has no prime divisor outside , so for one has , where the exponents are those of the factorisations of and ; conversely, if for all and is in lowest terms with , then a prime satisfies and , so ; hence every prime divisor of lies in , that is , and .
For the comparison with the -unit theorem, evaluate its torsion factor and its signature input. is a number field with signature and by [F8]; the roots of unity in are , since in lowest terms with gives , whence and, by uniqueness of prime factorisation, , while coprimality forces ; conversely are roots of unity. Thus by [F9].
The same group is obtained from the -unit theorem. By [F5] the ideals are nonzero prime ideals of by [F8], so is a finite set of nonzero prime ideals. The two rings agree on , and both contain . Indeed, let with and , and let be a nonzero prime ideal: then , because otherwise some prime with lies in , so , and maximality of with proper forces , a contradiction. Hence is a unit of and , so by step 1.4 and . Conversely, let be in lowest terms with , and suppose a prime divides ; then is a nonzero prime ideal of and by the distinctness in [F5], so and step 1.4 gives , contradicting step 1.3. Therefore every prime divisor of lies in , that is and . Thus as subrings of , and their unit groups inside coincide: .
Consequently an element is a unit of if and only if for every prime : a unit of lies in together with its inverse, so step 2.1 gives and for , and conversely the two inequalities , for place both and in .
Therefore for all : for the first description, an element with vanishing exponents outside has prime factorisation involving only primes of and a sign, and conversely a monomial has all exponents outside equal to zero; the sign and the exponents in such an expression are unique by the uniqueness clause of [F3].
The assignment is an isomorphism : it is a group homomorphism because the exponents add, it is surjective by step 4.1, and it is injective because forces and by the uniqueness of the factorisation of the positive integer obtained after moving negative exponents to the other side.
By the -unit theorem [F7] applied to and , of rank . Combined with step 2.3 this agrees with the explicit computation of steps 4.1 and 5.1, and the generators are the classes of .
Scope and boundary cases: for the set and , and the computation returns by [F4], while has rank ; for the exponents range over and negative exponents are allowed, the generators being units because has inverse in . Choice enters through the -unit theorem [F7] and through the AC-qualified Dedekind interface of [F5]; the identification of with a subring of , the exponent bookkeeping and the enumeration of signs use no choice.
Units of Z[√5] are a proper subgroup of the units of its maximal order
Statement refuted
Let be squarefree. Whenever the Pell order is a proper subring of the maximal order , and one might expect that this inclusion of rings is the only difference between them, so that their unit groups still coincide: with the fundamental Pell solution of generating the full unit group of the maximal order. This is false. At , with , one has , the element generates the unit group of the Pell order, , while ; the Pell order's unit group is a proper subgroup of index , and itself is a unit of the maximal order that is not in .
Facts & Assumptions
Given: The Axiom of Choice, the field , the Pell order with its Pell norm (The norm on the explicit order ), the fundamental Pell solution of (The fundamental Pell solution), and the element .
, which strictly contains , and its elements are the numbers with and , of field norm (Integers in a quadratic field, Real quadratic units and Pell's equation).
For , the element is a unit of the ring if and only if (A number-field unit is exactly an algebraic integer of norm plus or minus one).
The Pell norm on is multiplicative, and is a unit of the order if and only if (The norm on the explicit order ). The norm-one integral solutions are exactly the elements , , and the positive ones are for (All integral Pell solutions are , All positive Pell solutions are powers of the fundamental solution, Integral Pell solutions form an abelian group).
For : the element has , so it is a unit of ; direct multiplication gives and ; is the least positive solution of and ; the unit group of the Pell order is ; and is the least unit of (Real quadratic units and Pell's equation, The fundamental Pell solution).
Assume the Axiom of Choice. The maximal order has with torsion subgroup ; explicitly there is a unit with , and then is the least unit of (Unit ranks by signature).
The Axiom of Choice is assumed; it is used only through the rank-one unit structure [F5] (The Axiom of Choice).
Counterexample
The maximal order is with , and ; its elements are the with , of nonzero norm when the element is nonzero because the norm is a product of the two embeddings.
The element is a unit of : its norm is so [F2] applies; also because , and direct multiplication gives
The units of the Pell order are : an element of is a unit of that order exactly when by [F3], the norm-one solutions are , and is the least positive norm- solution, so every norm- solution is .
The maximal order has : by [F5] there is a unit with , and then every unit is with , hence , so is the least unit of ; by [F4] the element is the least unit of , so .
The inclusion of unit groups is proper: the element lies in by step 1.2, while is not of the form with and so does not lie in , hence not in ; therefore .
The index is : the assignment is an isomorphism , since forces only for . It maps onto , so ; multiplying by the common sign group does not change the index, hence .
Conclusion: the maximal order of has unit group generated modulo its sign subgroup by , while the Pell order has unit group , a proper subgroup of index . The fundamental Pell solution generates the norm-one Pell subgroup of the order up to sign; the maximal-order fundamental unit is . The counterexample is the sharpened form of the design's warning for this pair: it identifies both groups and the exact index rather than merely exhibiting one missing unit. Choice is used only through the rank-one structure [F5]; all arithmetic in and the comparisons of the two generators are elementary.
Sources
- J. S. Milne, Algebraic Number Theory v3.08
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021)
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory
- William A. Stein, Algebraic Number Theory: A Computational Approach
- Jurgen Neukirch, Algebraic Number Theory (Springer, 1999)