Physlib.Fin.involutionNoFixedZeroSetEquivEquiv
defimported Lean
The condition on fixed point free involutions of Fin n.succ for a fixed value of f 0, can be modified by conjugation with an equivalence.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in def Physlib.Fin.involutionNoFixedZeroSetEquivEquiv {n : ℕ} (k : Fin n) (e : Fin n.succ ≃ Fin n.succ) : {f : Fin n.succ → Fin n.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ f 0 = k.succ} ≃ {f : Fin n.succ → Fin n.succ // Function.Involutive (e.symm ∘ f ∘ e) ∧ (∀ i, (e.symm ∘ f ∘ e) i ≠ i) ∧ (e.symm ∘ f ∘ e) 0 = k.succ}
- Defined in
- Physlib, `Physlib.Fin.involutionNoFixedZeroSetEquivEquiv`
- Lean proof
- By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at
e411c6e89692(Copyright (c) 2024 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.Physlib.Fin.involutionNoFixedZeroSetEquivEquiv← Physlib.Fin.involutionNoFixedZeroSetEquivEquiv (Physlib/Mathematics/ForMathlib/Fin/Involutions.lean:247): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 1
- Physlib.Fin.involutionNoFixedZeroSetEquivSetOneFixed point involutions of
Fin n.succ.succwithf 0 = k.succare equivalent to fixed point involutions withf 0 = 1.
- Physlib.Fin.involutionNoFixedZeroSetEquivSetOneFixed point involutions of
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in /-- The condition on fixed point free involutions of `Fin n.succ` for a fixed value of `f 0`, can be modified by conjugation with an equivalence. -/ def Physlib.Fin.involutionNoFixedZeroSetEquivEquiv {n : ℕ} (k : Fin n) (e : Fin n.succ ≃ Fin n.succ) : {f : Fin n.succ → Fin n.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ f 0 = k.succ} ≃ {f : Fin n.succ → Fin n.succ // Function.Involutive (e.symm ∘ f ∘ e) ∧ (∀ i, (e.symm ∘ f ∘ e) i ≠ i) ∧ (e.symm ∘ f ∘ e) 0 = k.succ} where toFun f := ⟨e ∘ f.1 ∘ e.symm, by intro i simp only [succ_eq_add_one, ne_eq, Function.comp_apply, Equiv.symm_apply_apply] rw [f.2.1], by simpa using f.2.2.1, by simpa using f.2.2.2⟩ invFun f := ⟨e.symm ∘ f.1 ∘ e, by intro i simpa using f.2.1 i, by simpa using f.2.2.1, by simpa using f.2.2.2⟩ left_inv f := by ext i; simp right_inv f := by ext i; simp