TensorSpecies.Tensor.IsReindexing
defimported Lean
Given two lists of indices c : Fin n → C and c1 : Fin m → C a map σ : Fin m → Fin n satisfies the condition IsReindexing c c1 σ if it is: - A bijection - Forms a commutative triangle with c and c1.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Module in variable {C : Type} in def TensorSpecies.Tensor.IsReindexing {n m : ℕ} (c : Fin n → C) (c1 : Fin m → C) (σ : Fin m → Fin n) : Prop
- Defined in
- Physlib, `TensorSpecies.Tensor.IsReindexing`
- 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← TensorSpecies.Tensor.IsReindexing (Physlib/Relativity/Tensors/Reindexing.lean:76): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 41
- TensorSpecies.Tensor.IsReindexing.inv_id_eqTensorSpecies.Tensor.IsReindexing.inv_id_eq
- TensorSpecies.Tensor.IsReindexing.update_update_of_eqUpdating slot
iofctodand then back toe = c ireturnsc, no other slot moving: the colour cast a round trip of two… - TensorSpecies.Tensor.IsReindexing.append_swapTensorSpecies.Tensor.IsReindexing.append_swap
- TensorSpecies.Tensor.IsReindexing.fin_cast_isReindexingCasting the domain along an equality
n1 = nof lengths is a reindexing ofcbyc ∘ Fin.cast h. - TensorSpecies.Tensor.IsReindexing.symmThe inverse of a map satisfying
IsReindexing c c1 σis a reindexing ofc1byc. - TensorSpecies.Tensor.IsReindexing.succAbove_of_succAbove_eqThe conclusion of
succAbovefrom an explicit survivor relabelling: ifσ'fills the square(σ i).succAbove ∘ σ' = σ ∘ i.succAbove,… - TensorSpecies.Tensor.IsReindexing.preserve_colorTensorSpecies.Tensor.IsReindexing.preserve_color
- TensorSpecies.Tensor.IsReindexing.invFor a map
σsatisfyingIsReindexing c c1 σ, the inverse of that map. - TensorSpecies.Tensor.IsReindexing.succAbove_succSuccAbove_commRemoving one entry and then a pair of entries from
cin either order gives the same colour list: removing thek-th entry and then the… - TensorSpecies.Tensor.IsReindexing.injectiveTensorSpecies.Tensor.IsReindexing.injective
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_commTensorSpecies.Tensor.IsReindexing.succSuccAbove_succAbove_comm
- TensorSpecies.Tensor.IsReindexing.append_assoc_leftTensorSpecies.Tensor.IsReindexing.append_assoc_left
- TensorSpecies.Tensor.IsReindexing.append_succAbove_castAddTensorSpecies.Tensor.IsReindexing.append_succAbove_castAdd
- TensorSpecies.Tensor.IsReindexing.append_succSuccAbove_natAddRemoving two entries from the right component of
Fin.append c1 ccommutes with the append: removing thei-th andj-th entries ofc… - TensorSpecies.Tensor.IsReindexing.surjectiveTensorSpecies.Tensor.IsReindexing.surjective
- TensorSpecies.Tensor.IsReindexing.autoTensorSpecies.Tensor.IsReindexing.auto
- TensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eqTensorSpecies.Tensor.IsReindexing.inv_equiv_symm_eq
- TensorSpecies.Tensor.IsReindexing.on_idTensorSpecies.Tensor.IsReindexing.on_id
- TensorSpecies.Tensor.IsReindexing.succSuccAbove_commRemoving two pairs of entries from
cin either order gives the same colour list: removing thei1-th andj1-th entries and then the… - TensorSpecies.Tensor.IsReindexing.inv_perserve_colorTensorSpecies.Tensor.IsReindexing.inv_perserve_color
- TensorSpecies.Tensor.IsReindexing.inv_eq_self_of_pointwise_eqTensorSpecies.Tensor.IsReindexing.inv_eq_self_of_pointwise_eq
- TensorSpecies.Tensor.IsReindexing.append_zero_rightTensorSpecies.Tensor.IsReindexing.append_zero_right
- 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.append_congr_rightTensorSpecies.Tensor.IsReindexing.append_congr_right
- TensorSpecies.Tensor.IsReindexing.swapTensorSpecies.Tensor.IsReindexing.swap
- TensorSpecies.Tensor.IsReindexing.append_congr_leftTensorSpecies.Tensor.IsReindexing.append_congr_left
- TensorSpecies.Tensor.IsReindexing.toEquivFor a map
σ : Fin m → Fin nsatisfyingIsReindexing c c1 σ, that map lifted to an equivalence betweenFin nandFin m. - TensorSpecies.Tensor.IsReindexing.inv_apply_applyTensorSpecies.Tensor.IsReindexing.inv_apply_apply
- TensorSpecies.Tensor.IsReindexing.append_succ_lastSplitting a list of colours
c : Fin (n + 1) → Cinto its firstnentries and its last entry recoversc: the identity permutation… - TensorSpecies.Tensor.IsReindexing.inv_cast_eqTensorSpecies.Tensor.IsReindexing.inv_cast_eq
- TensorSpecies.Tensor.IsReindexing.succAboveGiven a reindexing of
cbyc1viaσ, removing thei-th entry ofc1and the(σ i)-th entry ofcyields a reindexing of… - TensorSpecies.Tensor.IsReindexing.append_of_firstSplitting a list of colours
c : Fin (n + 1) → Cinto its first entry and its remainingnentries recoversc: the canonical… - TensorSpecies.Tensor.IsReindexing.compThe composition of two maps satisfying
IsReindexingalso satisfies theIsReindexing. - TensorSpecies.Tensor.IsReindexing.on_id_symmTensorSpecies.Tensor.IsReindexing.on_id_symm
- TensorSpecies.Tensor.IsReindexing.apply_inv_applyTensorSpecies.Tensor.IsReindexing.apply_inv_apply
- TensorSpecies.Tensor.IsReindexing.succAbove_succAbove_commRemoving two single entries from
cin either order gives the same colour list: removing thek1-th entry and then the (shifted)k2-th… - TensorSpecies.Tensor.IsReindexing.symm_of_idTensorSpecies.Tensor.IsReindexing.symm_of_id
- TensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_colorTensorSpecies.Tensor.IsReindexing.toEquiv_symm_perserve_color
- TensorSpecies.Tensor.IsReindexing.append_assoc_rightTensorSpecies.Tensor.IsReindexing.append_assoc_right
- 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… - TensorSpecies.Tensor.IsReindexing.append_succAbove_natAddTensorSpecies.Tensor.IsReindexing.append_succAbove_natAdd
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Module in variable {C : Type} in /-- Given two lists of indices `c : Fin n → C` and `c1 : Fin m → C` a map `σ : Fin m → Fin n` satisfies the condition `IsReindexing c c1 σ` if it is: - A bijection - Forms a commutative triangle with `c` and `c1`. -/ def TensorSpecies.Tensor.IsReindexing {n m : ℕ} (c : Fin n → C) (c1 : Fin m → C) (σ : Fin m → Fin n) : Prop := Function.Bijective σ ∧ ∀ i, c (σ i) = c1 i