Physlib.Fin.involutionNoFixedZeroSetEquivSetEquiv
defimported Lean
The condition on fixed point free involutions of Fin n.succ for a fixed value of f 0 given an equivalence e, can be modified so that only the condition on f 0 is up-to the equivalence e.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Nat in def Physlib.Fin.involutionNoFixedZeroSetEquivSetEquiv {n : ℕ} (k : Fin n) (e : Fin n.succ ≃ Fin n.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} ≃ {f : Fin n.succ → Fin n.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ (e.symm ∘ f ∘ e) 0 = k.succ}
- Defined in
- Physlib, `Physlib.Fin.involutionNoFixedZeroSetEquivSetEquiv`
- 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.involutionNoFixedZeroSetEquivSetEquiv← Physlib.Fin.involutionNoFixedZeroSetEquivSetEquiv (Physlib/Mathematics/ForMathlib/Fin/Involutions.lean:265): verbatim
- Verified
- 09 Oct 2026
- Axioms
- none listed
- Used by 2
- Physlib.Fin.involutionNoFixedZeroSetEquivEquiv'Fixed point free involutions of
Fin n.succfixing(e.symm ∘ f ∘ e) = k.succfor a giveneare equivalent to fixing… - Physlib.Fin.involutionNoFixedZeroSetEquivSetOneFixed point involutions of
Fin n.succ.succwithf 0 = k.succare equivalent to fixed point involutions withf 0 = 1.
- Physlib.Fin.involutionNoFixedZeroSetEquivEquiv'Fixed point free 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` given an equivalence `e`, can be modified so that only the condition on `f 0` is up-to the equivalence `e`. -/ def Physlib.Fin.involutionNoFixedZeroSetEquivSetEquiv {n : ℕ} (k : Fin n) (e : Fin n.succ ≃ Fin n.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} ≃ {f : Fin n.succ → Fin n.succ // Function.Involutive f ∧ (∀ i, f i ≠ i) ∧ (e.symm ∘ f ∘ e) 0 = k.succ} := by refine Equiv.subtypeEquivRight fun f ↦ ?_ have h1 : Function.Involutive (⇑e.symm ∘ f ∘ ⇑e) ↔ Function.Involutive f := by apply Iff.intro <;> intro h i · simpa using h (e.symm i) · simp [h (e i)] rw [h1] simp only [succ_eq_add_one, Function.comp_apply, ne_eq, and_congr_right_iff, and_congr_left_iff] intro h1 h2 apply Iff.intro · intro h i simpa using h (e.symm i) · intro h i have hi := h (e i) by_contra hn nth_rewrite 2 [← hn] at hi simp at hi