Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coordinate permutations of recursive splits

Definition
mme_recursive_split_coordinate_data

by Robertboy18 · Sep 23, 2026 · Mathlib 777aaa6 (Lean v4.29.0-rc3)

exact-arithmeticmatrix-multiplicationregional-extraction

A coordinate permutation transports admissible recursive splits and preserves their total grade.

Definition code
import Definitions.Def_mme_recursive_yz_owned_filters
import Mathlib.Algebra.BigOperators.Fin

open scoped BigOperators

namespace MME.RecursiveThinSplit

/-- Relabel the three modes of a recursive split, including its parent grades. -/
def coordinateEquiv {half : ℕ} (parent : Fin 3 → ℕ) (p : Equiv.Perm (Fin 3)) :
    Split half parent ≃ Split half (fun i => parent (p i)) where
  toFun c := ⟨fun i => c.val (p i), by
    constructor
    · have h := Equiv.sum_comp p (fun i => (c.val i).val)
      simp only [Fin.sum_univ_three] at h
      exact h.trans c.property.1
    · exact fun i => c.property.2 (p i)⟩
  invFun c := ⟨fun i => c.val (p.symm i), by
    constructor
    · have h := Equiv.sum_comp p.symm (fun i => (c.val i).val)
      simp only [Fin.sum_univ_three] at h
      exact h.trans c.property.1
    · intro i
      simpa using c.property.2 (p.symm i)⟩
  left_inv c := by
    apply Subtype.ext
    funext i
    exact congrArg c.val (p.apply_symm_apply i)
  right_inv c := by
    apply Subtype.ext
    funext i
    exact congrArg c.val (p.symm_apply_apply i)

@[simp] theorem coordinateEquiv_apply {half : ℕ} (parent : Fin 3 → ℕ)
    (p : Equiv.Perm (Fin 3)) (c : Split half parent) (i : Fin 3) :
    (coordinateEquiv parent p c).val i = c.val (p i) := rfl

@[simp] theorem coordinateEquiv_symm_apply {half : ℕ} (parent : Fin 3 → ℕ)
    (p : Equiv.Perm (Fin 3)) (c : Split half (fun i => parent (p i))) (i : Fin 3) :
    ((coordinateEquiv parent p).symm c).val i = c.val (p.symm i) := rfl

/-- The parent total is unchanged by a mode permutation. -/
theorem coordinate_total {half : ℕ} {parent : Fin 3 → ℕ}
    (h : parent 0 + parent 1 + parent 2 = 2 * half) (p : Equiv.Perm (Fin 3)) :
    parent (p 0) + parent (p 1) + parent (p 2) = 2 * half := by
  have hs := Equiv.sum_comp p parent
  simp only [Fin.sum_univ_three] at hs
  exact hs.trans h

end MME.RecursiveThinSplit

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