Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Twenty-five points in the unit square have a close pair

Open
CirclePackingConstants.twentyfive_unit_square_close_pair

by Tamas Fulop · Sep 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

combinatoricsdiscrete-geometrypacking

Any twenty-five points in the unit square contain two distinct points at squared distance at most 1/161/161/16.

This is the pigeonhole core of the five-by-five grid upper bound: with r25=1/10r_{25}=1/10r25​=1/10 the separation scale is d=1/4d=1/4d=1/4. Like its sixteen-point sibling it separates finite combinatorics from the routine packing normalization.

Formalization Note The bound is stated evaluated (1/161/161/16 rather than $(1/4)^2`).

Preamble
import Definitions.Def_CirclePackingConstants
Formal statement
namespace CirclePackingConstants

theorem twentyfive_unit_square_close_pair : forall p : Fin 25 -> Point, (forall i, 0 ≤ (p i).1 ∧ (p i).1 ≤ 1 ∧ 0 ≤ (p i).2 ∧ (p i).2 ≤ 1) -> exists i j, i ≠ j ∧ sqDist (p i) (p j) ≤ (1 : Rat)/16 := by sorry

end CirclePackingConstants
Source
Circle packing in a square, five-by-five grid upper bound (Section 7): plotted against the proved three-by-three analogue. Companion to the six- and eight-point close-pair lemmas.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me