AFTD Auto-Formalizing Theoretical Domains

LinearEquiv.ofRelabel

defimported Lean

The R-linear equivalence (d₂ → R) ≃ₗ[R] (d → R) that relabels the coordinates of a function along an index equivalence e : d ≃ d₂. This is the linear-equivalence packaging of Equiv.piCongrLeft.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {d d₁ d₂ d₃ R 𝕜 : Type*} [RCLike 𝕜] in
variable {R : Type*} [Semiring R] in
variable (R) in
@[simps]
def LinearEquiv.ofRelabel (e : d ≃ d₂) : (d₂ → R) ≃ₗ[R] (d → R)
Defined in
QuantumInfo, `LinearEquiv.ofRelabel`
Lean proof
By Alex Meiburg, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Alex Meiburg. 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
16 Oct 2026
Axioms
none listed
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {d d₁ d₂ d₃ R 𝕜 : Type*} [RCLike 𝕜] in
variable {R : Type*} [Semiring R] in
variable (R) in
/-- The `R`-linear equivalence `(d₂ → R) ≃ₗ[R] (d → R)` that relabels the coordinates of a function along an index equivalence `e : d ≃ d₂`. This is the linear-equivalence packaging of `Equiv.piCongrLeft`. -/
@[simps]
def LinearEquiv.ofRelabel (e : d ≃ d₂) : (d₂ → R) ≃ₗ[R] (d → R) := by
  refine' { e.symm.piCongrLeft (fun _ ↦ R) with .. }
  <;> (intros; ext; simp [Equiv.piCongrLeft_apply])
See it in the graphDiscuss this resultChallenge it