Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-10-02
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 r1+r2−1 is 0 exactly for K=Q and for imaginary quadratic fields, and it is 1 for every real quadratic field; in general it equals r1+r2−1. The rank-0 cases have OK×=μ(K) finite and the rank-1 real quadratic case has OK×≅μ(K)×Z with μ(K)={±1}.

Facts & Assumptions

Given: The Axiom of Choice and a number field K of signature (r1,r2) (Number field, Archimedean embeddings and signature).

[F1]

The signature satisfies r1+2r2=[K:Q], with r1 the number of real embeddings and r2 the number of complex conjugate pairs (Archimedean embeddings and signature).

[F2]

OK×≅μ(K)×Zr1+r2−1; the rank of OK× is r1+r2−1, and when r1+r2−1=0 one has OK×=μ(K) (Dirichlet unit theorem).

[F3]

For a finite field extension K/Q one has [K:Q]=1 if and only if K=Q (A finite extension has degree one if and only if the two fields are equal). Moreover OQ, the integral closure of Z in Q (Ring of integers), equals Z: a rational number integral over Z is an integer (The rational algebraic integers are exactly the integers), and every integer n is a root of the monic polynomial X−n, so OQ=Z with unit group OQ×=Z×={±1} ((Z,⋅,1) is a commutative monoid whose group of units is {1,−1}; equivalently u∣1 holds exactly for u=1 and u=−1).

[F4]

If x∈R and xn=1 for some integer n≥1, then x=±1: the inequalities x>1, 0<x<1 are preserved by taking n-th powers, and x<0 with xn=1 forces n even and (−x)n=1, so −x=1 (Monotonicity of x↦xn and of n↦an, Sign rules for products and monotonicity of multiplication, The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[F5]
[F6]

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 α, [Q(α):Q] is the degree of its monic irreducible minimal polynomial (An element is algebraic over F if and only if its simple extension F(a)/F is finite, The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F7]

Every positive integer has a unique prime factorisation (The fundamental theorem of arithmetic: every integer n≥1 is a product of primes, and the factorisation is unique up to order — if ∏i<rpi=∏j<sqj with every pi and qj prime, then r=s and qi=pπ(i) for some π∈Sym⁡(r)); consequently every nonzero rational Δ can be written as q2d with q∈Q× and d a nonzero squarefree integer, by writing each prime exponent of Δ as 2k+e with e∈{0,1} and retaining the sign in d.

[A1]

The Axiom of Choice is assumed; it is used only through the AC-qualified unit theorem [F2] (The Axiom of Choice).

Proof

technique · read the rank $r_1+r_2-1$ off $\mathcal O_K^\times\cong\mu(K)\times\mathbb Z^{r_1+r_2-1}$, enumerate the signatures with $r_1+r_2=1$ to identify the rank-zero fields, and compute the real quadratic torsion from the real roots of unity
1.1F1F2F5

By [F2] the rank of OK× equals r1+r2−1; in particular rank 0 means OK×=μ(K), and a real quadratic field has signature (2,0) and rank 1.

1.2F1F2F3

Q has signature (1,0), so its unit rank is 0; by [F3] its ring of integers is Z with unit group {±1}=μ(Q), a finite group.

1.3F1F2F5

An imaginary quadratic field has signature (0,1), so its unit rank is 0 and hence OK×=μ(K), a finite group.

1.4F1F3F5F6F7algebra

Conversely, rank 0 gives r1+r2=1. If r2=0, then [K:Q]=1 and K=Q. Otherwise (r1,r2)=(0,1) and [K:Q]=2. Choose α∈K∖Q. The degree [Q(α):Q] divides 2 and is not 1, so K=Q(α) and the monic minimal polynomial is X2+bX+c with b,c∈Q. Thus β:=2α+b satisfies β2=Δ:=b2−4c, where Δ≠0 is not a rational square, since otherwise α would be rational. Factoring the numerator and denominator of Δ into primes and removing even exponents gives Δ=q2d with q∈Q× and d≠1 a nonzero squarefree integer. Hence K=Q(β/q)=Q(d). Since K has no real embedding, [F5] forces d<0, so K is imaginary quadratic.

1.5F1F2F4F5

For a real quadratic field, signature (2,0) gives rank 1 and OK×≅μ(K)×Z; moreover every ζ∈μ(K) lies in the image of one of the two real embeddings, so ζ is a real root of unity and hence ζ=±1 by [F4]; thus μ(K)={±1} and OK×≅{±1}×Z.

1.6F1F2

The rank formula r1+r2−1 applies to every signature; a field of signature (1,1), such as a complex cubic field, also has rank 1, so the real quadratic case is a computed example of rank one rather than a characterisation of it.

2.1A1F2∎

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

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