Loogle!
Result
Found 83 declarations mentioning Function.Semiconj.
- Function.Semiconj 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} (f : α → β) (ga : α → α) (gb : β → β) : Prop - Function.Semiconj.id_left 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {ga : α → α} : Function.Semiconj id ga ga - Function.Semiconj.id_right 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} : Function.Semiconj f id id - Function.Commute.semiconj 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {f g : α → α} (h : Function.Commute f g) : Function.Semiconj f g g - Function.Semiconj.commute 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {f g : α → α} (h : Function.Semiconj f g g) : Function.Commute f g - Function.Semiconj.eq 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) (x : α) : f (ga x) = gb (f x) - Function.Semiconj.comp_eq 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} : Function.Semiconj f ga gb → f ∘ ga = gb ∘ f - Function.semiconj_iff_comp_eq 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} : Function.Semiconj f ga gb ↔ f ∘ ga = gb ∘ f - Function.Semiconj.option_map 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) : Function.Semiconj (Option.map f) (Option.map ga) (Option.map gb) - Function.Semiconj.inverse_left 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} {f' : β → α} (h : Function.Semiconj f ga gb) (hf₁ : Function.LeftInverse f' f) (hf₂ : Function.RightInverse f' f) : Function.Semiconj f' gb ga - Function.Semiconj.inverses_right 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga ga' : α → α} {gb gb' : β → β} (h : Function.Semiconj f ga gb) (ha : Function.RightInverse ga' ga) (hb : Function.LeftInverse gb' gb) : Function.Semiconj f ga' gb' - Function.Semiconj.comp_left 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {fab : α → β} {fbc : β → γ} {ga : α → α} {gb : β → β} {gc : γ → γ} (hbc : Function.Semiconj fbc gb gc) (hab : Function.Semiconj fab ga gb) : Function.Semiconj (fbc ∘ fab) ga gc - Function.Semiconj.trans 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {γ : Type u_3} {fab : α → β} {fbc : β → γ} {ga : α → α} {gb : β → β} {gc : γ → γ} (hab : Function.Semiconj fab ga gb) (hbc : Function.Semiconj fbc gb gc) : Function.Semiconj (fbc ∘ fab) ga gc - Function.Semiconj.comp_right 📋 Mathlib.Logic.Function.Conjugate
{α : Type u_1} {β : Type u_2} {f : α → β} {ga ga' : α → α} {gb gb' : β → β} (h : Function.Semiconj f ga gb) (h' : Function.Semiconj f ga' gb') : Function.Semiconj f (ga ∘ ga') (gb ∘ gb') - Function.Semiconj.iterate_right 📋 Mathlib.Logic.Function.Iterate
{α : Type u} {β : Type v} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) (n : ℕ) : Function.Semiconj f ga^[n] gb^[n] - Function.Semiconj.iterate_left 📋 Mathlib.Logic.Function.Iterate
{α : Type u} {f : α → α} {g : ℕ → α → α} (H : ∀ (n : ℕ), Function.Semiconj f (g n) (g (n + 1))) (n k : ℕ) : Function.Semiconj f^[n] (g k) (g (n + k)) - Function.Semiconj.swap_map 📋 Mathlib.Data.Prod.Basic
{α : Type u_1} {β : Type u_2} (f : α → α) (g : β → β) : Function.Semiconj Prod.swap (Prod.map f g) (Prod.map g f) - Equiv.semiconj_conj 📋 Mathlib.Logic.Equiv.Basic
{α₁ : Type u_10} {β₁ : Type u_11} (e : α₁ ≃ β₁) (f : α₁ → α₁) : Function.Semiconj (⇑e) f (e.conj f) - Function.Semiconj.set_image 📋 Mathlib.Data.Set.Image
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) : Function.Semiconj (Set.image f) (Set.image ga) (Set.image gb) - Function.Semiconj.mapsTo_range 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) : Set.MapsTo fb (Set.range f) (Set.range f) - Function.Semiconj.surjOn_range 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) (ha : Function.Surjective fa) : Set.SurjOn fb (Set.range f) (Set.range f) - Function.Semiconj.bijOn_range 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) (ha : Function.Bijective fa) (hf : Function.Injective f) : Set.BijOn fb (Set.range f) (Set.range f) - Function.Semiconj.injOn_range 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) (ha : Function.Injective fa) (hf : Set.InjOn f (Set.range fa)) : Set.InjOn fb (Set.range f) - Function.Semiconj.mapsTo_image 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} {s t : Set α} (h : Function.Semiconj f fa fb) (ha : Set.MapsTo fa s t) : Set.MapsTo fb (f '' s) (f '' t) - Function.Semiconj.mapsTo_image_right 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} {s : Set α} {t : Set β} (h : Function.Semiconj f fa fb) (hst : Set.MapsTo f s t) : Set.MapsTo f (fa '' s) (fb '' t) - Function.Semiconj.mapsTo_preimage 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) {s t : Set β} (hb : Set.MapsTo fb s t) : Set.MapsTo fa (f ⁻¹' s) (f ⁻¹' t) - Function.Semiconj.surjOn_image 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} {s t : Set α} (h : Function.Semiconj f fa fb) (ha : Set.SurjOn fa s t) : Set.SurjOn fb (f '' s) (f '' t) - Function.Semiconj.injOn_image 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} {s : Set α} (h : Function.Semiconj f fa fb) (ha : Set.InjOn fa s) (hf : Set.InjOn f (fa '' s)) : Set.InjOn fb (f '' s) - Function.Semiconj.injOn_preimage 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} (h : Function.Semiconj f fa fb) {s : Set β} (hb : Set.InjOn fb s) (hf : Set.InjOn f (f ⁻¹' s)) : Set.InjOn fa (f ⁻¹' s) - Function.Semiconj.bijOn_image 📋 Mathlib.Data.Set.Function
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {f : α → β} {s t : Set α} (h : Function.Semiconj f fa fb) (ha : Set.BijOn fa s t) (hf : Set.InjOn f t) : Set.BijOn fb (f '' s) (f '' t) - AddSemiconjBy.function_semiconj_add_left 📋 Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddSemigroup G] {a b c : G} (h : AddSemiconjBy a b c) : Function.Semiconj (fun x => a + x) (fun x => b + x) fun x => c + x - AddSemiconjBy.function_semiconj_add_right_swap 📋 Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [AddSemigroup G] {a b c : G} (h : AddSemiconjBy a b c) : Function.Semiconj (fun x => x + a) (fun x => x + c) fun x => x + b - SemiconjBy.function_semiconj_mul_left 📋 Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [Semigroup G] {a b c : G} (h : SemiconjBy a b c) : Function.Semiconj (fun x => a * x) (fun x => b * x) fun x => c * x - SemiconjBy.function_semiconj_mul_right_swap 📋 Mathlib.Algebra.Group.Commute.Basic
{G : Type u_1} [Semigroup G] {a b c : G} (h : SemiconjBy a b c) : Function.Semiconj (fun x => x * a) (fun x => x * c) fun x => x * b - AddConstMapClass.semiconj 📋 Mathlib.Algebra.AddConstMap.Basic
{F : Type u_1} {G : Type u_2} {H : Type u_3} [FunLike F G H] {a : G} {b : H} [Add G] [Add H] [AddConstMapClass F G H a b] (f : F) : Function.Semiconj (⇑f) (fun x => x + a) fun x => x + b - Function.Semiconj.finset_image 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} [DecidableEq β] [DecidableEq α] {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) : Function.Semiconj (Finset.image f) (Finset.image ga) (Finset.image gb) - Function.Semiconj.finset_map 📋 Mathlib.Data.Finset.Image
{α : Type u_1} {β : Type u_2} {f : α ↪ β} {ga : α ↪ α} {gb : β ↪ β} (h : Function.Semiconj ⇑f ⇑ga ⇑gb) : Function.Semiconj (Finset.map f) (Finset.map ga) (Finset.map gb) - Function.Semiconj.filter_comap 📋 Mathlib.Order.Filter.Map
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) : Function.Semiconj (Filter.comap f) (Filter.comap gb) (Filter.comap ga) - Function.Semiconj.filter_map 📋 Mathlib.Order.Filter.Map
{α : Type u_1} {β : Type u_2} {f : α → β} {ga : α → α} {gb : β → β} (h : Function.Semiconj f ga gb) : Function.Semiconj (Filter.map f) (Filter.map ga) (Filter.map gb) - Matrix.conjTranspose_map 📋 Mathlib.LinearAlgebra.Matrix.ConjTranspose
{m : Type u_2} {n : Type u_3} {α : Type v} {β : Type w} [Star α] [Star β] {A : Matrix m n α} (f : α → β) (hf : Function.Semiconj f star star) : A.conjTranspose.map f = (A.map f).conjTranspose - Function.IsFixedPt.map 📋 Mathlib.Dynamics.FixedPoints.Basic
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {x : α} (hx : Function.IsFixedPt fa x) {g : α → β} (h : Function.Semiconj g fa fb) : Function.IsFixedPt fb (g x) - Function.Semiconj.mapsTo_fixedPoints 📋 Mathlib.Dynamics.FixedPoints.Basic
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {g : α → β} (h : Function.Semiconj g fa fb) : Set.MapsTo g (Function.fixedPoints fa) (Function.fixedPoints fb) - Function.Semiconj.mapsTo_periodicPts 📋 Mathlib.Dynamics.PeriodicPts.Defs
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {g : α → β} (h : Function.Semiconj g fa fb) : Set.MapsTo g (Function.periodicPts fa) (Function.periodicPts fb) - Function.IsPeriodicPt.map 📋 Mathlib.Dynamics.PeriodicPts.Defs
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {x : α} {n : ℕ} (hx : Function.IsPeriodicPt fa n x) {g : α → β} (hg : Function.Semiconj g fa fb) : Function.IsPeriodicPt fb n (g x) - Function.Semiconj.mapsTo_ptsOfPeriod 📋 Mathlib.Dynamics.PeriodicPts.Defs
{α : Type u_1} {β : Type u_2} {fa : α → α} {fb : β → β} {g : α → β} (h : Function.Semiconj g fa fb) (n : ℕ) : Set.MapsTo g (Function.ptsOfPeriod fa n) (Function.ptsOfPeriod fb n) - Matrix.IsHermitian.map 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {β : Type u_2} {n : Type u_4} [Star α] [Star β] {A : Matrix n n α} (h : A.IsHermitian) (f : α → β) (hf : Function.Semiconj f star star) : (A.map f).IsHermitian - Matrix.isHermitian_map_iff 📋 Mathlib.LinearAlgebra.Matrix.Hermitian
{α : Type u_1} {β : Type u_2} {n : Type u_4} [Star α] [Star β] {A : Matrix n n α} {f : α → β} (hf : Function.Semiconj f star star) (hinj : Function.Injective f) : (A.map f).IsHermitian ↔ A.IsHermitian - MeasureTheory.MeasurePreserving.of_semiconj 📋 Mathlib.Dynamics.Ergodic.MeasurePreserving
{α : Type u_1} {β : Type u_2} [MeasurableSpace α] [MeasurableSpace β] {μa : MeasureTheory.Measure α} {μb : MeasureTheory.Measure β} {f : α → β} {ga : α → α} {gb : β → β} (hfm : MeasureTheory.MeasurePreserving f μa μb) (hga : MeasureTheory.MeasurePreserving ga μa μa) (hf : Function.Semiconj f ga gb) (hgb : Measurable gb) : MeasureTheory.MeasurePreserving gb μb μb - MeasureTheory.IsAddFundamentalDomain.preimage_of_equiv 📋 Mathlib.MeasureTheory.Group.FundamentalDomain
{G : Type u_1} {H : Type u_2} {α : Type u_3} {β : Type u_4} [AddGroup G] [AddGroup H] [AddAction G α] [MeasurableSpace α] [AddAction H β] [MeasurableSpace β] {s : Set α} {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} (h : MeasureTheory.IsAddFundamentalDomain G s μ) {f : β → α} (hf : MeasureTheory.Measure.QuasiMeasurePreserving f ν μ) {e : G → H} (he : Function.Bijective e) (hef : ∀ (g : G), Function.Semiconj f (fun x => e g +ᵥ x) fun x => g +ᵥ x) : MeasureTheory.IsAddFundamentalDomain H (f ⁻¹' s) ν - MeasureTheory.IsFundamentalDomain.preimage_of_equiv 📋 Mathlib.MeasureTheory.Group.FundamentalDomain
{G : Type u_1} {H : Type u_2} {α : Type u_3} {β : Type u_4} [Group G] [Group H] [MulAction G α] [MeasurableSpace α] [MulAction H β] [MeasurableSpace β] {s : Set α} {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} (h : MeasureTheory.IsFundamentalDomain G s μ) {f : β → α} (hf : MeasureTheory.Measure.QuasiMeasurePreserving f ν μ) {e : G → H} (he : Function.Bijective e) (hef : ∀ (g : G), Function.Semiconj f (fun x => e g • x) fun x => g • x) : MeasureTheory.IsFundamentalDomain H (f ⁻¹' s) ν - MeasureTheory.IsAddFundamentalDomain.image_of_equiv 📋 Mathlib.MeasureTheory.Group.FundamentalDomain
{G : Type u_1} {H : Type u_2} {α : Type u_3} {β : Type u_4} [AddGroup G] [AddGroup H] [AddAction G α] [MeasurableSpace α] [AddAction H β] [MeasurableSpace β] {s : Set α} {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} (h : MeasureTheory.IsAddFundamentalDomain G s μ) (f : α ≃ β) (hf : MeasureTheory.Measure.QuasiMeasurePreserving (⇑f.symm) ν μ) (e : H ≃ G) (hef : ∀ (g : H), Function.Semiconj (⇑f) (fun x => e g +ᵥ x) fun x => g +ᵥ x) : MeasureTheory.IsAddFundamentalDomain H (⇑f '' s) ν - MeasureTheory.IsFundamentalDomain.image_of_equiv 📋 Mathlib.MeasureTheory.Group.FundamentalDomain
{G : Type u_1} {H : Type u_2} {α : Type u_3} {β : Type u_4} [Group G] [Group H] [MulAction G α] [MeasurableSpace α] [MulAction H β] [MeasurableSpace β] {s : Set α} {μ : MeasureTheory.Measure α} {ν : MeasureTheory.Measure β} (h : MeasureTheory.IsFundamentalDomain G s μ) (f : α ≃ β) (hf : MeasureTheory.Measure.QuasiMeasurePreserving (⇑f.symm) ν μ) (e : H ≃ G) (hef : ∀ (g : H), Function.Semiconj (⇑f) (fun x => e g • x) fun x => g • x) : MeasureTheory.IsFundamentalDomain H (⇑f '' s) ν - Function.Semiconj.symm_adjoint 📋 Mathlib.Order.SemiconjSup
{α : Type u_1} {β : Type u_2} [PartialOrder α] [Preorder β] {fa : α ≃o α} {fb : β ↪o β} {g : α → β} (h : Function.Semiconj g ⇑fa ⇑fb) {g' : β → α} (hg' : IsOrderRightAdjoint g g') : Function.Semiconj g' ⇑fb ⇑fa - Function.semiconj_of_isLUB 📋 Mathlib.Order.SemiconjSup
{α : Type u_1} {G : Type u_4} [PartialOrder α] [Group G] (f₁ f₂ : G →* α ≃o α) {h : α → α} (H : ∀ (x : α), IsLUB (Set.range fun g' => (f₁ g')⁻¹ ((f₂ g') x)) (h x)) (g : G) : Function.Semiconj h ⇑(f₂ g) ⇑(f₁ g) - Function.sSup_div_semiconj 📋 Mathlib.Order.SemiconjSup
{α : Type u_1} {G : Type u_4} [CompleteLattice α] [Group G] (f₁ f₂ : G →* α ≃o α) (g : G) : Function.Semiconj (fun x => ⨆ g', (f₁ g')⁻¹ ((f₂ g') x)) ⇑(f₂ g) ⇑(f₁ g) - Function.csSup_div_semiconj 📋 Mathlib.Order.SemiconjSup
{α : Type u_1} {G : Type u_4} [ConditionallyCompleteLattice α] [Group G] (f₁ f₂ : G →* α ≃o α) (hbdd : ∀ (x : α), BddAbove (Set.range fun g => (f₁ g)⁻¹ ((f₂ g) x))) (g : G) : Function.Semiconj (fun x => ⨆ g', (f₁ g')⁻¹ ((f₂ g') x)) ⇑(f₂ g) ⇑(f₁ g) - CircleDeg1Lift.translationNumber_eq_of_semiconj 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f g₁ g₂ : CircleDeg1Lift} (H : Function.Semiconj ⇑f ⇑g₁ ⇑g₂) : g₁.translationNumber = g₂.translationNumber - CircleDeg1Lift.semiconjBy_iff_semiconj 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f g₁ g₂ : CircleDeg1Lift} : SemiconjBy f g₁ g₂ ↔ Function.Semiconj ⇑f ⇑g₁ ⇑g₂ - CircleDeg1Lift.semiconj_of_isUnit_of_translationNumber_eq 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f₁ f₂ : CircleDeg1Lift} (h₁ : IsUnit f₁) (h₂ : IsUnit f₂) (h : f₁.translationNumber = f₂.translationNumber) : ∃ F, Function.Semiconj ⇑F ⇑f₁ ⇑f₂ - CircleDeg1Lift.units_semiconj_of_translationNumber_eq 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f₁ f₂ : CircleDeg1Liftˣ} (h : (↑f₁).translationNumber = (↑f₂).translationNumber) : ∃ F, Function.Semiconj ⇑F ⇑↑f₁ ⇑↑f₂ - CircleDeg1Lift.semiconj_of_bijective_of_translationNumber_eq 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f₁ f₂ : CircleDeg1Lift} (h₁ : Function.Bijective ⇑f₁) (h₂ : Function.Bijective ⇑f₂) (h : f₁.translationNumber = f₂.translationNumber) : ∃ F, Function.Semiconj ⇑F ⇑f₁ ⇑f₂ - CircleDeg1Lift.dist_map_zero_lt_of_semiconj 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{f g₁ g₂ : CircleDeg1Lift} (h : Function.Semiconj ⇑f ⇑g₁ ⇑g₂) : dist (g₁ 0) (g₂ 0) < 2 - CircleDeg1Lift.semiconj_of_group_action_of_forall_translationNumber_eq 📋 Mathlib.Dynamics.Circle.RotationNumber.TranslationNumber
{G : Type u_1} [Group G] (f₁ f₂ : G →* CircleDeg1Lift) (h : ∀ (g : G), (f₁ g).translationNumber = (f₂ g).translationNumber) : ∃ F, ∀ (g : G), Function.Semiconj ⇑F ⇑(f₁ g) ⇑(f₂ g) - MeasureTheory.MeasurePreserving.preErgodic_of_preErgodic_semiconj 📋 Mathlib.Dynamics.Ergodic.Ergodic
{α : Type u_1} {m : MeasurableSpace α} {f : α → α} {μ : MeasureTheory.Measure α} {β : Type u_2} {m' : MeasurableSpace β} {μ' : MeasureTheory.Measure β} {g : α → β} (hg : MeasureTheory.MeasurePreserving g μ μ') (hf : PreErgodic f μ) {f' : β → β} (h_comm : Function.Semiconj g f f') : PreErgodic f' μ' - MeasureTheory.MeasurePreserving.ergodic_of_ergodic_semiconj 📋 Mathlib.Dynamics.Ergodic.Ergodic
{α : Type u_1} {m : MeasurableSpace α} {f : α → α} {μ : MeasureTheory.Measure α} {β : Type u_2} {m' : MeasurableSpace β} {μ' : MeasureTheory.Measure β} {g : α → β} (hg : MeasureTheory.MeasurePreserving g μ μ') (hf : Ergodic f μ) {f' : β → β} (hf' : Measurable f') (h_comm : Function.Semiconj g f f') : Ergodic f' μ' - Flow.IsSemiconjugacy.semiconj 📋 Mathlib.Dynamics.Flow
{τ : Type u_1} {α : Type u_2} [TopologicalSpace τ] [TopologicalSpace α] [AddMonoid τ] {β : Type u_3} [TopologicalSpace β] {π : α → β} {ϕ : Flow τ α} {ψ : Flow τ β} (self : Flow.IsSemiconjugacy π ϕ ψ) (t : τ) : Function.Semiconj π (ϕ.toFun t) (ψ.toFun t) - Flow.IsSemiconjugacy.mk 📋 Mathlib.Dynamics.Flow
{τ : Type u_1} {α : Type u_2} [TopologicalSpace τ] [TopologicalSpace α] [AddMonoid τ] {β : Type u_3} [TopologicalSpace β] {π : α → β} {ϕ : Flow τ α} {ψ : Flow τ β} (cont : Continuous π) (surj : Function.Surjective π) (semiconj : ∀ (t : τ), Function.Semiconj π (ϕ.toFun t) (ψ.toFun t)) : Flow.IsSemiconjugacy π ϕ ψ - Function.Semiconj.preimage_dynEntourage 📋 Mathlib.Dynamics.TopologicalEntropy.DynamicalEntourage
{X : Type u_1} {Y : Type u_2} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (U : Set (Y × Y)) (n : ℕ) : Prod.map φ φ ⁻¹' Dynamics.dynEntourage T U n = Dynamics.dynEntourage S (Prod.map φ φ ⁻¹' U) n - Dynamics.coverEntropyInf_image_of_comap 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} (u : UniformSpace Y) {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) : Dynamics.coverEntropyInf T (φ '' F) = Dynamics.coverEntropyInf S F - Dynamics.coverEntropy_image_of_comap 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} (u : UniformSpace Y) {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) : Dynamics.coverEntropy T (φ '' F) = Dynamics.coverEntropy S F - Dynamics.coverEntropyInf_image_le_of_uniformContinuous 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} [UniformSpace X] [UniformSpace Y] {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (h' : UniformContinuous φ) (F : Set X) : Dynamics.coverEntropyInf T (φ '' F) ≤ Dynamics.coverEntropyInf S F - Dynamics.coverEntropy_image_le_of_uniformContinuous 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} [UniformSpace X] [UniformSpace Y] {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (h' : UniformContinuous φ) (F : Set X) : Dynamics.coverEntropy T (φ '' F) ≤ Dynamics.coverEntropy S F - Dynamics.coverMincard_image_le 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) (V : SetRel Y Y) (n : ℕ) : Dynamics.coverMincard T (φ '' F) V n ≤ Dynamics.coverMincard S F (Prod.map φ φ ⁻¹' V) n - Dynamics.coverEntropyEntourage_image_le 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) (V : SetRel Y Y) : Dynamics.coverEntropyEntourage T (φ '' F) V ≤ Dynamics.coverEntropyEntourage S F (Prod.map φ φ ⁻¹' V) - Dynamics.coverEntropyInfEntourage_image_le 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) (V : SetRel Y Y) : Dynamics.coverEntropyInfEntourage T (φ '' F) V ≤ Dynamics.coverEntropyInfEntourage S F (Prod.map φ φ ⁻¹' V) - Dynamics.IsDynCoverOf.image 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {s F : Set X} {V : SetRel Y Y} {S : X → X} {T : Y → Y} {φ : X → Y} {n : ℕ} (h : Function.Semiconj φ S T) (h' : Dynamics.IsDynCoverOf S F (Prod.map φ φ ⁻¹' V) n s) : Dynamics.IsDynCoverOf T (φ '' F) V n (φ '' s) - Dynamics.le_coverMincard_image 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {V : SetRel Y Y} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) [V.IsSymm] (n : ℕ) : Dynamics.coverMincard S F (Prod.map φ φ ⁻¹' V.comp V) n ≤ Dynamics.coverMincard T (φ '' F) V n - Dynamics.le_coverEntropyEntourage_image 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {V : SetRel Y Y} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) [V.IsSymm] : Dynamics.coverEntropyEntourage S F (Prod.map φ φ ⁻¹' V.comp V) ≤ Dynamics.coverEntropyEntourage T (φ '' F) V - Dynamics.le_coverEntropyInfEntourage_image 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {V : SetRel Y Y} {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) (F : Set X) [V.IsSymm] : Dynamics.coverEntropyInfEntourage S F (Prod.map φ φ ⁻¹' V.comp V) ≤ Dynamics.coverEntropyInfEntourage T (φ '' F) V - Dynamics.coverEntropyInf_image_le_of_uniformContinuousOn_invariant 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} [UniformSpace X] [UniformSpace Y] {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) {F G : Set X} (h' : UniformContinuousOn φ G) (hF : F ⊆ G) (hG : Set.MapsTo S G G) : Dynamics.coverEntropyInf T (φ '' F) ≤ Dynamics.coverEntropyInf S F - Dynamics.coverEntropy_image_le_of_uniformContinuousOn_invariant 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} [UniformSpace X] [UniformSpace Y] {S : X → X} {T : Y → Y} {φ : X → Y} (h : Function.Semiconj φ S T) {F G : Set X} (h' : UniformContinuousOn φ G) (hF : F ⊆ G) (hG : Set.MapsTo S G G) : Dynamics.coverEntropy T (φ '' F) ≤ Dynamics.coverEntropy S F - Dynamics.IsDynCoverOf.preimage 📋 Mathlib.Dynamics.TopologicalEntropy.Semiconj
{X : Type u_1} {Y : Type u_2} {F : Set X} {V : SetRel Y Y} {S : X → X} {T : Y → Y} {φ : X → Y} {n : ℕ} (h : Function.Semiconj φ S T) [V.IsSymm] {t : Finset Y} (h' : Dynamics.IsDynCoverOf T (φ '' F) V n ↑t) : ∃ s, Dynamics.IsDynCoverOf S F (Prod.map φ φ ⁻¹' V.comp V) n ↑s ∧ s.card ≤ t.card - MeasurableSpace.measurable_invariants_of_semiconj 📋 Mathlib.MeasureTheory.MeasurableSpace.Invariants
{α : Type u_1} [MeasurableSpace α] {β : Type u_2} [MeasurableSpace β] {fa : α → α} {fb : β → β} {g : α → β} (hg : Measurable g) (hfg : Function.Semiconj g fa fb) : Measurable g
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:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.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 ?aIf 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 ?bBy 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 findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.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