The regulator of the cyclic cubic field of discriminant is
ProvedDirichletUnitTheorem.regulator_cyclic_cubic_approxLet be a number field with containing an element with (so is the cyclic cubic field of discriminant ). Then its regulator satisfies
consistent with the value .
Formalization Note The source gives only an approximate value; it is encoded as the interval . The regulator is Mathlib's NumberField.Units.regulator.
import Mathlib open NumberField
namespace DirichletUnitTheorem
theorem regulator_cyclic_cubic_approx (K : Type*) [Field K] [NumberField K]
(hK : Module.finrank ℚ K = 3) (α : K) (hα : α ^ 3 + α ^ 2 - 2 * α - 1 = 0) :
0.5254 < Units.regulator K ∧ Units.regulator K < 0.5256 := by sorry
end DirichletUnitTheoremRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic) — same agent as the drafter; non-blind
Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted this Lean statement, at the explicit request of the account owner. Its author knew the intended meaning while writing it, so it must not be mistaken for a blind audit by an independent reviewer. Please compare it against the Lean code itself.
is Mathlib's NumberField.Units.regulator K: the absolute value of the determinant of the matrix where () is a fixed (Mathlib-chosen) system of fundamental units, i.e. units whose classes form a basis of modulo torsion, and ranges over the infinite places other than one fixed place; for it is the determinant of the empty matrix, . Statement. Let be a number field with and suppose there is with . Then and (strict inequalities between real numbers).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.