Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

A unimodular change of generators preserves the regulator determinants

Example

Assume the Axiom of Choice. Let α=2cos⁡(2π/9), the root in (1,2) of X3−3X+1, with conjugates x=σ1α∈(1,2), y=σ2α∈(0,1) and z=σ3α∈(−2,−1), and let u1:=α, u2:=α−1 be the two independent units of the cubic field example. Then:

  1. the tuples (u1,u2) and (u1u2,u2) generate the same lattice Zλ(u1)+Zλ(u2) in the hyperplane H; the second logarithmic matrix is A(1011) with the matrix acting on columns, a unimodular integer matrix of determinant 1;
  2. every deleted-row 2×2 determinant of the logarithmic matrix has the same value for the two tuples, namely ±(a2+ab+b2) with a=log⁡x, b=log⁡y, and its absolute value is 0.849287… in both cases (the three deleted rows have the signs −, +, −);
  3. interchanging u1 and u2, that is right multiplication by the unimodular integer matrix (0110) of determinant −1, 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 α=2cos⁡(2π/9), the field K=Q(α), its three real embeddings σ1,σ2,σ3 with conjugates x=σ1α, y=σ2α, z=σ3α, and the units u1=α, u2=α−1 (Two independent units in a real cubic field, Logarithmic embedding of a number field).

[F1]

The cubic example gives: f(X)=X3−3X+1 is irreducible with α∈(1,2) one of its three real roots; K is totally real of signature (3,0), so r1+r2=3 and the logarithms of the three embeddings are the coordinates of λ; the conjugates satisfy x∈(1,2), y∈(0,1), z∈(−2,−1); f is strictly increasing on (1,∞), so x is its only root there; NK/Q(α)=−1 and NK/Q(α−1)=1; α and α−1 are units of OK; and λ(α), λ(α−1) are R-linearly independent (Two independent units in a real cubic field).

[F2]

The logarithmic embedding is λ(w)=(log⁡∣σ1w∣,…,log⁡∣σr1w∣,2log⁡∣τ1w∣,… ) on K×; for the totally real K of [F1] it is λ(w)=(log⁡∣σ1w∣,log⁡∣σ2w∣,log⁡∣σ3w∣), and it is well defined because nonzero elements have nonzero images under every embedding (Logarithmic embedding of a number field).

[F3]

log⁡ is additive over products, so for u,v∈K× the coordinatewise additivity λ(uv)=λ(u)+λ(v) holds, the absolute values of the conjugates being multiplicative (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).

[F4]

Every value λ(u) of a unit u∈OK× lies in the hyperplane H={ξ:∑i=13ξi=0} (Unit logarithms lie in the trace-zero hyperplane).

[F5]

The regulator of K is RK=∣det⁡Ak∣, where A has the columns λ(ε1),…,λ(εr) for a system of fundamental units and Ak is obtained by deleting row k; deleting rows may be done before or after finite matrix products. The definition records that a change of fundamental system multiplies A on the right by a matrix in GL⁡r(Z), "which is why the absolute determinant, and not the signed one, is the invariant" (Regulator of a number field, For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[F6]

Let m≥1 and let B be an (m+1)×m real matrix of rank m whose columns have coordinate sum zero. Then for the deleted-row determinants Δk one has Δk≠0 and Δk=(−1)k−1Δ1; in particular all ∣Δk∣ are equal (Deleted-row minors of a zero-column-sum matrix agree up to sign).

[F7]

For square matrices of the same size over a commutative ring, det⁡(BC)=det⁡(B)det⁡(C) (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[F9]

Assume the Axiom of Choice. For two systems of fundamental units of a number field K the regulator RK 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).

[A1]

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

technique · derive the exact algebraic relations among the three real conjugates from the polynomial $X^3-3X+1$, translate them into relations among the logarithmic coordinates, and compare the deleted-row determinants of the two tuples through the explicit unimodular matrices
1.1F1F2F3F4

The setting is as in [F1]-[F4]: λ(α)=(a,b,c) and λ(α−1) are vectors in the hyperplane H of R3, where a=log⁡x, b=log⁡y, c=log⁡∣z∣; these logarithms are defined because x>1, 0<y<1 and ∣z∣>1; and λ is additive, λ(u1u2)=λ(u1)+λ(u2).

1.2F1algebra

Conjugate relations I: if r is any root of f, then r2−2 is again a root: from r3=3r−1 one computes r4=3r2−r, r5=−r2+9r−3, r6=9r2−6r+1, hence (r2−2)3=3r2−7 and (r2−2)3−3(r2−2)+1=(3r2−7)−3r2+6+1=0. Thus φ(r):=r2−2 maps the set {x,y,z} of the three distinct roots into itself. Now x>2, because f is strictly increasing on (1,∞) by [F1] and f(2)=22−32+1=1−2<0<f(x); hence x2−2∈(0,2), and the only roots in (0,2) are y∈(0,1) and x∈(1,2), with x2−2≠x because x2−x−2=0 would give x∈{−1,2}; therefore φ(x)=y. Similarly φ(y)=y2−2∈(−2,−1) is the root in (−2,−1), namely z. Finally z∈(−2,−3), since for s<t<−1 one has f(t)−f(s)=(t−s)(s2+st+t2−3)>0, so f is strictly increasing on (−∞,−1), and f(−2)=−1<0<f(−3)=1, so φ(z)=z2−2∈(1,2), and the only root in (1,2) is x; hence φ(z)=x.

2.1F1step 1.2algebra

Conjugate relations II: for every root r of f one has r(r2−3)=−1, hence 1/r=3−r2. Applying this to r=x and using x2−2=y gives 1/x=3−x2=1−y; applied to r=y and using y2−2=z it gives 1/y=1−z; applied to r=z and using z2−2=x it gives 1/z=1−x.

3.1F1F2F3step 2.1algebra

Logarithmic coordinates: since 1−y>0 is the inverse of x, log⁡(1−y)=−a, that is log⁡∣y−1∣=−a; since 1−z>0 is the inverse of y, log⁡∣z−1∣=−b; and since 1/z=1−x is negative with x−1>0, log⁡∣z∣=−log⁡(x−1), that is log⁡(x−1)=−c. Moreover a+b+c=log⁡∣xyz∣=log⁡∣NK/Q(α)∣=log⁡1=0 because NK/Q(α)=−1. Therefore λ(α)=(a,b,c) and λ(α−1)=(log⁡(x−1),log⁡∣y−1∣,log⁡∣z−1∣)=(−c,−a,−b) with a+b+c=0.

4.1F5F6step 3.1algebra

The logarithmic matrix of the tuple (u1,u2) is A=(a−cb−ac−b),a+b+c=0. Deleting row 1 gives Δ1=b(−b)−(−a)c=−b2+ac=−(a2+ab+b2); deleting row 2 gives Δ2=a(−b)−(−c)c=−ab+c2=a2+ab+b2; and deleting row 3 gives Δ3=a(−a)−(−c)b=−a2+bc=−(a2+ab+b2), where c=−a−b is used in each reduction. In particular all three deleted-row determinants are nonzero and have absolute value Q:=a2+ab+b2.

5.1F3F5F7step 4.1algebra

The second tuple has the same lattice and the same determinants: by additivity λ(u1u2)=λ(u1)+λ(u2), so Zλ(u1)+Zλ(u2)=Z(λ(u1)+λ(u2))+Zλ(u2), an equality of subgroups of H. In coordinates, the logarithmic matrix of (u1u2,u2) is A′=AC with C=(1011) acting on columns, whose inverse C−1=(10−11) is integral and whose determinant is 1; deleting row k commutes with right multiplication, so Ak′=AkC and det⁡Ak′=det⁡(Ak)det⁡(C)=det⁡Ak by [F7]. Thus the determinants of the two tuples are equal, not merely equal in absolute value, and ∣det⁡Ak′∣=Q as well.

6.1F7F8step 4.1step 5.1algebra

Swapping the two units, that is passing to (u2,u1), replaces A by A′′=AP with P=(0110), whose inverse is itself and whose determinant is −1; then det⁡Ak′′=det⁡(Ak)det⁡(P)=−det⁡Ak, so the sign of every deleted-row determinant is reversed and the absolute value Q is unchanged. Both C and P are invertible over Z, so by [F8] their determinants are units of Z, that is ±1, in agreement with the direct computations det⁡C=1 and det⁡P=−1.

6.2step 3.1step 4.1step 5.1algebra

Numerical value: evaluating cosine gives cos⁡(2π/9)≈0.7660444431, so x=α=2cos⁡(2π/9)≈1.5320888862, y=x2−2≈0.3472963553, and z=y2−2 satisfies ∣z∣≈1.8793852416 because z∈(−2,−1) by step 1.2; hence a=log⁡x≈0.4266320894, b=log⁡y satisfies ∣b∣≈1.0575768136, and Q=a2+ab+b2≈0.8492874506. So every deleted-row determinant of the two tuples has absolute value the number Q of the display, the signs for the tuple (u1,u2) being −, +, − as computed in step 4.1.

7.1A1F1F4F5F9step 5.1step 6.2∎

Relation to the regulator definition and choice accounting: the computation is the explicit GL⁡2(Z) step that [F5] and [F9] single out — right multiplication by an integral matrix of determinant ±1 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 (u1,u2) or (u1u2,u2) is a system of fundamental units: the common number Q 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 λ(OK×). 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

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