Quad Int — fast Disk List to Finset

Proved

D1Bound5.QuadInt.fastDiskList_toFinset

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

A propositional bridge to the existing complete disk enumeration. The proof does not evaluate a finite set of concrete coordinates.

Preamble

import Mathlib.Algebra.QuadraticAlgebra.Basic
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Int.Interval
import Mathlib.Data.Int.Sqrt
import Mathlib.Data.List.Range
import Mathlib.Tactic.Linarith
import Definitions.Def_D1Bound5_Coordinates_Definitions
import Definitions.Def_D1Bound5_DiskEnumeration_Definitions
import Definitions.Def_D1Bound5_FastDiskList_Definitions

Formal statement

section
namespace D1Bound5
namespace QuadInt








theorem _root_.D1Bound5.QuadInt.fastDiskList_toFinset (tau nu M : ℤ) :
    (fastDiskList tau nu M).toFinset = disk tau nu M := by sorry

end QuadInt
end D1Bound5
end

Source

D1Bound5/FastDiskList.lean, lines 30-41, SHA-256 60afd777700a3d6a319be0b0145eb86a6f1657a58e26c7947467097b7c482fed. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph