AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.toEquiv

defimported Lean

For a map σ : Fin m → Fin n satisfying IsReindexing c c1 σ, that map lifted to an equivalence between Fin n and Fin m.

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
def TensorSpecies.Tensor.IsReindexing.toEquiv {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) :
    Fin n ≃ Fin m
Defined in
Physlib, `TensorSpecies.Tensor.IsReindexing.toEquiv`
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.
Verified
09 Oct 2026
Axioms
none listed
Built on 3
Used by 6

Lean source view module on GitHub

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
/-- For a map `σ : Fin m → Fin n` satisfying `IsReindexing c c1 σ`, that map lifted to an equivalence between `Fin n` and `Fin m`. -/
def TensorSpecies.Tensor.IsReindexing.toEquiv {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    {σ : Fin m → Fin n} (h : IsReindexing c c1 σ) :
    Fin n ≃ Fin m where
  toFun := inv σ h
  invFun := σ
  left_inv := Fintype.rightInverse_bijInv h.1
  right_inv := Fintype.leftInverse_bijInv h.1
See it in the graphDiscuss this resultChallenge it