For a fundamental discriminant , has a solution with
ProvedClassNumberFormula.pell_four_solvableclass-number-formulanumber-theory
Let be a fundamental discriminant. Then there are positive integers with
The source takes such a solution, with minimal, to define ; this milestone records that the solution exists, so that is well defined.
Preamble
import Mathlib import Definitions.Def_ClassNumberFormula_Kronecker open NumberField NumberField.InfinitePlace NumberField.Units Filter Topology Real
Formal statement
namespace ClassNumberFormula
theorem pell_four_solvable (d : ℤ) (hd : IsFundamentalDiscriminant d) (hpos : 0 < d) :
∃ t u : ℕ, 0 < t ∧ 0 < u ∧ (t : ℤ) ^ 2 - d * (u : ℤ) ^ 2 = 4 := by sorry
end ClassNumberFormulaSource
Wikipedia, "Class number formula" (revision oldid=1366411311), https://en.wikipedia.org/w/index.php?title=Class_number_formula&oldid=1366411311, section "Dirichlet class number formula" ("For d > 0, let t > 0, u > 0 be the solution to the Pell equation for which u is smallest")
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.