TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm
theoremverifiedformalizationimported Lean
Removing two single entries from c in either order gives the same colour list: removing the k1-th entry and then the (shifted) k2-th entry matches removing the k2-th entry first and then the (shifted) k1-th entry, via the identity permutation. This is used for the commutation of two *evaluations* of indices.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open TensorSpecies TensorSpecies.Tensor in open Module in variable {C : Type} in open Fin in lemma TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1) → C} (k1 : Fin (n + 1 + 1)) (k2 : Fin (n + 1)) : let k2' := k1.succAbove k2; let k1' := k2.predAbove k1; IsReindexing ((c ∘ k2'.succAbove) ∘ k1'.succAbove) ((c ∘ k1.succAbove) ∘ k2.succAbove) id
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2025 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm← TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm (Physlib/Relativity/Tensors/Reindexing.lean:518): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 4
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.inv_perserve_colorTensorSpecies.Tensor.IsReindexing.inv_perserve_color
- TensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_colorTensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_color
- TensorSpecies.Tensor.IsReindexingGiven two lists of indices
c : Fin n → Candc1 : Fin m → Ca mapσ : Fin m → Fin nsatisfies the conditionIsReindexing c c1 σif…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inopen TensorSpecies TensorSpecies.Tensor inopen Module invariable {C : Type} inopen Fin in/-- Removing two single entries from `c` in either order gives the same colour list: removing the `k1`-th entry and then the (shifted) `k2`-th entry matches removing the `k2`-th entry first and then the (shifted) `k1`-th entry, via the identity permutation. This is used for the commutation of two *evaluations* of indices. -/lemma TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_comm {n : ℕ} {c : Fin (n + 1 + 1) → C} (k1 : Fin (n + 1 + 1)) (k2 : Fin (n + 1)) : let k2' := k1.succAbove k2; let k1' := k2.predAbove k1; IsReindexing ((c ∘ k2'.succAbove) ∘ k1'.succAbove) ((c ∘ k1.succAbove) ∘ k2.succAbove) id := by intro k2' k1' refine ⟨Function.bijective_id, fun m => ?_⟩ simp only [id_eq, Function.comp_apply] congr 1 exact Fin.succAbove_succAbove_succAbove_predAbove k1 k2 m