Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Polynomial substitution by affine isometries

Definition
Esgk_PlaneAffineIsometryPolynomial

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

algebraic-geometrygeometry

This constructs coordinate polynomials and the induced substitution map for an affine isometry of the real plane. Substitution by the inverse isometry gives the inverse algebra map on plane polynomials.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Definitions.Def_LeanFormalizations_PachDeZeeuw_AlgebraicPrelim
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
-/


noncomputable section

namespace Esgk

open PachDeZeeuw.Algebraic

 
noncomputable def bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis : Module.Basis (Fin 2) ℝ Point2 :=
  (EuclideanSpace.basisFun (Fin 2) ℝ).toBasis

 
noncomputable def planeAffineCoordinatePolynomial
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) (i : Fin 2) : PlanePoly :=
  g.linearIsometryEquiv.toLinearEquiv.toLinearMap.toMvPolynomial
      bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis i +
    MvPolynomial.C ((g 0) i)

 
@[simp]
theorem eval_planeAffineCoordinatePolynomial
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) (z : Point2) (i : Fin 2) :
    MvPolynomial.eval (fun j ↦ z j) (planeAffineCoordinatePolynomial g i) = (g z) i := by
  have hlinear :=
    LinearMap.toMvPolynomial_eval_eq_apply bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis
      g.linearIsometryEquiv.toLinearEquiv.toLinearMap i (bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis.repr z)
  have hlinear' :
      MvPolynomial.eval (fun j ↦ z j)
          (g.linearIsometryEquiv.toLinearEquiv.toLinearMap.toMvPolynomial
            bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis i) =
        (g.linearIsometryEquiv z) i := by
    have hrepr : bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis.repr z = fun j ↦ z j := by
      funext j
      simp [bundle_Esgk_PlaneAffineIsometryPolynomial_point2Basis, OrthonormalBasis.coe_toBasis_repr_apply,
        EuclideanSpace.basisFun_repr]
    rw [hrepr] at hlinear
    exact hlinear
  have haffine : g z = g.linearIsometryEquiv z + g 0 := by
    simpa [AffineIsometryEquiv.linear_eq_linear_isometry] using
      g.toAffineEquiv.map_vadd (0 : Point2) z
  rw [planeAffineCoordinatePolynomial, map_add, MvPolynomial.eval_C, hlinear', haffine]
  rfl

 
noncomputable def planeAffinePolynomialHom
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) : PlanePoly →ₐ[ℝ] PlanePoly :=
  MvPolynomial.bind₁ (planeAffineCoordinatePolynomial g)


theorem eval_planeAffinePolynomialHom
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) (p : PlanePoly) (z : Point2) :
    MvPolynomial.eval (fun i ↦ z i) (planeAffinePolynomialHom g p) =
      MvPolynomial.eval (fun i ↦ g z i) p := by
  change
    MvPolynomial.eval₂Hom (RingHom.id ℝ) (fun i ↦ z i)
        (MvPolynomial.bind₁ (planeAffineCoordinatePolynomial g) p) =
      MvPolynomial.eval₂Hom (RingHom.id ℝ) (fun i ↦ g z i) p
  rw [MvPolynomial.eval₂Hom_bind₁]
  apply MvPolynomial.eval₂Hom_congr rfl
  · funext i
    exact eval_planeAffineCoordinatePolynomial g z i
  · rfl

 
theorem bind_planeAffineCoordinatePolynomial_symm
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) (i : Fin 2) :
    MvPolynomial.bind₁ (planeAffineCoordinatePolynomial g)
        (planeAffineCoordinatePolynomial g.symm i) =
      MvPolynomial.X i := by
  apply MvPolynomial.funext
  intro z
  let x : Point2 := WithLp.toLp 2 z
  calc
    MvPolynomial.eval z
        (MvPolynomial.bind₁ (planeAffineCoordinatePolynomial g)
          (planeAffineCoordinatePolynomial g.symm i)) =
        MvPolynomial.eval (fun j ↦ g x j)
          (planeAffineCoordinatePolynomial g.symm i) := by
            simpa [planeAffinePolynomialHom, x] using
              eval_planeAffinePolynomialHom g (planeAffineCoordinatePolynomial g.symm i) x
    _ = (g.symm (g x)) i := eval_planeAffineCoordinatePolynomial g.symm (g x) i
    _ = MvPolynomial.eval z (MvPolynomial.X i) := by simp [x]

 
theorem bind_symm_planeAffineCoordinatePolynomial
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) (i : Fin 2) :
    MvPolynomial.bind₁ (planeAffineCoordinatePolynomial g.symm)
        (planeAffineCoordinatePolynomial g i) =
      MvPolynomial.X i := by
  simpa using bind_planeAffineCoordinatePolynomial_symm g.symm i

 
theorem planeAffinePolynomialHom_comp_symm (g : Point2 ≃ᵃⁱ[ℝ] Point2) :
    (planeAffinePolynomialHom g).comp (planeAffinePolynomialHom g.symm) =
      AlgHom.id ℝ PlanePoly := by
  apply MvPolynomial.algHom_ext
  intro i
  simpa [planeAffinePolynomialHom] using bind_planeAffineCoordinatePolynomial_symm g i

 
theorem planeAffinePolynomialHom_symm_comp (g : Point2 ≃ᵃⁱ[ℝ] Point2) :
    (planeAffinePolynomialHom g.symm).comp (planeAffinePolynomialHom g) =
      AlgHom.id ℝ PlanePoly := by
  apply MvPolynomial.algHom_ext
  intro i
  simpa [planeAffinePolynomialHom] using bind_symm_planeAffineCoordinatePolynomial g i

 
noncomputable def planeAffinePolynomialEquiv
    (g : Point2 ≃ᵃⁱ[ℝ] Point2) : PlanePoly ≃ₐ[ℝ] PlanePoly :=
  AlgEquiv.ofAlgHom (planeAffinePolynomialHom g) (planeAffinePolynomialHom g.symm)
    (planeAffinePolynomialHom_comp_symm g) (planeAffinePolynomialHom_symm_comp g)


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