“Is the best known packing of three equal circles in a 1 by 1/2 rectangle optimal?”
Lemma 3 (3. segédtétel), p. 74: for 0 ≤ y ≤ √3 and any n, min x = (n−1)√(4−y²) (unit radius, centres in a y × x rectangle). M. Ruda, Körelhelyezések téglalapokon, MTA Mat. Fiz. Oszt. Közl. 19 (1970) 73–87, no DOI. Here n = 3, y ≈ 0.823 < √3, which gives exactly this radius. Found after filing; read from the scan 2026-10-10
Contributors
Verification
Verdict report: artifact 977cd10e
CI run: GitHub Actions log
Checks passed: build, axioms, manifest, no new axioms, static policy, anti restatement
Axioms: Classical.choice, Quot.sound, propext
Toolchain: Lean v4.33.0, Mathlib db584cd (Jig's pins)
Solution
import Mathlib.Analysis.Real.Sqrt import Mathlib.Data.Fin.VecNotation import Mathlib.Tactic.FinCases import Mathlib.Tactic.Linarith import Mathlib.Tactic.NormNum import Mathlib.Tactic.CasesM /-! Optimality of the Packomania packing of three equal circles in `[0,1] × [0,1/2]`. Lower bound: centres `(r, r)`, `(1 - r, r)`, `(1/2, 1/2 - r)` with `r = (3 - √7)/2`. Upper bound (pigeonhole): two of the three centres lie on the same side of `x = 1/2`, so their `x`-gap is at most `1/2 - r` and their `y`-gap at most `1/2 - 2r`. Hence `4r² ≤ (1/2 - r)² + (1/2 - 2r)²`, i.e. `r² - 3r + 1/2 ≥ 0`, and with `r ≤ 1/4` this forces `r ≤ (3 - √7)/2`. -/
Pigeonhole.lean