AFTD Auto-Formalizing Theoretical Domains

TensorSpecies.Tensor.IsReindexing.inv

defimported Lean

For a map σ satisfying IsReindexing c c1 σ, the inverse of that map.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
def TensorSpecies.Tensor.IsReindexing.inv {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.inv`
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 2
Used by 9

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open TensorSpecies TensorSpecies.Tensor in
open Module in
variable {C : Type} in
/-- For a map `σ` satisfying `IsReindexing c c1 σ`, the inverse of that map. -/
def TensorSpecies.Tensor.IsReindexing.inv {n m : ℕ} {c : Fin n → C} {c1 : Fin m → C}
    (σ : Fin m → Fin n) (h : IsReindexing c c1 σ) : Fin n → Fin m :=
  Fintype.bijInv h.1
See it in the graphDiscuss this resultChallenge it