Physlib.Fin.involutionNoFixedZeroSetEquiv
defimported Lean
Fixed point involutions of Fin n.succ.succ for fixed f 0 = k.succ are equivalent to fixed point involutions of Fin n.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in def Physlib.Fin.involutionNoFixedZeroSetEquiv {n : ℕ} (k : Fin n.succ) : {f : Fin n.succ.succ → Fin n.succ.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ f 0 = k.succ} ≃ {f : Fin n → Fin n // Function.Involutive f ∧ (∀ i, f i ≠ i)}
- Defined in
- Physlib, `Physlib.Fin.involutionNoFixedZeroSetEquiv`
- 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.involutionNoFixedZeroSetEquiv← Physlib.Fin.involutionNoFixedZeroSetEquiv (Physlib/Mathematics/ForMathlib/Fin/Involutions.lean:411): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Built on 2
- Physlib.Fin.involutionNoFixedSetOneFixed point involutions of
Fin n.succ.succfixingf 0 = 1are equivalent to fixed point involutions ofFin n. - Physlib.Fin.involutionNoFixedZeroSetEquivSetOneFixed point involutions of
Fin n.succ.succwithf 0 = k.succare equivalent to fixed point involutions withf 0 = 1.
- Physlib.Fin.involutionNoFixedSetOneFixed point involutions of
- Used by 1
- Physlib.Fin.involutionNoFixedEquivSumSameThe type of fixed point free involutions of
Fin n.succ.succis equivalent to the sum ofFin n.succcopies of fixed point involutions…
- Physlib.Fin.involutionNoFixedEquivSumSameThe type of fixed point free involutions of
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in /-- Fixed point involutions of `Fin n.succ.succ` for fixed `f 0 = k.succ` are equivalent to fixed point involutions of `Fin n`. -/ def Physlib.Fin.involutionNoFixedZeroSetEquiv {n : ℕ} (k : Fin n.succ) : {f : Fin n.succ.succ → Fin n.succ.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ f 0 = k.succ} ≃ {f : Fin n → Fin n // Function.Involutive f ∧ (∀ i, f i ≠ i)} := (involutionNoFixedZeroSetEquivSetOne k).trans involutionNoFixedSetOne