Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Regrouping joint elementary coordinates by owner

Definition
mme_released_joint_interior_position_data

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

exact-arithmeticmatrix-multiplicationregional-extraction

An explicit equivalence regroups the elementary positions of all six joint regions by owner and parent label. An embedding selects one label while preserving child halves and elementary entries, proving that the selected physical coordinates are distinct.

Definition code
import Definitions.Def_mme_released_joint_interior_frame

namespace MME.ReleasedJointInterior

/-- One elementary coordinate is a child occurrence and one of its two entries. -/
noncomputable def childFineEquiv (r : Fin 6) (k : ℕ) :
    Fin (blocks r k * 4) ≃ RecursiveYZ.Position (size r k) × Fin 2 :=
  (finCongr (positions_length r k).symm).trans
    (finProdFinEquiv.symm.trans ((positions r k).prodCongr (Equiv.refl (Fin 2))))

/-- Regroup all elementary positions by owner and parent label. Both child
halves and their elementary entries retain their original order. -/
noncomputable def jointFineEquiv (k : ℕ) :
    (Σ r : Fin 6, Fin (blocks r k * 4)) ≃
      (Σ j : Fin 270, RecursiveYZ.Position (fun r => size r k j) × Fin 2) where
  toFun p :=
    let c := childFineEquiv p.1 k p.2
    ⟨c.1.1, ⟨⟨p.1,c.1.2⟩,c.2⟩⟩
  invFun p :=
    ⟨p.2.1.1, (childFineEquiv p.2.1.1 k).symm (⟨p.1,p.2.1.2⟩,p.2.2)⟩
  left_inv := by
    rintro ⟨r,t⟩
    dsimp
    simp only [Sigma.eta, Prod.eta, Equiv.symm_apply_apply]
  right_inv := by
    rintro ⟨j,⟨r,t,h⟩,q⟩
    exact congrArg (fun c : RecursiveYZ.Position (size r k) × Fin 2 =>
      (⟨c.1.1, ⟨⟨r,c.1.2⟩,c.2⟩⟩ :
        Σ j : Fin 270, RecursiveYZ.Position (fun r => size r k j) × Fin 2))
      ((childFineEquiv r k).apply_symm_apply (⟨j,t,h⟩,q))

/-- Select one owner's parent label from the regrouped elementary coordinates.
The embedding proves that no physical coordinate is repeated. -/
noncomputable def ownerFineEmbedding (k : ℕ) (j : Fin 270) {L N : ℕ}
    (e : Fin L ≃ RecursiveYZ.Position (fun r => size r k j))
    (length : L * 2 ^ (2 - 1) = N) :
    Fin N ↪ (Σ r : Fin 6, Fin (blocks r k * 4)) :=
  ((finCongr length.symm).trans
    (finProdFinEquiv.symm.trans (e.prodCongr (Equiv.refl (Fin 2))))).toEmbedding.trans
    ((⟨fun p => ⟨j,p⟩, by intro a b h; cases h; rfl⟩ :
      (RecursiveYZ.Position (fun r => size r k j) × Fin 2) ↪
        (Σ j : Fin 270, RecursiveYZ.Position (fun r => size r k j) × Fin 2)).trans
      (jointFineEquiv k).symm.toEmbedding)

end MME.ReleasedJointInterior

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