TensorSpecies.Tensor.IsReindexing.succAbove
theoremverifiedformalizationimported Lean
Given a reindexing of c by c1 via σ, removing the i-th entry of c1 and the (σ i)-th entry of c yields a reindexing of c ∘ (σ i).succAbove by c1 ∘ i.succAbove. This unifies succAbove_of_eq_zero and succAbove_of_neq_zero via a case split on whether σ i = 0. This is used for the commutation of *permutation* of indices with *evaluation* of indices.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open TensorSpecies TensorSpecies.Tensor TensorSpecies.Tensor.IsReindexing in open Module in variable {C : Type} in open Fin in lemma TensorSpecies.Tensor.IsReindexing.succAbove {n n1 : ℕ} {c : Fin (n + 1) → C} {c1 : Fin (n1 + 1) → C} {σ : Fin (n1 + 1) → Fin (n + 1)} (i : Fin (n1 + 1)) (h : IsReindexing c c1 σ) : IsReindexing (c ∘ (σ i).succAbove) (c1 ∘ i.succAbove) (if hi : σ i = 0 then fun j => (σ (i.succAbove j)).pred (by simp [← hi, h.injective.eq_iff]) else (Fin.pred (σ i) hi).predAbove ∘ σ ∘ i.succAbove)
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.succAbove`
- 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← TensorSpecies.Tensor.IsReindexing.succAbove (Physlib/Relativity/Tensors/Reindexing.lean:409): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 7
- TensorSpecies.Tensor.IsReindexing.injectiveTensorSpecies.Tensor.IsReindexing.injective
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.inv_perserve_colorTensorSpecies.Tensor.IsReindexing.inv_perserve_color
- TensorSpecies.Tensor.IsReindexing.succAbove_of_neq_zeroGiven a reindexing of
cbyc1viaσfor which the indexiis not sent to0, removing thei-th entry ofc1and the(σ i)-th… - 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… - TensorSpecies.Tensor.IsReindexing.succAbove_of_eq_zeroGiven a reindexing of
cbyc1viaσfor which the indexiis sent to0, removing thei-th entry ofc1and the first entry of…
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 TensorSpecies.Tensor.IsReindexing inopen Module invariable {C : Type} inopen Fin in/-- Given a reindexing of `c` by `c1` via `σ`, removing the `i`-th entry of `c1` and the `(σ i)`-th entry of `c` yields a reindexing of `c ∘ (σ i).succAbove` by `c1 ∘ i.succAbove`. This unifies `succAbove_of_eq_zero` and `succAbove_of_neq_zero` via a case split on whether `σ i = 0`. This is used for the commutation of *permutation* of indices with *evaluation* of indices. -/lemma TensorSpecies.Tensor.IsReindexing.succAbove {n n1 : ℕ} {c : Fin (n + 1) → C} {c1 : Fin (n1 + 1) → C} {σ : Fin (n1 + 1) → Fin (n + 1)} (i : Fin (n1 + 1)) (h : IsReindexing c c1 σ) : IsReindexing (c ∘ (σ i).succAbove) (c1 ∘ i.succAbove) (if hi : σ i = 0 then fun j => (σ (i.succAbove j)).pred (by simp [← hi, h.injective.eq_iff]) else (Fin.pred (σ i) hi).predAbove ∘ σ ∘ i.succAbove) := by by_cases hi : σ i = 0 · simpa [hi] using IsReindexing.succAbove_of_eq_zero i h hi · simpa [hi] using IsReindexing.succAbove_of_neq_zero i h hi