Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Tao's two-Lipschitz-graph inscribed square theorem

Open
SquarePeg.tao_two_lipschitz_graphs

by LG · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

geometryjordan-curvetopology

Let f,g:[t0,t1]→Rf,g:[t_0,t_1]\to\mathbb{R}f,g:[t0​,t1​]→R be Lipschitz functions with Lipschitz constant strictly less than 111, agreeing at the endpoints, and suppose the union of their graphs is a Jordan curve CCC. Then CCC inscribes a non-degenerate square. This is Tao's positive case of the square peg problem for a class of curves that need not be smooth.

Preamble
import Mathlib
import Definitions.Def_SchoenfliesCurveCore
import Definitions.Def_SquarePeg_shapes
import Definitions.Def_SquarePeg_classes
import Definitions.Def_SquarePeg_similarity
open Schoenflies
Formal statement
namespace SquarePeg

theorem tao_two_lipschitz_graphs (t0 t1 : ℝ) (ht : t0 < t1) (f g : ℝ → ℝ)
    (hf : ∃ K : NNReal, (K : ℝ) < 1 ∧ LipschitzOnWith K f (Set.Icc t0 t1))
    (hg : ∃ K : NNReal, (K : ℝ) < 1 ∧ LipschitzOnWith K g (Set.Icc t0 t1))
    (hends : f t0 = g t0 ∧ f t1 = g t1)
    (C : Set Plane)
    (hCdef : C = {p : Plane | p 0 ∈ Set.Icc t0 t1 ∧ (p 1 = f (p 0) ∨ p 1 = g (p 0))})
    (hC : IsJordanCurve C) :
    ∃ p1 p2 p3 p4 : Plane, p1 ∈ C ∧ p2 ∈ C ∧ p3 ∈ C ∧ p4 ∈ C ∧ IsSquare p1 p2 p3 p4 := by sorry

end SquarePeg
Source
Tao, An integration approach to the Toeplitz square peg problem, Forum Math. Sigma 5 (2017), e30 (arXiv:1611.07441), the case of a union of two Lipschitz graphs of constant < 1 agreeing at the endpoints (blog announcement, Theorem 3(i)).

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