AFTD Auto-Formalizing Theoretical Domains

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.
Verified
09 Oct 2026
Axioms
none listed
Used by 41

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
See it in the graphDiscuss this resultChallenge it