TensorSpecies.Tensor.IsReindexing.succAbove_of_neq_zero
theoremverifiedformalizationimported Lean
Given a reindexing of c by c1 via σ for which the index i is not sent to 0, 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 via the map (σ i).pred.predAbove ∘ σ ∘ i.succAbove.
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_of_neq_zero {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 σ) (hi : σ i ≠ 0) : IsReindexing (c ∘ (σ i).succAbove) (c1 ∘ i.succAbove) ((Fin.pred (σ i) hi).predAbove ∘ σ ∘ i.succAbove)
- Formalizes
- Physlib, `TensorSpecies.Tensor.IsReindexing.succAbove_of_neq_zero`
- 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_of_neq_zero← TensorSpecies.Tensor.IsReindexing.succAbove_of_neq_zero (Physlib/Relativity/Tensors/Reindexing.lean:370): verbatim
- Verified
- 10 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 8
- TensorSpecies.Tensor.IsReindexing.symmThe inverse of a map satisfying
IsReindexing c c1 σis a reindexing ofc1byc. - TensorSpecies.Tensor.IsReindexing.preserve_colorTensorSpecies.Tensor.IsReindexing.preserve_color
- TensorSpecies.Tensor.IsReindexing.injectiveTensorSpecies.Tensor.IsReindexing.injective
- TensorSpecies.Tensor.IsReindexing.surjectiveTensorSpecies.Tensor.IsReindexing.surjective
- 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…
- TensorSpecies.Tensor.IsReindexing.symmThe inverse of a map satisfying
- Used by 1
- TensorSpecies.Tensor.IsReindexing.succAboveGiven a reindexing of
cbyc1viaσ, removing thei-th entry ofc1and the(σ i)-th entry ofcyields a reindexing of…
- TensorSpecies.Tensor.IsReindexing.succAboveGiven a reindexing 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 `σ` for which the index `i` is not sent to `0`, 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` via the map `(σ i).pred.predAbove ∘ σ ∘ i.succAbove`. -/lemma TensorSpecies.Tensor.IsReindexing.succAbove_of_neq_zero {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 σ) (hi : σ i ≠ 0) : IsReindexing (c ∘ (σ i).succAbove) (c1 ∘ i.succAbove) ((Fin.pred (σ i) hi).predAbove ∘ σ ∘ i.succAbove) := by have hpr : σ i = ((σ i).pred hi).succ := (Fin.succ_pred _ _).symm have hne : ∀ x, σ (i.succAbove x) ≠ σ i := fun x heq => Fin.succAbove_ne i x (h.injective heq) refine ⟨⟨?_, ?_⟩, ?_⟩ · intro x1 x2 h2 simp only [Function.comp_apply] at h2 apply i.succAbove_right_injective (h.injective ?_) suffices h' : ((σ i).pred hi).succ.succAbove (((σ i).pred hi).predAbove (σ (i.succAbove x1))) = ((σ i).pred hi).succ.succAbove (((σ i).pred hi).predAbove (σ (i.succAbove x2))) by rwa [Fin.succ_succAbove_predAbove (hpr ▸ hne x1), Fin.succ_succAbove_predAbove (hpr ▸ hne x2)] at h' simpa using h2 · intro k simp only [Function.comp_apply] suffices h' : ∃ a, σ (i.succAbove a) = (σ i).succAbove k by conv => enter [1, a]; rw [← ((σ i).pred hi).succ.succAbove_right_injective.eq_iff] obtain ⟨a, h'⟩ := h' exact ⟨a, by rw [Fin.succ_succAbove_predAbove (hpr ▸ hne a), ← hpr]; exact h'⟩ obtain ⟨j, hj⟩ := h.surjective ((σ i).succAbove k) simp only [← hj, h.injective.eq_iff, Fin.exists_succAbove_eq_iff, ne_eq] rintro rfl simp at hj · intro x simp only [h.preserve_color, Function.comp_apply] congr 1 conv_lhs => enter[1]; rw [hpr] exact Fin.succ_succAbove_predAbove (hpr ▸ hne x)