Nielsen's inscribed triangles theorem
OpenSquarePeg.nielsen_inscribed_trianglesgeometryjordan-curvetopology
Let be a Jordan curve and a non-degenerate triangle, with a vertex of smallest angle (equivalently, the opposite side is a shortest side). Then inscribes infinitely many triangles similar to (the set of inscribed similar triples is infinite), and the set of vertices on corresponding to is dense in . Similarity allows reflection.
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 nielsen_inscribed_triangles (C : Set Plane) (hC : IsJordanCurve C)
(t1 t2 t3 : Plane) (hT : ¬ Collinear ℝ ({t1, t2, t3} : Set Plane))
(hmin : dist t2 t3 ≤ dist t1 t2 ∧ dist t2 t3 ≤ dist t1 t3) :
Set.Infinite {p : Plane × Plane × Plane |
p.1 ∈ C ∧ p.2.1 ∈ C ∧ p.2.2 ∈ C ∧ SimilarTriangle p.1 p.2.1 p.2.2 t1 t2 t3} ∧
C ⊆ closure {p1 : Plane | p1 ∈ C ∧
∃ p2 p3 : Plane, p2 ∈ C ∧ p3 ∈ C ∧ SimilarTriangle p1 p2 p3 t1 t2 t3} := by sorry
end SquarePegSource
Nielsen, Triangles inscribed in simple closed curves, Geom. Dedicata 43 (1992), 291-297; statement as in Matschke survey Theorem 6 (p. 350).