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.
Unit ranks by signature
Statement
Assume the Axiom of Choice. The unit rank is exactly for and for imaginary quadratic fields, and it is for every real quadratic field; in general it equals . The rank- cases have finite and the rank- real quadratic case has with .
Facts & Assumptions
Given: The Axiom of Choice and a number field of signature (Number field, Archimedean embeddings and signature).
The signature satisfies , with the number of real embeddings and the number of complex conjugate pairs (Archimedean embeddings and signature).
; the rank of is , and when one has (Dirichlet unit theorem).
For a finite field extension one has if and only if (A finite extension has degree one if and only if the two fields are equal). Moreover , the integral closure of in (Ring of integers), equals : 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 , so with unit group ( is a commutative monoid whose group of units is ; equivalently holds exactly for and ).
If and for some integer , then : the inequalities , are preserved by taking -th powers, and with forces even and , so (Monotonicity of and of , Sign rules for products and monotonicity of multiplication, The group of -th roots of unity in a field, and primitive -th roots of unity).
For a nonzero squarefree integer , is not a rational square by unique prime factorisation (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 ), so is irreducible over and has degree (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element, An element is algebraic over if and only if its simple extension is finite). Its embeddings correspond exactly to the two roots (-embeddings of into an algebraically closed field correspond to the distinct roots of ): if both embeddings are real, and if neither is real and they are complex conjugates. The signatures are therefore and respectively (Archimedean embeddings and signature).
In a finite tower, the intermediate degree divides the total degree (The degree of an intermediate field divides the degree of a finite extension). For an algebraic element , is the degree of its monic irreducible minimal polynomial (An element is algebraic over if and only if its simple extension is finite, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Every positive integer has a unique prime factorisation (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 ); consequently every nonzero rational can be written as with and a nonzero squarefree integer, by writing each prime exponent of as with and retaining the sign in .
The Axiom of Choice is assumed; it is used only through the AC-qualified unit theorem [F2] (The Axiom of Choice).
Proof
By [F2] the rank of equals ; in particular rank means , and a real quadratic field has signature and rank .
has signature , so its unit rank is ; by [F3] its ring of integers is with unit group , a finite group.
An imaginary quadratic field has signature , so its unit rank is and hence , a finite group.
Conversely, rank gives . If , then and . Otherwise and . Choose . The degree divides and is not , so and the monic minimal polynomial is with . Thus satisfies , where is not a rational square, since otherwise would be rational. Factoring the numerator and denominator of into primes and removing even exponents gives with and a nonzero squarefree integer. Hence . Since has no real embedding, [F5] forces , so is imaginary quadratic.
For a real quadratic field, signature gives rank and ; moreover every lies in the image of one of the two real embeddings, so is a real root of unity and hence by [F4]; thus and .
The rank formula applies to every signature; a field of signature , such as a complex cubic field, also has rank , so the real quadratic case is a computed example of rank one rather than a characterisation of it.
Choice accounting: the corollary uses only the AC-qualified unit theorem [F2]; the signature enumeration and the real-roots-of-unity computation are choice-free.
Depends on
- Archimedean embeddings and signature
- The Axiom of Choice
- Number field
- Ring of integers
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- The rational algebraic integers are exactly the integers
- Sign rules for products and monotonicity of multiplication
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
- $(\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$
- A finite extension has degree one if and only if the two fields are equal
- Dirichlet unit theorem
- An element is algebraic over $F$ if and only if its simple extension $F(a)/F$ is finite
- The degree of an intermediate field divides the degree of a finite extension
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- $F$-embeddings of $F(\alpha)$ into an algebraically closed field correspond to the distinct roots of $m_{\alpha}$
- The fundamental theorem of arithmetic: every integer $n \ge 1$ is a product of primes, and the factorisation is unique up to order — if $\prod_{i<r} p_i = \prod_{j<s} q_j$ with every $p_i$ and $q_j$ prime, then $r = s$ and $q_i = p_{\pi(i)}$ for some $\pi \in \operatorname{Sym}(r)$
Used by
Dependency tree · two levels
85 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)
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory (standard reference, not scraped)