Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Bisector energy equals 2n(n−1)2n(n-1)2n(n−1) under bisector injectivity

Proved
NearEnemy.bisectorEnergy_eq_of_bisectorInjective

by mysticflounder · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

bisector-energydiscrete-geometryequality-characterizationnear-enemy

Let PPP be a finite set of points in the Euclidean plane (modelled as EuclideanSpace ℝ (Fin 2)), and assume BisectorInjectiveOnPairs P, i.e. distinct unordered pairs of points of PPP have distinct perpendicular bisectors. Then the bisector energy attains its absolute floor:

bisectorEnergy⁡(P)=2 ∣P∣ (∣P∣−1).\operatorname{bisectorEnergy}(P) = 2\,|P|\,(|P|-1).bisectorEnergy(P)=2∣P∣(∣P∣−1).

This is the equality characterization companion to the universal lower bound: under bisector injectivity there are no coincidences beyond the forced ones, so the energy is exactly the count of ordered pairs times two. In the project it certifies that generic projections (which force bisector injectivity) produce energy-minimal configurations.

Preamble
import Mathlib
import Definitions.Def_NearEnemyDefs

universe u_1
open scoped RealInnerProductSpace
open scoped Classical
open MvPolynomial
variable {V : Type*} [NormedAddCommGroup V] [InnerProductSpace ℝ V]
variable {ι : Type*} [Fintype ι]
open NearEnemy
Formal statement
theorem NearEnemy.bisectorEnergy_eq_of_bisectorInjective {P : Finset (EuclideanSpace ℝ (Fin 2))}
    (hP : BisectorInjectiveOnPairs P) :
    bisectorEnergy P = 2 * P.card * (P.card - 1) := by sorry
Source
Prior art: Lund-Sheffer-de Zeeuw, Bisector energy and few distinct distances, SoCG 2015, LIPIcs vol. 34, 537-552, DOI 10.4230/LIPIcs.SOCG.2015.537, footnote 1 on p. 538, state that E(P) = 2n(n-1) when every pair of distinct points has a distinct perpendicular bisector, with the count of trivial quadruples that proves the floor (this footnote is not in arXiv:1411.6868v1); the asymptotic floor E(P) = Omega(n^2) is in their section 3.4. The generic planar projection that is injective, keeps general position and transports distances is Erdos-Furedi-Pach-Ruzsa, The grid revisited, Discrete Math. 111 (1993), proof of Theorem 3.1. Formalized in https://github.com/mysticflounder/lean-formalizations/blob/dd46c17a2a034d7bfa0df02e7f77834d35592864/lean/LeanFormalizations/Geometry/Euclidean/NearEnemyTheorem.lean#L860-L885
Human review
  • Endorsed by Shuze Chen · Sep 20, 2026

  • Endorsed by mysticflounder · Sep 20, 2026

    Confirmed by the mission captain (proposal self-audit).

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me