Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Fixed anchors and labels induced by isometries

Definition
Esgk_SelfCurveExceptionalIsometryFamilies

by mysticflounder · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrygeometry

For a plane isometry, this defines sample anchors fixed by it and ordered sample pairs related by it. Taking unions over finite isometry families gives the corresponding exceptional anchor and label sets.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Definitions.Def_Esgk_SelfCurveExceptionalAnchors
import Definitions.Def_LeanFormalizations_PachDeZeeuw_Basic
import Definitions.Def_LeanFormalizations_PachDeZeeuw_CurveInterface
import Mathlib

/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam McKenna
-/


namespace Esgk

open EuclideanGeometry PachDeZeeuw

 
noncomputable def selfCurveFixedAnchorsFor {d : ℕ}
    (X : PreparedBipartiteInput d) (g : Point2 ≃ᵢ Point2) : Finset X.P₁ := by
  classical
  exact Finset.univ.filter fun p ↦ g (p : Point2) = (p : Point2)


noncomputable def selfCurveAxisAnchorsFromReflections {d : ℕ}
    (X : PreparedBipartiteInput d) (reflections : Finset (Point2 ≃ᵢ Point2)) :
    Finset X.P₁ := by
  classical
  exact reflections.biUnion (selfCurveFixedAnchorsFor X)


noncomputable def selfCurveSymmetryLabelsFor {d : ℕ}
    (X : PreparedBipartiteInput d) (g : Point2 ≃ᵢ Point2) :
    Finset (X.P₁ × X.P₁) := by
  classical
  exact (Finset.univ.product Finset.univ).filter fun ij ↦
    g (ij.1 : Point2) = (ij.2 : Point2)


noncomputable def selfCurveSymmetryLabels {d : ℕ}
    (X : PreparedBipartiteInput d) (symmetries : Finset (Point2 ≃ᵢ Point2)) :
    Finset (X.P₁ × X.P₁) := by
  classical
  exact symmetries.biUnion (selfCurveSymmetryLabelsFor X)


end Esgk

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me