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 number-field unit is exactly an algebraic integer of norm plus or minus one
Statement
Let be a number field (Number field) with ring of integers (Ring of integers) and with field norm of multiplication by (The norm and trace of a finite field extension). For , the element is a unit of the ring (The units of a ring are the invertible elements of its multiplicative monoid, and is a group under multiplication; only in the zero ring) if and only if .
Facts & Assumptions
Given: A number field of degree , its ring of integers , and an element .
is a free -module of rank (The ring of integers has rank the degree).
If is invertible over a commutative ring , then is a unit of , with its inverse (An invertible square matrix over a commutative ring has unit determinant).
If is a unit of , then , and the adjugate of a matrix with entries in has entries in , its entries being cofactors (If is a unit, then , Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring).
The units of are exactly ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
Proof
Proof technique: read the norm as the determinant of multiplication by in an integral basis, and use the adjugate formula in one direction and the unit-determinant theorem in the other.
Fix a -basis of and let be the matrix of the -linear map , , in that basis (Coordinate columns and matrices of linear maps relative to ordered bases). Since and is closed under multiplication, ; hence every column of is the coordinate column of an element of , so has entries in , and .
Suppose first that is a unit of , so . The inverse of is , and its matrix in the same basis is ; by the argument of step 1.1 with replaced by this matrix has integer entries. Thus is invertible over , so by [F2] is a unit of , and [F4] gives , that is, .
Suppose conversely that . Then is invertible and by [F3]; since is a unit of and the adjugate of an integer matrix has integer entries, has integer entries. For every the coordinate column of is applied to the coordinate column of , hence is integral, so ; taking and using gives . Therefore exhibits as a unit of together with its inverse .
Depends on
- If $\det(A)$ is a unit, then $A^{-1}=\det(A)^{-1}\operatorname{adj}(A)$
- An invertible square matrix over a commutative ring has unit determinant
- Coordinate columns $[v]_{\mathcal B}$ and matrices $[T]_{\mathcal B}^{\mathcal C}$ of linear maps relative to ordered bases
- The norm $N_{K/F}$ and trace $\operatorname{Tr}_{K/F}$ of a finite field extension
- Deleted-row-and-column minors, cofactors, the cofactor matrix and the adjugate over a commutative ring
- Number field
- Ring of integers
- The units of a ring are the invertible elements of its multiplicative monoid, and $R^{\times}$ is a group under multiplication; $0 \in R^{\times}$ only in the zero ring
- $(\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$
- The ring of integers has rank the degree
Used by
- Units of Z[√5] are a proper subgroup of the units of its maximal order Counterexample
- Real quadratic units and Pell's equation Example
- Regulator of a real quadratic field Example
- Two independent units in a real cubic field Example
- Units of ℚ and the imaginary quadratic fields Example
- Kernel of the unit logarithm is the roots of unity Lemma
- Unit logarithms lie in the trace-zero hyperplane Lemma
Dependency tree · two levels
54 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)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)