Loogle!
Result
Found 226 declarations mentioning finprod. Of these, only the first 200 are shown.
- finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_6} {α : Sort u_7} [CommMonoid M] (f : α → M) : M - finprod_true 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} [CommMonoid M] (f : True → M) : ∏ᶠ (i : True), f i = f trivial - finprod_unique 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] [Unique α] (f : α → M) : ∏ᶠ (i : α), f i = f default - finprod_congr 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] {f g : α → M} (h : ∀ (x : α), f x = g x) : finprod f = finprod g - finprod_eq_prod_of_fintype 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] [Fintype α] (f : α → M) : ∏ᶠ (i : α), f i = ∏ i, f i - finprod_false 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} [CommMonoid M] (f : False → M) : ∏ᶠ (i : False), f i = 1 - finprod_cond_eq_left 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a : α} : ∏ᶠ (i : α) (_ : i = a), f i = f a - finprod_cond_eq_right 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a : α} : ∏ᶠ (i : α) (_ : a = i), f i = f a - finprod_comp 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {g : β → M} (e : α → β) (he₀ : Function.Bijective e) : ∏ᶠ (i : α), g (e i) = ∏ᶠ (j : β), g j - finprod_of_isEmpty 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] [IsEmpty α] (f : α → M) : ∏ᶠ (i : α), f i = 1 - finprod_eq_if 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} [CommMonoid M] {p : Prop} [Decidable p] {x : M} : ∏ᶠ (_ : p), x = if p then x else 1 - finprod_congr_Prop 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} [CommMonoid M] {p q : Prop} {f : p → M} {g : q → M} (hpq : p = q) (hfg : ∀ (h : q), f ⋯ = g h) : finprod f = finprod g - finprod_mem_dvd 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {N : Type u_6} [CommMonoid N] {f : α → N} (a : α) (hf : Function.HasFiniteMulSupport f) : f a ∣ finprod f - finprod_subtype_eq_finprod_cond 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (p : α → Prop) : ∏ᶠ (j : Subtype p), f ↑j = ∏ᶠ (i : α) (_ : p i), f i - finprod_eq_of_bijective 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → M} {g : β → M} (e : α → β) (he₀ : Function.Bijective e) (he₁ : ∀ (x : α), f x = g (e x)) : ∏ᶠ (i : α), f i = ∏ᶠ (j : β), g j - finprod_one 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] : ∏ᶠ (x : α), 1 = 1 - finprod_eq_dif 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} [CommMonoid M] {p : Prop} [Decidable p] (f : p → M) : ∏ᶠ (i : p), f i = if h : p then f h else 1 - finprod_eq_single 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] (f : α → M) (a : α) (ha : ∀ (x : α), x ≠ a → f x = 1) : ∏ᶠ (x : α), f x = f a - finite_mulSupport_of_finprod_ne_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (h : ∏ᶠ (i : α), f i ≠ 1) : Function.HasFiniteMulSupport f - hasFiniteMulSupport_of_finprod_ne_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (h : ∏ᶠ (i : α), f i ≠ 1) : Function.HasFiniteMulSupport f - finprod_comp_equiv 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (e : α ≃ β) {f : β → M} : ∏ᶠ (i : α), f (e i) = ∏ᶠ (i' : β), f i' - finprod_mem_univ 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) : ∏ᶠ (i : α) (_ : i ∈ Set.univ), f i = ∏ᶠ (i : α), f i - finprod_of_not_hasFiniteMulSupport 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (hf : ¬Function.HasFiniteMulSupport f) : ∏ᶠ (i : α), f i = 1 - finprod_of_infinite_mulSupport 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (hf : (Function.mulSupport f).Infinite) : ∏ᶠ (i : α), f i = 1 - Multiset.prod_map_eq_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_2} [DecidableEq α] [CommMonoid M] (s : Multiset α) (f : α → M) : (Multiset.map f s).prod = ∏ᶠ (a : α), f a ^ Multiset.count a s - finprod_eq_mulIndicator_apply 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (s : Set α) (f : α → M) (a : α) : ∏ᶠ (_ : a ∈ s), f a = s.mulIndicator f a - finprod_eq_one_of_forall_eq_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (h : ∀ (x : α), f x = 1) : ∏ᶠ (i : α), f i = 1 - finprod_inv_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{G : Type u_1} {α : Sort u_4} [DivisionCommMonoid G] (f : α → G) : ∏ᶠ (x : α), (f x)⁻¹ = (∏ᶠ (x : α), f x)⁻¹ - finprod_mem_singleton 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a : α} : ∏ᶠ (i : α) (_ : i ∈ {a}), f i = f a - finprod_prod_filter 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] [DecidableEq α] (f : β → α) (s : Finset β) (g : β → M) : ∏ᶠ (x : α), ∏ y ∈ s with f y = x, g y = ∏ k ∈ s, g k - finprod_eq_finsetProd_of_mulSupport_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Finset α} (h : Function.mulSupport f ⊆ ↑s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i - finprod_eq_finset_prod_of_mulSupport_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Finset α} (h : Function.mulSupport f ⊆ ↑s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i - finprod_eq_prod_of_mulSupport_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Finset α} (h : Function.mulSupport f ⊆ ↑s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i - finprod_eq_prod_of_mulSupport_subset_of_finite 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Set α} (h : Function.mulSupport f ⊆ s) (hs : s.Finite) : ∏ᶠ (i : α), f i = ∏ i ∈ hs.toFinset, f i - finprod_mem_eq_finite_toFinset_prod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Set α} (hs : s.Finite) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ hs.toFinset, f i - finprod_eq_prod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (hf : Function.HasFiniteMulSupport f) : ∏ᶠ (i : α), f i = ∏ i ∈ Set.Finite.toFinset hf, f i - finprod_mem_eq_toFinset_prod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s : Set α) [Fintype ↑s] : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ s.toFinset, f i - finprod_apply 📋 Mathlib.Algebra.BigOperators.Finprod
{N : Type u_6} [CommMonoid N] {α : Type u_7} {ι : Type u_8} {f : ι → α → N} (hf : Function.HasFiniteMulSupport f) (a : α) : (∏ᶠ (i : ι), f i) a = ∏ᶠ (i : ι), f i a - finprod_apply_ne_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (a : α) : ∏ᶠ (_ : f a ≠ 1), f a = f a - finprod_mem_finset_eq_prod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s : Finset α) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ s, f i - Nat.cast_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_3} [Finite ι] {R : Type u_7} [CommSemiring R] (f : ι → ℕ) : ↑(∏ᶠ (x : ι), f x) = ∏ᶠ (x : ι), ↑(f x) - finprod_curry 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (f : α × β → M) (hf : Function.HasFiniteMulSupport f) : ∏ᶠ (ab : α × β), f ab = ∏ᶠ (a : α) (b : β), f (a, b) - nonempty_of_finprod_mem_ne_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (h : ∏ᶠ (i : α) (_ : i ∈ s), f i ≠ 1) : s.Nonempty - finprod_mem_range 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → M} {g : β → α} (hg : Function.Injective g) : ∏ᶠ (i : α) (_ : i ∈ Set.range g), f i = ∏ᶠ (j : β), f (g j) - finprod_mem_coe_finset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s : Finset α) : ∏ᶠ (i : α) (_ : i ∈ ↑s), f i = ∏ i ∈ s, f i - finprod_mem_def 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (s : Set α) (f : α → M) : ∏ᶠ (a : α) (_ : a ∈ s), f a = ∏ᶠ (a : α), s.mulIndicator f a - finprod_mem_empty 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} : ∏ᶠ (i : α) (_ : i ∈ ∅), f i = 1 - finprod_set_coe_eq_finprod_mem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (s : Set α) : ∏ᶠ (j : ↑s), f ↑j = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_induction 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] {f : α → M} (p : M → Prop) (hp₀ : p 1) (hp₁ : ∀ (x y : M), p x → p y → p (x * y)) (hp₂ : ∀ (i : α), p (f i)) : p (∏ᶠ (i : α), f i) - finprod_mem_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (s : Set α) : ∏ᶠ (i : α) (_ : i ∈ s), 1 = 1 - one_le_finprod' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Sort u_4} {M : Type u_6} [CommMonoid M] [Preorder M] [IsOrderedMonoid M] {f : α → M} (hf : ∀ (i : α), 1 ≤ f i) : 1 ≤ ∏ᶠ (i : α), f i - Nat.cast_finprod' 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_3} {R : Type u_7} [CommSemiring R] [CharZero R] (f : ι → ℕ) : ↑(∏ᶠ (x : ι), f x) = ∏ᶠ (x : ι), ↑(f x) - single_le_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_7} [CommMonoid M] [Preorder M] [IsOrderedMonoid M] (i : α) {f : α → M} (hf : Function.HasFiniteMulSupport f) (h : ∀ (j : α), 1 ≤ f j) : f i ≤ ∏ᶠ (j : α), f j - mul_finprod_cond_ne 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (a : α) (hf : Function.HasFiniteMulSupport f) : f a * ∏ᶠ (i : α) (_ : i ≠ a), f i = ∏ᶠ (i : α), f i - finprod_eq_zero 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M₀ : Type u_7} [CommMonoidWithZero M₀] (f : α → M₀) (x : α) (hx : f x = 0) (hf : Function.HasFiniteMulSupport f) : ∏ᶠ (x : α), f x = 0 - finprod_mem_mulSupport 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) : ∏ᶠ (a : α) (_ : a ∈ Function.mulSupport f), f a = ∏ᶠ (a : α), f a - finprod_option 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : Option α → M} (hf : Function.HasFiniteMulSupport (f ∘ some)) : ∏ᶠ (o : Option α), f o = f none * ∏ᶠ (a : α), f (some a) - finprod_eq_prod_of_mulSupport_toFinset_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (hf : Function.HasFiniteMulSupport f) {s : Finset α} (h : Set.Finite.toFinset hf ⊆ s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i - finprod_pow 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} (hf : Function.HasFiniteMulSupport f) (n : ℕ) : (∏ᶠ (i : α), f i) ^ n = ∏ᶠ (i : α), f i ^ n - prod_finprod_comm 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (s : Finset α) (f : α → β → M) (h : ∀ a ∈ s, Function.HasFiniteMulSupport (f a)) : ∏ a ∈ s, ∏ᶠ (b : β), f a b = ∏ᶠ (b : β), ∏ a ∈ s, f a b - finprod_cond_eq_prod_of_cond_iff 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {p : α → Prop} {t : Finset α} (h : ∀ {x : α}, f x ≠ 1 → (p x ↔ x ∈ t)) : ∏ᶠ (i : α) (_ : p i), f i = ∏ i ∈ t, f i - finprod_eq_prod_plift_of_mulSupport_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] {f : α → M} {s : Finset (PLift α)} (hs : Function.mulSupport (f ∘ PLift.down) ⊆ ↑s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i.down - finprod_cond_ne 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (a : α) [DecidableEq α] (hf : Function.HasFiniteMulSupport f) : ∏ᶠ (i : α) (_ : i ≠ a), f i = ∏ i ∈ (Set.Finite.toFinset hf).erase a, f i - finprod_prod_comm 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (s : Finset β) (f : α → β → M) (h : ∀ b ∈ s, Function.HasFiniteMulSupport fun a => f a b) : ∏ᶠ (a : α), ∏ b ∈ s, f a b = ∏ b ∈ s, ∏ᶠ (a : α), f a b - finprod_mem_eq_one_of_infinite 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (hs : (s ∩ Function.mulSupport f).Infinite) : ∏ᶠ (i : α) (_ : i ∈ s), f i = 1 - finprod_ne_zero 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M₀ : Type u_7} [CommMonoidWithZero M₀] [Nontrivial M₀] [NoZeroDivisors M₀] {f : α → M₀} (h : ∀ (i : α), f i ≠ 0) : ∏ᶠ (i : α), f i ≠ 0 - finprod_curry₃ 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {γ : Type u_7} (f : α × β × γ → M) (h : Function.HasFiniteMulSupport f) : ∏ᶠ (abc : α × β × γ), f abc = ∏ᶠ (a : α) (b : β) (c : γ), f (a, b, c) - finprod_mem_range' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → M} {g : β → α} (hg : Set.InjOn g (Function.mulSupport (f ∘ g))) : ∏ᶠ (i : α) (_ : i ∈ Set.range g), f i = ∏ᶠ (j : β), f (g j) - finprod_mem_of_eqOn_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (hf : Set.EqOn f 1 s) : ∏ᶠ (i : α) (_ : i ∈ s), f i = 1 - MulEquivClass.map_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} {α : Sort u_4} [CommMonoid M] [CommMonoid N] {F : Type u_6} [EquivLike F M N] [MulEquivClass F M N] (g : F) (f : α → M) : g (∏ᶠ (i : α), f i) = ∏ᶠ (i : α), g (f i) - finprod_cond_nonneg 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {R : Type u_7} [CommSemiring R] [PartialOrder R] [IsOrderedRing R] {p : α → Prop} {f : α → R} (hf : ∀ (x : α), p x → 0 ≤ f x) : 0 ≤ ∏ᶠ (x : α) (_ : p x), f x - finprod_mem_eq_one_of_forall_eq_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (h : ∀ x ∈ s, f x = 1) : ∏ᶠ (i : α) (_ : i ∈ s), f i = 1 - map_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} {N : Type u_6} [CommMonoid M] [CommMonoid N] {f : α → M} {G : Type u_7} [FunLike G M N] [MonoidHomClass G M N] (g : G) (hf : Function.HasFiniteMulSupport f) : g (∏ᶠ (i : α), f i) = ∏ᶠ (i : α), g (f i) - finprod_mem_image 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set β} {g : β → α} (hg : Set.InjOn g s) : ∏ᶠ (i : α) (_ : i ∈ g '' s), f i = ∏ᶠ (j : β) (_ : j ∈ s), f (g j) - exists_ne_one_of_finprod_mem_ne_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (h : ∏ᶠ (i : α) (_ : i ∈ s), f i ≠ 1) : ∃ x ∈ s, f x ≠ 1 - finprod_apply_ne_zero 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_7} {N₀ : Type u_8} {M₀ : Type u_9} [CommMonoidWithZero M₀] [Nontrivial M₀] [NoZeroDivisors M₀] {n : N₀} {f : ι → N₀ → M₀} (h : ∀ (i : ι), f i n ≠ 0) : (∏ᶠ (i : ι), f i) n ≠ 0 - finprod_mem_pair 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a b : α} (h : a ≠ b) : ∏ᶠ (i : α) (_ : i ∈ {a, b}), f i = f a * f b - finprod_mem_congr 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f g : α → M} {s t : Set α} (h₀ : s = t) (h₁ : ∀ x ∈ t, f x = g x) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), g i - finprod_mem_eq_prod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Set α} (hf : (s ∩ Function.mulSupport f).Finite) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ hf.toFinset, f i - finprod_le_finprod' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f g : α → M} [PartialOrder M] [MulLeftMono M] (hf : Function.HasFiniteMulSupport f) (hg : Function.HasFiniteMulSupport g) (h : f ≤ g) : ∏ᶠ (a : α), f a ≤ ∏ᶠ (a : α), g a - finprod_mem_induction 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (p : M → Prop) (hp₀ : p 1) (hp₁ : ∀ (x y : M), p x → p y → p (x * y)) (hp₂ : ∀ x ∈ s, p (f x)) : p (∏ᶠ (i : α) (_ : i ∈ s), f i) - finprod_mul_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f g : α → M} (hf : Function.HasFiniteMulSupport f) (hg : Function.HasFiniteMulSupport g) : ∏ᶠ (i : α), f i * g i = (∏ᶠ (i : α), f i) * ∏ᶠ (i : α), g i - finprod_mem_eq_prod_of_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Set α} {t : Finset α} (h₁ : s ∩ Function.mulSupport f ⊆ ↑t) (h₂ : ↑t ⊆ s) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ t, f i - finprod_div_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {G : Type u_4} [DivisionCommMonoid G] {f g : α → G} (hf : Function.HasFiniteMulSupport f) (hg : Function.HasFiniteMulSupport g) : ∏ᶠ (i : α), f i / g i = (∏ᶠ (i : α), f i) / ∏ᶠ (i : α), g i - finprod_mem_eq_of_bijOn 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {s : Set α} {t : Set β} {f : α → M} {g : β → M} (e : α → β) (he₀ : Set.BijOn e s t) (he₁ : ∀ x ∈ s, f x = g (e x)) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ᶠ (j : β) (_ : j ∈ t), g j - finprod_eq_prod_plift_of_mulSupport_toFinset_subset 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {α : Sort u_4} [CommMonoid M] {f : α → M} (hf : Function.HasFiniteMulSupport (f ∘ PLift.down)) {s : Finset (PLift α)} (hs : Set.Finite.toFinset hf ⊆ s) : ∏ᶠ (i : α), f i = ∏ i ∈ s, f i.down - finprod_mem_eq_prod_of_inter_mulSupport_eq 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) {s : Set α} {t : Finset α} (h : s ∩ Function.mulSupport f = ↑t ∩ Function.mulSupport f) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ t, f i - finprod_mem_eq_prod_filter 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s : Set α) [DecidablePred fun x => x ∈ s] (hf : Function.HasFiniteMulSupport f) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ i ∈ Set.Finite.toFinset hf with i ∈ s, f i - finprod_mem_insert_one 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a : α} {s : Set α} (h : f a = 1) : ∏ᶠ (i : α) (_ : i ∈ insert a s), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_mem_inv_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {G : Type u_4} {s : Set α} [DivisionCommMonoid G] (f : α → G) (hs : s.Finite) : ∏ᶠ (x : α) (_ : x ∈ s), (f x)⁻¹ = (∏ᶠ (x : α) (_ : x ∈ s), f x)⁻¹ - Nat.cast_finprod_mem 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_3} {s : Set ι} (hs : s.Finite) {R : Type u_7} [CommSemiring R] (f : ι → ℕ) : ↑(∏ᶠ (x : ι) (_ : x ∈ s), f x) = ∏ᶠ (x : ι) (_ : x ∈ s), ↑(f x) - finprod_mem_inter_mulSupport 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s : Set α) : ∏ᶠ (i : α) (_ : i ∈ s ∩ Function.mulSupport f), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_zero_le_one 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_7} {α : Type u_8} [CommMonoidWithZero M] [PartialOrder M] [ZeroLEOneClass M] [PosMulMono M] : ∏ᶠ (x : α), 0 ≤ 1 - finprod_mem_image' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set β} {g : β → α} (hg : Set.InjOn g (s ∩ Function.mulSupport (f ∘ g))) : ∏ᶠ (i : α) (_ : i ∈ g '' s), f i = ∏ᶠ (j : β) (_ : j ∈ s), f (g j) - finprod_mem_inter_mulSupport_eq' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s t : Set α) (h : ∀ x ∈ Function.mulSupport f, x ∈ s ↔ x ∈ t) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_emb_domain' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {f : α → β} (hf : Function.Injective f) [DecidablePred fun x => x ∈ Set.range f] (g : α → M) : (∏ᶠ (b : β), if h : b ∈ Set.range f then g (Classical.choose h) else 1) = ∏ᶠ (a : α), g a - finprod_mem_insert_of_eq_one_if_notMem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {a : α} {s : Set α} (h : a ∉ s → f a = 1) : ∏ᶠ (i : α) (_ : i ∈ insert a s), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_nonneg 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Sort u_4} {R : Type u_6} [CommMonoidWithZero R] [Preorder R] [ZeroLEOneClass R] [PosMulMono R] {f : α → R} (hf : ∀ (x : α), 0 ≤ f x) : 0 ≤ ∏ᶠ (x : α), f x - finprod_mem_inter_mulSupport_eq 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) (s t : Set α) (h : s ∩ Function.mulSupport f = t ∩ Function.mulSupport f) : ∏ᶠ (i : α) (_ : i ∈ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - one_lt_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_3} {M : Type u_7} [CommMonoid M] [PartialOrder M] [IsOrderedCancelMonoid M] {f : ι → M} (h : ∀ (i : ι), 1 ≤ f i) (h' : ∃ i, 1 < f i) (hf : Function.HasFiniteMulSupport f) : 1 < ∏ᶠ (i : ι), f i - finprod_mem_insert 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {a : α} {s : Set α} (f : α → M) (h : a ∉ s) (hs : s.Finite) : ∏ᶠ (i : α) (_ : i ∈ insert a s), f i = f a * ∏ᶠ (i : α) (_ : i ∈ s), f i - one_le_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Sort u_4} {M : Type u_6} [CommMonoidWithZero M] [Preorder M] [ZeroLEOneClass M] [PosMulMono M] {f : α → M} (hf : ∀ (i : α), 1 ≤ f i) : 1 ≤ ∏ᶠ (i : α), f i - finprod_def 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] (f : α → M) [Decidable (Function.HasFiniteMulSupport f)] : ∏ᶠ (i : α), f i = if h : Function.HasFiniteMulSupport f then ∏ i ∈ Set.Finite.toFinset h, f i else 1 - MonoidHom.map_finprod_Prop 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} [CommMonoid M] [CommMonoid N] {p : Prop} (f : M →* N) (g : p → M) : f (∏ᶠ (x : p), g x) = ∏ᶠ (x : p), f (g x) - finprod_mem_comm 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {s : Set α} {t : Set β} (f : α → β → M) (hs : s.Finite) (ht : t.Finite) : ∏ᶠ (i : α) (_ : i ∈ s) (j : β) (_ : j ∈ t), f i j = ∏ᶠ (j : β) (_ : j ∈ t) (i : α) (_ : i ∈ s), f i j - finprod_mem_insert' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {a : α} {s : Set α} (f : α → M) (h : a ∉ s) (hs : (s ∩ Function.mulSupport f).Finite) : ∏ᶠ (i : α) (_ : i ∈ insert a s), f i = f a * ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_mem_mul_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f g : α → M} {s : Set α} (hs : s.Finite) : ∏ᶠ (i : α) (_ : i ∈ s), f i * g i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ s), g i - finprod_dmem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {s : Set α} [DecidablePred fun x => x ∈ s] (f : (a : α) → a ∈ s → M) : ∏ᶠ (a : α) (h : a ∈ s), f a h = ∏ᶠ (a : α) (_ : a ∈ s), if h' : a ∈ s then f a h' else 1 - finprod_mem_mul_diff 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : s ⊆ t) (ht : t.Finite) : (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t \ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_mem_mul_sdiff 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : s ⊆ t) (ht : t.Finite) : (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t \ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_mem_iUnion 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {ι : Type u_3} {M : Type u_5} [CommMonoid M] {f : α → M} [Finite ι] {t : ι → Set α} (h : Pairwise (Function.onFun Disjoint t)) (ht : ∀ (i : ι), (t i).Finite) : ∏ᶠ (a : α) (_ : a ∈ ⋃ i, t i), f a = ∏ᶠ (i : ι) (a : α) (_ : a ∈ t i), f a - one_lt_finprod_cond 📋 Mathlib.Algebra.BigOperators.Finprod
{ι : Type u_3} {M : Type u_7} [CommMonoid M] [PartialOrder M] [IsOrderedCancelMonoid M] {f : ι → M} {p : ι → Prop} (h : ∀ (i : ι), p i → 1 ≤ f i) (h' : ∃ i, p i ∧ 1 < f i) (hf : (Function.mulSupport f ∩ {i | p i}).Finite) : 1 < ∏ᶠ (i : ι) (_ : p i), f i - finprod_mem_inter_mul_diff 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (t : Set α) (h : s.Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s \ t), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_mem_inter_mul_sdiff 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (t : Set α) (h : s.Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s \ t), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_mem_div_distrib 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {G : Type u_4} {s : Set α} [DivisionCommMonoid G] (f g : α → G) (hs : s.Finite) : ∏ᶠ (i : α) (_ : i ∈ s), f i / g i = (∏ᶠ (i : α) (_ : i ∈ s), f i) / ∏ᶠ (i : α) (_ : i ∈ s), g i - MonoidHom.map_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} {N : Type u_6} [CommMonoid M] [CommMonoid N] {f : α → M} (g : M →* N) (hf : Function.HasFiniteMulSupport f) : g (∏ᶠ (i : α), f i) = ∏ᶠ (i : α), g (f i) - MonoidHom.map_finprod_plift 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} {α : Sort u_4} [CommMonoid M] [CommMonoid N] (f : M →* N) (g : α → M) (h : Function.HasFiniteMulSupport (g ∘ PLift.down)) : f (∏ᶠ (x : α), g x) = ∏ᶠ (x : α), f (g x) - finprod_mem_finset_product 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (s : Finset (α × β)) (f : α × β → M) : ∏ᶠ (ab : α × β) (_ : ab ∈ s), f ab = ∏ᶠ (a : α) (b : β) (_ : (a, b) ∈ s), f (a, b) - finprod_mem_mul_diff' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : s ⊆ t) (ht : (t ∩ Function.mulSupport f).Finite) : (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t \ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_mem_mul_sdiff' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : s ⊆ t) (ht : (t ∩ Function.mulSupport f).Finite) : (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t \ s), f i = ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_emb_domain 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] (f : α ↪ β) [DecidablePred fun x => x ∈ Set.range ⇑f] (g : α → M) : (∏ᶠ (b : β), if h : b ∈ Set.range ⇑f then g (Classical.choose h) else 1) = ∏ᶠ (a : α), g a - finprod_mem_inter_mul_diff' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (t : Set α) (h : (s ∩ Function.mulSupport f).Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s \ t), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_mem_inter_mul_sdiff' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s : Set α} (t : Set α) (h : (s ∩ Function.mulSupport f).Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s \ t), f i = ∏ᶠ (i : α) (_ : i ∈ s), f i - finprod_def' 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_6} {α : Sort u_7} [CommMonoid M] (f : α → M) : finprod f = if h : Function.HasFiniteMulSupport (f ∘ PLift.down) then ∏ i ∈ Set.Finite.toFinset h, f i.down else 1 - finprod_le_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_7} [CommMonoidWithZero M] [PartialOrder M] [ZeroLEOneClass M] [PosMulMono M] {f g : α → M} (hf : Function.HasFiniteMulSupport f) (hf₀ : ∀ (a : α), 0 ≤ f a) (hg : Function.HasFiniteMulSupport g) (h : f ≤ g) : ∏ᶠ (a : α), f a ≤ ∏ᶠ (a : α), g a - finprod_mem_sUnion 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {t : Set (Set α)} (h : t.PairwiseDisjoint id) (ht₀ : t.Finite) (ht₁ : ∀ x ∈ t, x.Finite) : ∏ᶠ (a : α) (_ : a ∈ ⋃₀ t), f a = ∏ᶠ (s : Set α) (_ : s ∈ t) (a : α) (_ : a ∈ s), f a - finprod_mem_union 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : Disjoint s t) (hs : s.Finite) (ht : t.Finite) : ∏ᶠ (i : α) (_ : i ∈ s ∪ t), f i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t), f i - MonoidHom.map_finprod_of_injective 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} {α : Sort u_4} [CommMonoid M] [CommMonoid N] (g : M →* N) (hg : Function.Injective ⇑g) (f : α → M) : g (∏ᶠ (i : α), f i) = ∏ᶠ (i : α), g (f i) - MonoidHom.map_finprod_mem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} {N : Type u_6} [CommMonoid M] [CommMonoid N] {s : Set α} (f : α → M) (g : M →* N) (hs : s.Finite) : g (∏ᶠ (j : α) (_ : j ∈ s), f j) = ∏ᶠ (i : α) (_ : i ∈ s), g (f i) - finprod_mem_mul_distrib' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f g : α → M} {s : Set α} (hf : (s ∩ Function.mulSupport f).Finite) (hg : (s ∩ Function.mulSupport g).Finite) : ∏ᶠ (i : α) (_ : i ∈ s), f i * g i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ s), g i - finprod_mem_powerset_insert 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : Set α → M} {s : Set α} {a : α} (hs : s.Finite) (has : a ∉ s) : ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 insert a s), f t = (∏ᶠ (t : Set α) (_ : t ∈ 𝒫 s), f t) * ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 s), f (insert a t) - finprod_mem_union_inter 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hs : s.Finite) (ht : t.Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∪ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t), f i - MonoidHom.map_finprod_mem' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} {N : Type u_6} [CommMonoid M] [CommMonoid N] {s : Set α} {f : α → M} (g : M →* N) (h₀ : (s ∩ Function.mulSupport f).Finite) : g (∏ᶠ (j : α) (_ : j ∈ s), f j) = ∏ᶠ (i : α) (_ : i ∈ s), g (f i) - finprod_mem_finset_product' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] [DecidableEq α] [DecidableEq β] (s : Finset (α × β)) (f : α × β → M) : ∏ᶠ (ab : α × β) (_ : ab ∈ s), f ab = ∏ᶠ (a : α) (b : β) (_ : b ∈ Finset.image Prod.snd ({ab ∈ s | ab.1 = a})), f (a, b) - MulEquiv.map_finprod 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} {α : Sort u_4} [CommMonoid M] [CommMonoid N] (g : M ≃* N) (f : α → M) : g (∏ᶠ (i : α), f i) = ∏ᶠ (i : α), g (f i) - finprod_mem_biUnion 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {ι : Type u_3} {M : Type u_5} [CommMonoid M] {f : α → M} {I : Set ι} {t : ι → Set α} (h : I.PairwiseDisjoint t) (hI : I.Finite) (ht : ∀ i ∈ I, (t i).Finite) : ∏ᶠ (a : α) (_ : a ∈ ⋃ x ∈ I, t x), f a = ∏ᶠ (i : ι) (_ : i ∈ I) (j : α) (_ : j ∈ t i), f j - MonoidHom.map_finprod_of_preimage_one 📋 Mathlib.Algebra.BigOperators.Finprod
{M : Type u_2} {N : Type u_3} {α : Sort u_4} [CommMonoid M] [CommMonoid N] (f : M →* N) (hf : ∀ (x : M), f x = 1 → x = 1) (g : α → M) : f (∏ᶠ (i : α), g i) = ∏ᶠ (i : α), f (g i) - finprod_mem_union' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : Disjoint s t) (hs : (s ∩ Function.mulSupport f).Finite) (ht : (t ∩ Function.mulSupport f).Finite) : ∏ᶠ (i : α) (_ : i ∈ s ∪ t), f i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_mem_powerset_diff_elem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : Set α → M} {s : Set α} {a : α} (hs : s.Finite) (has : a ∈ s) : ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 s), f t = (∏ᶠ (t : Set α) (_ : t ∈ 𝒫 (s \ {a})), f t) * ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 (s \ {a})), f (insert a t) - finprod_mem_powerset_sdiff_elem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : Set α → M} {s : Set α} {a : α} (hs : s.Finite) (has : a ∈ s) : ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 s), f t = (∏ᶠ (t : Set α) (_ : t ∈ 𝒫 (s \ {a})), f t) * ∏ᶠ (t : Set α) (_ : t ∈ 𝒫 (s \ {a})), f (insert a t) - finprod_mem_union_inter' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hs : (s ∩ Function.mulSupport f).Finite) (ht : (t ∩ Function.mulSupport f).Finite) : (∏ᶠ (i : α) (_ : i ∈ s ∪ t), f i) * ∏ᶠ (i : α) (_ : i ∈ s ∩ t), f i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t), f i - finprod_mem_finset_product₃ 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {β : Type u_2} {M : Type u_5} [CommMonoid M] {γ : Type u_7} (s : Finset (α × β × γ)) (f : α × β × γ → M) : ∏ᶠ (abc : α × β × γ) (_ : abc ∈ s), f abc = ∏ᶠ (a : α) (b : β) (c : γ) (_ : (a, b, c) ∈ s), f (a, b, c) - finprod_mem_union'' 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} [CommMonoid M] {f : α → M} {s t : Set α} (hst : Disjoint (s ∩ Function.mulSupport f) (t ∩ Function.mulSupport f)) (hs : (s ∩ Function.mulSupport f).Finite) (ht : (t ∩ Function.mulSupport f).Finite) : ∏ᶠ (i : α) (_ : i ∈ s ∪ t), f i = (∏ᶠ (i : α) (_ : i ∈ s), f i) * ∏ᶠ (i : α) (_ : i ∈ t), f i - MulEquiv.map_finprod_mem 📋 Mathlib.Algebra.BigOperators.Finprod
{α : Type u_1} {M : Type u_5} {N : Type u_6} [CommMonoid M] [CommMonoid N] (g : M ≃* N) (f : α → M) {s : Set α} (hs : s.Finite) : g (∏ᶠ (i : α) (_ : i ∈ s), f i) = ∏ᶠ (i : α) (_ : i ∈ s), g (f i) - smul_finprod' 📋 Mathlib.Algebra.BigOperators.GroupWithZero.Action
{M : Type u_1} {N : Type u_2} [Monoid M] [CommMonoid N] [MulDistribMulAction M N] {ι : Sort u_4} [Finite ι] {f : ι → N} (r : M) : r • ∏ᶠ (x : ι), f x = ∏ᶠ (x : ι), r • f x - smul_finprod_perm 📋 Mathlib.Algebra.BigOperators.GroupWithZero.Action
{N : Type u_2} [CommMonoid N] {G : Type u_4} [Group G] [MulDistribMulAction G N] [Finite G] (b : N) (g : G) : g • ∏ᶠ (h : G), h • b = ∏ᶠ (h : G), h • b - Polynomial.monic_finprod_of_monic 📋 Mathlib.Algebra.Polynomial.Monic
{R : Type u} [CommSemiring R] (α : Type u_1) (f : α → Polynomial R) (hf : ∀ i ∈ Function.mulSupport f, (f i).Monic) : (finprod f).Monic - Polynomial.monic_finprod_X_sub_C 📋 Mathlib.Algebra.Polynomial.Roots
{R : Type u} [CommRing R] {α : Type u_1} (b : α → R) : (∏ᶠ (k : α), (Polynomial.X - Polynomial.C (b k))).Monic - UniqueFactorizationMonoid.associated_finprod_pow_count 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] {x : R} (hx : x ≠ 0) : Associated (∏ᶠ (p : R), p ^ Multiset.count p (UniqueFactorizationMonoid.normalizedFactors x)) x - UniqueFactorizationMonoid.finprod_pow_count_eq_of_subsingleton_units 📋 Mathlib.RingTheory.UniqueFactorizationDomain.Multiplicity
{R : Type u_2} [CommMonoidWithZero R] [UniqueFactorizationMonoid R] [NormalizationMonoid R] [DecidableEq R] [Subsingleton Rˣ] {x : R} (hx : x ≠ 0) : ∏ᶠ (p : R), p ^ Multiset.count p (UniqueFactorizationMonoid.normalizedFactors x) = x - finprod_eventually_eq_prod 📋 Mathlib.Topology.Algebra.Monoid
{ι : Type u_1} {X : Type u_5} [TopologicalSpace X] {M : Type u_6} [CommMonoid M] {f : ι → X → M} (hf : LocallyFinite fun i => Function.mulSupport (f i)) (x : X) : ∃ s, ∀ᶠ (y : X) in nhds x, ∏ᶠ (i : ι), f i y = ∏ i ∈ s, f i y - continuous_finprod 📋 Mathlib.Topology.Algebra.Monoid
{ι : Type u_1} {M : Type u_3} {X : Type u_5} [TopologicalSpace X] [TopologicalSpace M] [CommMonoid M] [ContinuousMul M] {f : ι → X → M} (hc : ∀ (i : ι), Continuous (f i)) (hf : LocallyFinite fun i => Function.mulSupport (f i)) : Continuous fun x => ∏ᶠ (i : ι), f i x - continuous_finprod_cond 📋 Mathlib.Topology.Algebra.Monoid
{ι : Type u_1} {M : Type u_3} {X : Type u_5} [TopologicalSpace X] [TopologicalSpace M] [CommMonoid M] [ContinuousMul M] {f : ι → X → M} {p : ι → Prop} (hc : ∀ (i : ι), p i → Continuous (f i)) (hf : LocallyFinite fun i => Function.mulSupport (f i)) : Continuous fun x => ∏ᶠ (i : ι) (_ : p i), f i x - FractionalIdeal.coeIdeal_finprod 📋 Mathlib.RingTheory.FractionalIdeal.Basic
{R : Type u_1} [CommRing R] (S : Submonoid R) (P : Type u_2) [CommRing P] [Algebra R P] [IsLocalization S P] {α : Sort u_3} {f : α → Ideal R} (hS : S ≤ nonZeroDivisors R) : ↑(∏ᶠ (a : α), f a) = ∏ᶠ (a : α), ↑(f a) - Ideal.finprod_heightOneSpectrum_factorization 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] {I : Ideal R} (hI : I ≠ 0) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), v.maxPowDividing I = I - Ideal.finprod_heightOneSpectrum_pow_multiplicity 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_3} [CommRing R] [IsDedekindDomain R] {I : Ideal R} (hI : I ≠ ⊥) : ∏ᶠ (p : IsDedekindDomain.HeightOneSpectrum R), p.asIdeal ^ multiplicity p.asIdeal I = I - Associates.finprod_ne_zero 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] (I : Ideal R) : Associates.mk (∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), v.maxPowDividing I) ≠ 0 - FractionalIdeal.count_finprod 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) (exps : IsDedekindDomain.HeightOneSpectrum R → ℤ) (h_exps : ∀ᶠ (v : IsDedekindDomain.HeightOneSpectrum R) in Filter.cofinite, exps v = 0) : FractionalIdeal.count K v (∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ exps v) = exps v - FractionalIdeal.count_finprod_coprime 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) (exps : IsDedekindDomain.HeightOneSpectrum R → ℤ) : FractionalIdeal.count K v (∏ᶠ (w : IsDedekindDomain.HeightOneSpectrum R) (_ : w ≠ v), ↑w.asIdeal ^ exps w) = 0 - FractionalIdeal.finprod_heightOneSpectrum_factorization' 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] {I : FractionalIdeal (nonZeroDivisors R) K} (hI : I ≠ 0) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ FractionalIdeal.count K v I = I - Ideal.finprod_not_dvd 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) (I : Ideal R) (hI : I ≠ 0) : ¬v.asIdeal ^ ((Associates.mk v.asIdeal).count (Associates.mk I).factors + 1) ∣ ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), v.maxPowDividing I - Ideal.finprod_count 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] [IsDedekindDomain R] (v : IsDedekindDomain.HeightOneSpectrum R) (I : Ideal R) (hI : I ≠ 0) : (Associates.mk v.asIdeal).count (Associates.mk (∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), v.maxPowDividing I)).factors = (Associates.mk v.asIdeal).count (Associates.mk I).factors - Ideal.finprod_heightOneSpectrum_factorization_coe 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] (K : Type u_2) [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] {I : Ideal R} (hI : I ≠ 0) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ ↑((Associates.mk v.asIdeal).count (Associates.mk I).factors) = ↑I - FractionalIdeal.finprod_heightOneSpectrum_factorization_principal_fraction 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] {n : R} (hn : n ≠ 0) (d : ↥(nonZeroDivisors R)) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ (↑((Associates.mk v.asIdeal).count (Associates.mk (Ideal.span {n})).factors) - ↑((Associates.mk v.asIdeal).count (Associates.mk (Ideal.span {↑d})).factors)) = FractionalIdeal.spanSingleton (nonZeroDivisors R) (IsLocalization.mk' K n d) - FractionalIdeal.finprod_heightOneSpectrum_factorization 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] {I : FractionalIdeal (nonZeroDivisors R) K} (hI : I ≠ 0) {a : R} {J : Ideal R} (haJ : I = FractionalIdeal.spanSingleton (nonZeroDivisors R) ((algebraMap R K) a)⁻¹ * ↑J) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ (↑((Associates.mk v.asIdeal).count (Associates.mk J).factors) - ↑((Associates.mk v.asIdeal).count (Associates.mk (Ideal.span {a})).factors)) = I - FractionalIdeal.finprod_heightOneSpectrum_factorization_principal 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_1} [CommRing R] {K : Type u_2} [Field K] [Algebra R K] [IsFractionRing R K] [IsDedekindDomain R] {I : FractionalIdeal (nonZeroDivisors R) K} (hI : I ≠ 0) (k : K) (hk : I = FractionalIdeal.spanSingleton (nonZeroDivisors R) k) : ∏ᶠ (v : IsDedekindDomain.HeightOneSpectrum R), ↑v.asIdeal ^ (↑((Associates.mk v.asIdeal).count (Associates.mk (Ideal.span {Classical.choose ⋯})).factors) - ↑((Associates.mk v.asIdeal).count (Associates.mk (Ideal.span {↑(Classical.choose ⋯)})).factors)) = I - tprod_bot 📋 Mathlib.Topology.Algebra.InfiniteSum.Defs
{α : Type u_1} {β : Type u_2} [CommMonoid α] [TopologicalSpace α] {L : SummationFilter β} (hL : ¬L.NeBot) (f : β → α) : ∏'[L] (b : β), f b = ∏ᶠ (b : β), f b - tprod_def 📋 Mathlib.Topology.Algebra.InfiniteSum.Defs
{α : Type u_4} {β : Type u_5} [CommMonoid α] [TopologicalSpace α] (f : β → α) (L : SummationFilter β) : tprod f L = if h : Multipliable f L then if L.HasSupport ∧ (Function.mulSupport f ∩ L.support).Finite then finprod (L.support.mulIndicator f) else if HasProd f 1 L then 1 else Exists.choose h else 1 - tprod_eq_finprod 📋 Mathlib.Topology.Algebra.InfiniteSum.Basic
{α : Type u_1} {β : Type u_2} [CommMonoid α] [TopologicalSpace α] {f : β → α} {L : SummationFilter β} [L.LeAtTop] (hf : Function.HasFiniteMulSupport f) : ∏'[L] (b : β), f b = ∏ᶠ (b : β), f b - Real.log_finprod 📋 Mathlib.Analysis.SpecialFunctions.Log.Basic
{α : Type u_1} {f : α → ℝ} (h : ∀ (a : α), 0 < f a) : Real.log (∏ᶠ (a : α), f a) = ∑ᶠ (a : α), Real.log (f a) - analyticAt_finprod 📋 Mathlib.Analysis.Analytic.Constructions
{𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {E : Type u_3} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {α : Type u_9} {A : Type u_10} [NormedCommRing A] [NormedAlgebra 𝕜 A] {f : α → E → A} {c : E} (h : ∀ (a : α), AnalyticAt 𝕜 (f a) c) : AnalyticAt 𝕜 (∏ᶠ (n : α), f n) c - NumberField.FinitePlace.finprod_finitePlace_pow_multiplicity 📋 Mathlib.NumberTheory.NumberField.Completion.FinitePlace
{K : Type u_1} [Field K] [NumberField K] {I : Ideal (NumberField.RingOfIntegers K)} (hI : I ≠ ⊥) : ∏ᶠ (v : NumberField.FinitePlace K), v.maximalIdeal.asIdeal ^ multiplicity v.maximalIdeal.asIdeal I = I - contMDiff_finprod 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{ι : Type u_1} {𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_3} [TopologicalSpace H] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_5} [CommMonoid G] [TopologicalSpace G] [ChartedSpace H G] [ContMDiffMul I n G] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_7} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M : Type u_8} [TopologicalSpace M] [ChartedSpace H' M] {f : ι → M → G} (h : ∀ (i : ι), ContMDiff I' I n (f i)) (hfin : LocallyFinite fun i => Function.mulSupport (f i)) : ContMDiff I' I n fun x => ∏ᶠ (i : ι), f i x - contMDiffAt_finprod 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{ι : Type u_1} {𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_3} [TopologicalSpace H] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_5} [CommMonoid G] [TopologicalSpace G] [ChartedSpace H G] [ContMDiffMul I n G] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_7} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M : Type u_8} [TopologicalSpace M] [ChartedSpace H' M] {x₀ : M} {f : ι → M → G} (lf : LocallyFinite fun i => Function.mulSupport (f i)) (h : ∀ (i : ι), ContMDiffAt I' I n (f i) x₀) : ContMDiffAt I' I n (fun x => ∏ᶠ (i : ι), f i x) x₀ - contMDiffOn_finprod 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{ι : Type u_1} {𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_3} [TopologicalSpace H] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_5} [CommMonoid G] [TopologicalSpace G] [ChartedSpace H G] [ContMDiffMul I n G] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_7} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M : Type u_8} [TopologicalSpace M] [ChartedSpace H' M] {s : Set M} {f : ι → M → G} (lf : LocallyFinite fun i => Function.mulSupport (f i)) (h : ∀ (i : ι), ContMDiffOn I' I n (f i) s) : ContMDiffOn I' I n (fun x => ∏ᶠ (i : ι), f i x) s - contMDiffWithinAt_finprod 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{ι : Type u_1} {𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_3} [TopologicalSpace H] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_5} [CommMonoid G] [TopologicalSpace G] [ChartedSpace H G] [ContMDiffMul I n G] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_7} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M : Type u_8} [TopologicalSpace M] [ChartedSpace H' M] {s : Set M} {f : ι → M → G} (lf : LocallyFinite fun i => Function.mulSupport (f i)) {x₀ : M} (h : ∀ (i : ι), ContMDiffWithinAt I' I n (f i) s x₀) : ContMDiffWithinAt I' I n (fun x => ∏ᶠ (i : ι), f i x) s x₀ - contMDiff_finprod_cond 📋 Mathlib.Geometry.Manifold.Algebra.Monoid
{ι : Type u_1} {𝕜 : Type u_2} [NontriviallyNormedField 𝕜] {n : WithTop ℕ∞} {H : Type u_3} [TopologicalSpace H] {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {I : ModelWithCorners 𝕜 E H} {G : Type u_5} [CommMonoid G] [TopologicalSpace G] [ChartedSpace H G] [ContMDiffMul I n G] {E' : Type u_6} [NormedAddCommGroup E'] [NormedSpace 𝕜 E'] {H' : Type u_7} [TopologicalSpace H'] {I' : ModelWithCorners 𝕜 E' H'} {M : Type u_8} [TopologicalSpace M] [ChartedSpace H' M] {f : ι → M → G} {p : ι → Prop} (hc : ∀ (i : ι), p i → ContMDiff I' I n (f i)) (hf : LocallyFinite fun i => Function.mulSupport (f i)) : ContMDiff I' I n fun x => ∏ᶠ (i : ι) (_ : p i), f i x - BumpCovering.sum_toPOUFun_eq 📋 Mathlib.Topology.PartitionOfUnity
{ι : Type u} {X : Type v} [TopologicalSpace X] {s : Set X} (f : BumpCovering ι X s) (x : X) : ∑ᶠ (i : ι), f.toPOUFun i x = 1 - ∏ᶠ (i : ι), (1 - (f i) x) - BumpCovering.sum_toPartitionOfUnity_eq 📋 Mathlib.Topology.PartitionOfUnity
{ι : Type u} {X : Type v} [TopologicalSpace X] {s : Set X} (f : BumpCovering ι X s) (x : X) : ∑ᶠ (i : ι), (f.toPartitionOfUnity i) x = 1 - ∏ᶠ (i : ι), (1 - (f i) x) - BumpCovering.toPartitionOfUnity_apply 📋 Mathlib.Topology.PartitionOfUnity
{ι : Type u} {X : Type v} [TopologicalSpace X] {s : Set X} (f : BumpCovering ι X s) (i : ι) (x : X) : (f.toPartitionOfUnity i) x = (f i) x * ∏ᶠ (j : ι) (_ : WellOrderingRel j i), (1 - (f j) x) - SmoothBumpCovering.sum_toSmoothPartitionOfUnity_eq 📋 Mathlib.Geometry.Manifold.PartitionOfUnity
{ι : Type uι} {E : Type uE} [NormedAddCommGroup E] [NormedSpace ℝ E] {H : Type uH} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type uM} [TopologicalSpace M] [ChartedSpace H M] [FiniteDimensional ℝ E] {s : Set M} (fs : SmoothBumpCovering ι I M s) [T2Space M] [IsManifold I (↑⊤) M] (x : M) : ∑ᶠ (i : ι), (fs.toSmoothPartitionOfUnity i) x = 1 - ∏ᶠ (i : ι), (1 - ↑(fs.toFun i) x) - SmoothBumpCovering.toSmoothPartitionOfUnity_apply 📋 Mathlib.Geometry.Manifold.PartitionOfUnity
{ι : Type uι} {E : Type uE} [NormedAddCommGroup E] [NormedSpace ℝ E] {H : Type uH} [TopologicalSpace H] {I : ModelWithCorners ℝ E H} {M : Type uM} [TopologicalSpace M] [ChartedSpace H M] [FiniteDimensional ℝ E] {s : Set M} (fs : SmoothBumpCovering ι I M s) [T2Space M] [IsManifold I (↑⊤) M] (i : ι) (x : M) : (fs.toSmoothPartitionOfUnity i) x = ↑(fs.toFun i) x * ∏ᶠ (j : ι) (_ : WellOrderingRel j i), (1 - ↑(fs.toFun j) x) - Meromorphic.finprod 📋 Mathlib.Analysis.Meromorphic.Basic
{𝕜 : Type u_1} {𝕜' : Type u_2} [NontriviallyNormedField 𝕜] [NontriviallyNormedField 𝕜'] [NormedAlgebra 𝕜 𝕜'] {ι : Type u_5} {F : ι → 𝕜 → 𝕜'} (h : ∀ (σ : ι), Meromorphic (F σ)) : Meromorphic (∏ᶠ (σ : ι), F σ) - MeromorphicAt.finprod 📋 Mathlib.Analysis.Meromorphic.Basic
{𝕜 : Type u_1} {𝕜' : Type u_2} [NontriviallyNormedField 𝕜] [NontriviallyNormedField 𝕜'] [NormedAlgebra 𝕜 𝕜'] {ι : Type u_5} {F : ι → 𝕜 → 𝕜'} {x : 𝕜} (hf : ∀ (i : ι), MeromorphicAt (F i) x) : MeromorphicAt (∏ᶠ (i : ι), F i) x - MeromorphicOn.finprod 📋 Mathlib.Analysis.Meromorphic.Basic
{𝕜 : Type u_1} {𝕜' : Type u_2} [NontriviallyNormedField 𝕜] [NontriviallyNormedField 𝕜'] [NormedAlgebra 𝕜 𝕜'] {U : Set 𝕜} {ι : Type u_5} {f : ι → 𝕜 → 𝕜'} (h : ∀ (σ : ι), MeromorphicOn (f σ) U) : MeromorphicOn (∏ᶠ (n : ι), f n) U - meromorphicOrderAt_finprod_ne_top 📋 Mathlib.Analysis.Meromorphic.Order
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {x : 𝕜} {ι : Type u_5} {F : ι → 𝕜 → 𝕜} (h₁ : ∀ (c : ι), MeromorphicAt (F c) x) (h₂ : ∀ (c : ι), meromorphicOrderAt (F c) x ≠ ⊤) : meromorphicOrderAt (∏ᶠ (c : ι), F c) x ≠ ⊤ - meromorphicNFAt_finprod 📋 Mathlib.Analysis.Meromorphic.NormalForm
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {x : 𝕜} {ι : Type u_3} {f : ι → 𝕜 → 𝕜} (h₁f : ∀ (i : ι), MeromorphicNFAt (f i) x) (h₂f : {σ | f σ x = 0}.Subsingleton) : MeromorphicNFAt (∏ᶠ (i : ι), f i) x - meromorphicNFOn_finprod 📋 Mathlib.Analysis.Meromorphic.NormalForm
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {U : Set 𝕜} {ι : Type u_3} {f : ι → 𝕜 → 𝕜} (h₁f : ∀ (i : ι), MeromorphicNFOn (f i) U) (h₂f : ∀ x ∈ U, {σ | f σ x = 0}.Subsingleton) : MeromorphicNFOn (∏ᶠ (i : ι), f i) U - Function.FactorizedRational.meromorphicNFOn_univ 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] (d : 𝕜 → ℤ) : MeromorphicNFOn (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) Set.univ - Function.FactorizedRational.meromorphicNFOn 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] (d : 𝕜 → ℤ) (U : Set 𝕜) : MeromorphicNFOn (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) U - Function.FactorizedRational.meromorphicOrderAt_ne_top 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {z : 𝕜} (d : 𝕜 → ℤ) : meromorphicOrderAt (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) z ≠ ⊤ - Function.FactorizedRational.ne_zero 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} {x : 𝕜} (h : d x = 0) : (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) x ≠ 0 - Function.FactorizedRational.meromorphicOrderAt_eq 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {z : 𝕜} (d : 𝕜 → ℤ) (h₁d : Function.HasFiniteSupport d) : meromorphicOrderAt (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) z = ↑(d z) - Function.FactorizedRational.analyticAt 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} {x : 𝕜} (h : 0 ≤ d x) : AnalyticAt 𝕜 (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) x - Function.FactorizedRational.finprod_eq_fun 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} (h : Function.HasFiniteSupport d) : ∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u = fun x => ∏ᶠ (u : 𝕜), (x - u) ^ d u - Function.FactorizedRational.log_norm_meromorphicTrailingCoeffAt 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} {x : 𝕜} (h : Function.HasFiniteSupport d) : Real.log ‖meromorphicTrailingCoeffAt (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) x‖ = ∑ᶠ (u : 𝕜), ↑(d u) * Real.log ‖x - u‖ - Function.FactorizedRational.meromorphicTrailingCoeffAt_factorizedRational 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} {x : 𝕜} (h : Function.HasFiniteSupport d) : meromorphicTrailingCoeffAt (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) x = ∏ᶠ (u : 𝕜), (x - u) ^ Function.update d x 0 u - Function.FactorizedRational.meromorphicTrailingCoeffAt_factorizedRational_off_support 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} {x : 𝕜} (h₁ : Function.HasFiniteSupport d) (h₂ : x ∉ Function.support d) : meromorphicTrailingCoeffAt (∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u) x = ∏ᶠ (u : 𝕜), (x - u) ^ d u - Function.FactorizedRational.divisor 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {U : Set 𝕜} {D : Function.locallyFinsuppWithin U ℤ} (hD : D.support.Finite) : MeromorphicOn.divisor (∏ᶠ (u : 𝕜), (fun x => x - u) ^ D u) U = D - Function.FactorizedRational.extractFactor 📋 Mathlib.Analysis.Meromorphic.FactorizedRational
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {d : 𝕜 → ℤ} (u₀ : 𝕜) (hd : Function.HasFiniteSupport d) : ∏ᶠ (u : 𝕜), (fun x => x - u) ^ d u = (fun x => x - u₀) ^ d u₀ * ∏ᶠ (u : 𝕜), (fun x => x - u) ^ Function.update d u₀ 0 u
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 69fae59