Loogle!

Result

Found 109 declarations mentioning Function.Involutive.

• Bool.involutive_not 📋 Mathlib.Logic.Function.Basic
  : Function.Involutive not
• Function.not_involutive 📋 Mathlib.Logic.Function.Basic
  : Function.Involutive Not
• Function.Involutive 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} (f : α → α) : Prop
• Function.Involutive.bijective 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : Function.Bijective f
• Function.Involutive.injective 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : Function.Injective f
• Function.Involutive.surjective 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : Function.Surjective f
• Function.Involutive.leftInverse 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : Function.LeftInverse f f
• Function.Involutive.rightInverse 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : Function.RightInverse f f
• Function.symm_apply_eq_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {f : α → α} : (Std.Symm fun x1 x2 => f x1 = x2) ↔ Function.Involutive f
• Function.symmetric_apply_eq_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {f : α → α} : (Std.Symm fun x1 x2 => f x1 = x2) ↔ Function.Involutive f
• Function.Involutive.comp_self 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) : f ∘ f = id
• Function.Involutive.eq_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) {x y : α} : f x = y ↔ x = f y
• Function.Involutive.leftInverse_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) {g : α → α} : Function.LeftInverse g f ↔ g = f
• Function.Involutive.ite_not 📋 Mathlib.Logic.Function.Basic
  {α : Sort u} {f : α → α} (h : Function.Involutive f) (P : Prop) [Decidable P] (x : α) : f (if P then x else f x) = if ¬P then x else f x
• Symmetric.forall_existsUnique_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {r : α → α → Prop} [Std.Symm r] : (∀ (a : α), ∃! b, r a b) ↔ ∃ f, Function.Involutive f ∧ ∀ {a b : α}, r a b ↔ f a = b
• Std.Symm.forall_existsUnique_iff 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {r : α → α → Prop} [Std.Symm r] : (∀ (a : α), ∃! b, r a b) ↔ ∃ f, Function.Involutive f ∧ ∀ {a b : α}, r a b ↔ f a = b
• Symmetric.forall_existsUnique_iff' 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {r : α → α → Prop} [Std.Symm r] : (∀ (a : α), ∃! b, r a b) ↔ ∃ f, Function.Involutive f ∧ r = fun x1 x2 => f x1 = x2
• Std.Symm.forall_existsUnique_iff' 📋 Mathlib.Logic.Function.Basic
  {α : Sort u_1} {r : α → α → Prop} [Std.Symm r] : (∀ (a : α), ∃! b, r a b) ↔ ∃ f, Function.Involutive f ∧ r = fun x1 x2 => f x1 = x2
• Subtype.map_involutive 📋 Mathlib.Data.Subtype
  {α : Sort u_1} {p : α → Prop} {f : α → α} (h : ∀ (a : α), p a → p (f a)) (hf : Function.Involutive f) : Function.Involutive (Subtype.map f h)
• Function.involutive_iff_iter_2_eq_id 📋 Mathlib.Logic.Function.Iterate
  {α : Sort u_1} {f : α → α} : Function.Involutive f ↔ f^[2] = id
• Function.Involutive.prodMap 📋 Mathlib.Data.Prod.Basic
  {α : Type u_1} {β : Type u_2} {f : α → α} {g : β → β} : Function.Involutive f → Function.Involutive g → Function.Involutive (Prod.map f g)
• Prod.map_involutive 📋 Mathlib.Data.Prod.Basic
  {α : Type u_1} {β : Type u_2} [Nonempty α] [Nonempty β] {f : α → α} {g : β → β} : Function.Involutive (Prod.map f g) ↔ Function.Involutive f ∧ Function.Involutive g
• compl_involutive 📋 Mathlib.Order.BooleanAlgebra.Basic
  {α : Type u} [BooleanAlgebra α] : Function.Involutive compl
• Function.Involutive.toPerm 📋 Mathlib.Logic.Equiv.Basic
  {α : Sort u_1} (f : α → α) (h : Function.Involutive f) : Equiv.Perm α
• Function.Involutive.toPerm_symm 📋 Mathlib.Logic.Equiv.Basic
  {α : Sort u_1} {f : α → α} (h : Function.Involutive f) : Equiv.symm (Function.Involutive.toPerm f h) = Function.Involutive.toPerm f h
• Function.Involutive.toPerm_involutive 📋 Mathlib.Logic.Equiv.Basic
  {α : Sort u_1} {f : α → α} (h : Function.Involutive f) : Function.Involutive ⇑(Function.Involutive.toPerm f h)
• Function.Involutive.coe_toPerm 📋 Mathlib.Logic.Equiv.Basic
  {α : Sort u_1} {f : α → α} (h : Function.Involutive f) : ⇑(Function.Involutive.toPerm f h) = f
• Function.Involutive.symm_eq_self_of_involutive 📋 Mathlib.Logic.Equiv.Basic
  {α : Sort u_1} (f : Equiv.Perm α) (h : Function.Involutive ⇑f) : Equiv.symm f = f
• symmDiff_left_involutive 📋 Mathlib.Order.SymmDiff
  {α : Type u_2} [GeneralizedBooleanAlgebra α] (a : α) : Function.Involutive fun x => symmDiff x a
• symmDiff_right_involutive 📋 Mathlib.Order.SymmDiff
  {α : Type u_2} [GeneralizedBooleanAlgebra α] (a : α) : Function.Involutive fun x => symmDiff a x
• bihimp_left_involutive 📋 Mathlib.Order.SymmDiff
  {α : Type u_2} [BooleanAlgebra α] (a : α) : Function.Involutive fun x => bihimp x a
• bihimp_right_involutive 📋 Mathlib.Order.SymmDiff
  {α : Type u_2} [BooleanAlgebra α] (a : α) : Function.Involutive fun x => bihimp a x
• Function.Involutive.preimage 📋 Mathlib.Data.Set.Image
  {α : Type u_1} {f : α → α} (hf : Function.Involutive f) : Function.Involutive (Set.preimage f)
• Function.Involutive.image_eq_preimage_symm 📋 Mathlib.Data.Set.Image
  {α : Type u_1} {f : α → α} (hf : Function.Involutive f) : Set.image f = Set.preimage f
• inv_involutive 📋 Mathlib.Algebra.Group.Basic
  {G : Type u_3} [InvolutiveInv G] : Function.Involutive Inv.inv
• neg_involutive 📋 Mathlib.Algebra.Group.Basic
  {G : Type u_3} [InvolutiveNeg G] : Function.Involutive Neg.neg
• const_div_involutive 📋 Mathlib.Algebra.Group.Basic
  {G : Type u_3} [CommGroup G] (a : G) : Function.Involutive fun x => a / x
• const_sub_involutive 📋 Mathlib.Algebra.Group.Basic
  {G : Type u_3} [AddCommGroup G] (a : G) : Function.Involutive fun x => a - x
• Equiv.divLeft_involutive 📋 Mathlib.Algebra.Group.Units.Equiv
  {G : Type u_5} [CommGroup G] (a : G) : Function.Involutive ⇑(Equiv.divLeft a)
• Equiv.subLeft_involutive 📋 Mathlib.Algebra.Group.Units.Equiv
  {G : Type u_5} [AddCommGroup G] (a : G) : Function.Involutive ⇑(Equiv.subLeft a)
• Equiv.mul_swap_involutive 📋 Mathlib.Algebra.Group.End
  {α : Type u_4} [DecidableEq α] (i j : α) : Function.Involutive fun x => x * Equiv.swap i j
• Equiv.swap_mul_involutive 📋 Mathlib.Algebra.Group.End
  {α : Type u_4} [DecidableEq α] (i j : α) : Function.Involutive fun x => Equiv.swap i j * x
• Function.Involutive.iterate_odd 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} {n : ℕ} (hf : Function.Involutive f) (hn : Odd n) : f^[n] = f
• Function.Involutive.iterate_even 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} {n : ℕ} (hf : Function.Involutive f) (hn : Even n) : f^[n] = id
• Function.Involutive.iterate_eq_self 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} {n : ℕ} (hf : Function.Involutive f) (hne : f ≠ id) : f^[n] = f ↔ Odd n
• Function.Involutive.iterate_eq_id 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} {n : ℕ} (hf : Function.Involutive f) (hne : f ≠ id) : f^[n] = id ↔ Even n
• Function.Involutive.iterate_two_mul 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} (hf : Function.Involutive f) (n : ℕ) : f^[2 * n] = id
• Function.Involutive.iterate_two_mul_add_one 📋 Mathlib.Algebra.Ring.Parity
  {α : Type u_4} {f : α → α} (hf : Function.Involutive f) (n : ℕ) : f^[2 * n + 1] = f
• List.reverse_involutive 📋 Mathlib.Data.List.Basic
  {α : Type u} : Function.Involutive List.reverse
• Function.Involutive.list_map 📋 Mathlib.Data.List.Basic
  {α : Type u} {f : α → α} (h : Function.Involutive f) : Function.Involutive (List.map f)
• List.map_involutive_iff 📋 Mathlib.Data.List.Basic
  {α : Type u} {f : α → α} : Function.Involutive (List.map f) ↔ Function.Involutive f
• List.mem_map_of_involutive 📋 Mathlib.Data.List.Basic
  {α : Type u} {f : α → α} (hf : Function.Involutive f) {a : α} {l : List α} : a ∈ List.map f l ↔ f a ∈ l
• Function.Involutive.exists_mem_and_apply_eq_iff 📋 Mathlib.Data.List.Basic
  {α : Type u} {f : α → α} (hf : Function.Involutive f) (x : α) (l : List α) : (∃ y ∈ l, f y = x) ↔ f x ∈ l
• Equiv.pointReflection_involutive 📋 Mathlib.Algebra.Torsor.Defs
  {G : Type u_3} {P : Type u_4} [AddGroup G] [AddTorsor G P] (x : P) : Function.Involutive ⇑(Equiv.pointReflection x)
• Fin.rev_involutive 📋 Mathlib.Data.Fin.Rev
  {n : ℕ} : Function.Involutive Fin.rev
• FreeAddGroup.negRev_involutive 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} : Function.Involutive FreeAddGroup.negRev
• FreeGroup.invRev_involutive 📋 Mathlib.GroupTheory.FreeGroup.Basic
  {α : Type u} : Function.Involutive FreeGroup.invRev
• LinearEquiv.ofInvolutive 📋 Mathlib.Algebra.Module.Equiv.Defs
  {R : Type u_1} {M : Type u_7} [Semiring R] [AddCommMonoid M] {σ σ' : R →+* R} [RingHomInvPair σ σ'] [RingHomInvPair σ' σ] {x✝ : Module R M} (f : M →ₛₗ[σ] M) (hf : Function.Involutive ⇑f) : M ≃ₛₗ[σ] M
• LinearEquiv.coe_ofInvolutive 📋 Mathlib.Algebra.Module.Equiv.Defs
  {R : Type u_1} {M : Type u_7} [Semiring R] [AddCommMonoid M] {σ σ' : R →+* R} [RingHomInvPair σ σ'] [RingHomInvPair σ' σ] {x✝ : Module R M} (f : M →ₛₗ[σ] M) (hf : Function.Involutive ⇑f) : ⇑(LinearEquiv.ofInvolutive f hf) = ⇑f
• Matrix.transpose_involutive 📋 Mathlib.LinearAlgebra.Matrix.Defs
  (n : Type u_3) (α : Type v) : Function.Involutive Matrix.transpose
• Matrix.map_involutive 📋 Mathlib.LinearAlgebra.Matrix.Defs
  {m : Type u_2} {n : Type u_3} {α : Type v} {f : α → α} (hf : Function.Involutive f) : Function.Involutive fun M => M.map f
• InvolutiveStar.mk 📋 Mathlib.Algebra.Star.Basic
  {R : Type u} [toStar : Star R] (star_involutive : Function.Involutive star) : InvolutiveStar R
• InvolutiveStar.star_involutive 📋 Mathlib.Algebra.Star.Basic
  {R : Type u} [self : InvolutiveStar R] : Function.Involutive star
• Matrix.conjTranspose_involutive 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
  (n : Type u_3) (α : Type v) [InvolutiveStar α] : Function.Involutive Matrix.conjTranspose
• Composition.reverse_involutive 📋 Mathlib.Combinatorics.Enumerative.Composition
  {n : ℕ} : Function.Involutive Composition.reverse
• Equiv.swap_smul_involutive 📋 Mathlib.GroupTheory.Perm.Basic
  {α : Type u} {β : Type v} [DecidableEq α] [MulAction (Equiv.Perm α) β] (i j : α) : Function.Involutive fun x => Equiv.swap i j • x
• LaurentPolynomial.involutive_invert 📋 Mathlib.Algebra.Polynomial.Laurent
  {R : Type u_3} [CommSemiring R] : Function.Involutive ⇑LaurentPolynomial.invert
• CliffordAlgebra.involute_involutive 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Conjugation
  {R : Type u_1} [CommRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {Q : QuadraticForm R M} : Function.Involutive ⇑CliffordAlgebra.involute
• CliffordAlgebra.reverse_involutive 📋 Mathlib.LinearAlgebra.CliffordAlgebra.Conjugation
  {R : Type u_1} [CommRing R] {M : Type u_2} [AddCommGroup M] [Module R M] {Q : QuadraticForm R M} : Function.Involutive ⇑CliffordAlgebra.reverse
• Equidecomp.symm_involutive 📋 Mathlib.Algebra.Group.Action.Equidecomp
  {X : Type u_1} {G : Type u_2} [Group G] [MulAction G X] : Function.Involutive Equidecomp.symm
• LinearMap.BilinForm.dualBasis_involutive 📋 Mathlib.LinearAlgebra.BilinearForm.Properties
  {V : Type u_5} {K : Type u_6} [Field K] [AddCommGroup V] [Module K V] {ι : Type u_9} [DecidableEq ι] [Finite ι] {B : LinearMap.BilinForm K V} (hB : B.Nondegenerate) (hB' : B.IsSymm) : Function.Involutive (B.dualBasis hB)
• Module.involutive_preReflection 📋 Mathlib.LinearAlgebra.Reflection
  {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {x : M} {f : Module.Dual R M} (h : f x = 2) : Function.Involutive ⇑(Module.preReflection x f)
• Module.involutive_reflection 📋 Mathlib.LinearAlgebra.Reflection
  {R : Type u_1} {M : Type u_2} [CommRing R] [AddCommGroup M] [Module R M] {x : M} {f : Module.Dual R M} (h : f x = 2) : Function.Involutive ⇑(Module.reflection h)
• RootPairing.reflectionPerm_involutive 📋 Mathlib.LinearAlgebra.RootSystem.Defs
  {ι : Type u_1} {R : Type u_2} {M : Type u_3} {N : Type u_4} [CommRing R] [AddCommGroup M] [Module R M] [AddCommGroup N] [Module R N] (P : RootPairing ι R M N) (i : ι) : Function.Involutive ⇑(P.reflectionPerm i)
• Matroid.dual_involutive 📋 Mathlib.Combinatorics.Matroid.Dual
  {α : Type u_1} : Function.Involutive Matroid.dual
• MeasurableEquiv.ofInvolutive 📋 Mathlib.MeasureTheory.MeasurableSpace.Embedding
  {α : Type u_1} [MeasurableSpace α] (f : α → α) (hf : Function.Involutive f) (hf' : Measurable f) : α ≃ᵐ α
• MeasurableEquiv.ofInvolutive_toEquiv 📋 Mathlib.MeasureTheory.MeasurableSpace.Embedding
  {α : Type u_1} [MeasurableSpace α] (f : α → α) (hf : Function.Involutive f) (hf' : Measurable f) : (MeasurableEquiv.ofInvolutive f hf hf').toEquiv = Function.Involutive.toPerm f hf
• MeasurableEquiv.ofInvolutive_symm 📋 Mathlib.MeasureTheory.MeasurableSpace.Embedding
  {α : Type u_1} [MeasurableSpace α] (f : α → α) (hf : Function.Involutive f) (hf' : Measurable f) : (MeasurableEquiv.ofInvolutive f hf hf').symm = MeasurableEquiv.ofInvolutive f hf hf'
• MeasurableEquiv.ofInvolutive_apply 📋 Mathlib.MeasureTheory.MeasurableSpace.Embedding
  {α : Type u_1} [MeasurableSpace α] (f : α → α) (hf : Function.Involutive f) (hf' : Measurable f) (a : α) : (MeasurableEquiv.ofInvolutive f hf hf') a = f a
• unitInterval.symm_involutive 📋 Mathlib.Topology.UnitInterval
  : Function.Involutive unitInterval.symm
• AffineEquiv.pointReflection_involutive 📋 Mathlib.LinearAlgebra.AffineSpace.AffineEquiv
  (k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] (x : P₁) : Function.Involutive ⇑(AffineEquiv.pointReflection k x)
• ContinuousAffineEquiv.pointReflection_involutive 📋 Mathlib.Topology.Algebra.ContinuousAffineEquiv
  (k : Type u_1) {P₁ : Type u_2} {V₁ : Type u_6} [Ring k] [AddCommGroup V₁] [Module k V₁] [AddTorsor V₁ P₁] [TopologicalSpace P₁] [TopologicalSpace V₁] [IsTopologicalAddTorsor P₁] (x : P₁) : Function.Involutive ⇑(ContinuousAffineEquiv.pointReflection k x)
• AffineIsometryEquiv.pointReflection_involutive 📋 Mathlib.Analysis.Normed.Affine.Isometry
  {𝕜 : Type u_1} {V : Type u_2} {P : Type u_10} [NormedField 𝕜] [SeminormedAddCommGroup V] [NormedSpace 𝕜 V] [PseudoMetricSpace P] [NormedAddTorsor V P] (x : P) : Function.Involutive ⇑(AffineIsometryEquiv.pointReflection 𝕜 x)
• Submodule.reflection_involutive 📋 Mathlib.Analysis.InnerProductSpace.Projection.Reflection
  {𝕜 : Type u_1} {E : Type u_2} [RCLike 𝕜] [NormedAddCommGroup E] [InnerProductSpace 𝕜 E] (K : Submodule 𝕜 E) [K.HasOrthogonalProjection] : Function.Involutive ⇑K.reflection
• conjneg_involutive 📋 Mathlib.Algebra.Star.Conjneg
  {G : Type u_2} {R : Type u_3} [AddGroup G] [CommSemiring R] [StarRing R] : Function.Involutive conjneg
• Polynomial.mirror_involutive 📋 Mathlib.Algebra.Polynomial.Mirror
  {R : Type u_1} [Semiring R] : Function.Involutive Polynomial.mirror
• Quandle.dihedralAct.inv 📋 Mathlib.Algebra.Quandle
  (n : ℕ) (a : ZMod n) : Function.Involutive (Quandle.dihedralAct n a)
• Module.Basis.traceDual_involutive 📋 Mathlib.RingTheory.Trace.Basic
  (K : Type u_3) (L : Type u_4) [Field K] [Field L] [Algebra K L] {ι : Type w} [FiniteDimensional K L] [Algebra.IsSeparable K L] [Finite ι] [DecidableEq ι] : Function.Involutive Module.Basis.traceDual
• NumberField.ComplexEmbedding.involutive_conjugate 📋 Mathlib.NumberTheory.NumberField.InfinitePlace.Embeddings
  (K : Type u_1) [Field K] : Function.Involutive NumberField.ComplexEmbedding.conjugate
• Quiver.SingleObj.hasInvolutiveReverse 📋 Mathlib.Combinatorics.Quiver.SingleObj
  {α : Type u_1} (rev : α → α) (h : Function.Involutive rev) : Quiver.HasInvolutiveReverse (Quiver.SingleObj α)
• EuclideanGeometry.inversion_involutive 📋 Mathlib.Geometry.Euclidean.Inversion.Basic
  {V : Type u_1} {P : Type u_2} [NormedAddCommGroup V] [InnerProductSpace ℝ V] [MetricSpace P] [NormedAddTorsor V P] (c : P) {R : ℝ} (hR : R ≠ 0) : Function.Involutive (EuclideanGeometry.inversion c R)
• StandardSubspace.involutive_symplComp 📋 Mathlib.Analysis.InnerProductSpace.StandardSubspace
  {H : Type u_1} [NormedAddCommGroup H] [InnerProductSpace ℂ H] [CompleteSpace H] : Function.Involutive StandardSubspace.symplComp
• ClosedSubmodule.involutive_mulI 📋 Mathlib.Analysis.InnerProductSpace.StandardSubspace
  {H : Type u_1} [NormedAddCommGroup H] [ipc : InnerProductSpace ℂ H] : Function.Involutive ClosedSubmodule.mulI
• SimpleGraph.Dart.symm_involutive 📋 Mathlib.Combinatorics.SimpleGraph.Dart
  {V : Type u_1} {G : SimpleGraph V} : Function.Involutive SimpleGraph.Dart.symm
• Language.reverse_involutive 📋 Mathlib.Computability.Language
  {α : Type u_1} : Function.Involutive Language.reverse
• ContextFreeGrammar.reverse_involutive 📋 Mathlib.Computability.ContextFreeGrammar
  {T : Type u_1} : Function.Involutive ContextFreeGrammar.reverse
• ContextFreeRule.reverse_involutive 📋 Mathlib.Computability.ContextFreeGrammar
  {T : Type u_1} {N : Type u_2} : Function.Involutive ContextFreeRule.reverse
• Fin2.rev_involutive 📋 Mathlib.Data.Fin.Fin2
  {n : ℕ} : Function.Involutive Fin2.rev
• xor_left_involutive 📋 Mathlib.Data.LawfulXor.Basic
  {α : Type u_1} [XorOp α] [Zero α] [LawfulXor α] (a : α) : Function.Involutive fun x => x ^^^ a
• xor_right_involutive 📋 Mathlib.Data.LawfulXor.Basic
  {α : Type u_1} [XorOp α] [Zero α] [LawfulXor α] (a : α) : Function.Involutive fun x => a ^^^ x
• Equiv.xor_involutive 📋 Mathlib.Data.LawfulXor.Equiv
  {α : Type u_1} [XorOp α] [Zero α] [LawfulXor α] (a : α) : Function.Involutive ⇑(Equiv.xor a)
• EuclideanGeometry.reflection_involutive 📋 Mathlib.Geometry.Euclidean.Projection
  {𝕜 : Type u_1} {V : Type u_2} {P : Type u_3} [RCLike 𝕜] [NormedAddCommGroup V] [InnerProductSpace 𝕜 V] [MetricSpace P] [NormedAddTorsor V P] (s : AffineSubspace 𝕜 P) [Nonempty ↥s] [s.direction.HasOrthogonalProjection] : Function.Involutive ⇑(EuclideanGeometry.reflection s)
• MonoidHom.FixedPointFree.commGroupOfInvolutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) : CommGroup G
• MonoidHom.FixedPointFree.odd_card_of_involutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) : Odd (Nat.card G)
• MonoidHom.FixedPointFree.odd_orderOf_of_involutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) (g : G) : Odd (orderOf g)
• MonoidHom.FixedPointFree.orderOf_ne_two_of_involutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) (g : G) : orderOf g ≠ 2
• MonoidHom.FixedPointFree.commute_all_of_involutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) (g h : G) : Commute g h
• MonoidHom.FixedPointFree.coe_eq_inv_of_involutive 📋 Mathlib.GroupTheory.FixedPointFree
  {F : Type u_1} {G : Type u_2} [Group G] [FunLike F G G] [MonoidHomClass F G G] {φ : F} [Finite G] (hφ : MonoidHom.FixedPointFree ⇑φ) (h2 : Function.Involutive ⇑φ) : ⇑φ = fun x => x⁻¹
• FractionalIdeal.dual_involutive 📋 Mathlib.RingTheory.DedekindDomain.Different
  {A : Type u_1} {K : Type u_2} {L : Type u} {B : Type u_3} [CommRing A] [Field K] [CommRing B] [Field L] [Algebra A K] [Algebra B L] [Algebra A B] [Algebra K L] [Algebra A L] [IsScalarTower A K L] [IsScalarTower A B L] [IsDomain A] [IsFractionRing A K] [FiniteDimensional K L] [Algebra.IsSeparable K L] [IsIntegralClosure B A L] [IsFractionRing B L] [IsIntegrallyClosed A] [IsDedekindDomain B] : Function.Involutive (FractionalIdeal.dual A K)

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using the Loogle command from the command palette. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. By subexpression:
   🔍 _ * (_ ^ _)
   finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.

   The pattern can also be non-linear, as in
   🔍 Real.sqrt ?a * Real.sqrt ?a

   If the pattern has parameters, they are matched in any order. Both of these will find List.map:
   🔍 (?a -> ?b) -> List ?a -> List ?b
   🔍 List ?a -> (?a -> ?b) -> List ?b

4. By main conclusion:
   🔍 |- tsum _ = _ * tsum _
   finds all lemmas where the conclusion (the subexpression to the right of all → and ∀) has the given shape.

   As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
   🔍 |- _ < _ → tsum _ < tsum _
   will find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

5. You can filter for definitions vs theorems: Using ⊢ (_ : Type _) finds all definitions which provide data while ⊢ (_ : Prop) finds all theorems (and definitions of proofs).

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.

This is Loogle revision 9f11169 serving mathlib revision ce5dd8c