Loogle!
Result
Found 5224 declarations mentioning Finsupp. Of these, 238 have a name containing "ind". Of these, only the first 200 are shown.
- Finsupp.single_eq_set_indicator 📋 Mathlib.Data.Finsupp.Single
{α : Type u_1} {M : Type u_5} [Zero M] {a : α} {b : M} : (⇑fun₀ | a => b) = {a}.indicator fun x => b - Finsupp.set_indicator_singleton 📋 Mathlib.Data.Finsupp.Single
{α : Type u_1} {M : Type u_5} [Zero M] (a : α) (f : α → M) : {a}.indicator f = ⇑fun₀ | a => f a - Finsupp.induction_linear 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (add : ∀ (f g : ι →₀ M), motive f → motive g → motive (f + g)) (single : ∀ (a : ι) (b : M), motive fun₀ | a => b) : motive f - Finsupp.induction 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (single_add : ∀ (a : ι) (b : M) (f : ι →₀ M), a ∉ f.support → b ≠ 0 → motive f → motive ((fun₀ | a => b) + f)) : motive f - Finsupp.induction₂ 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (add_single : ∀ (a : ι) (b : M) (f : ι →₀ M), a ∉ f.support → b ≠ 0 → motive f → motive (f + fun₀ | a => b)) : motive f - Finsupp.induction_on_max 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] [LinearOrder ι] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (single_add : ∀ (a : ι) (b : M) (f : ι →₀ M), (∀ c ∈ f.support, c < a) → b ≠ 0 → motive f → motive ((fun₀ | a => b) + f)) : motive f - Finsupp.induction_on_max₂ 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] [LinearOrder ι] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (add_single : ∀ (a : ι) (b : M) (f : ι →₀ M), (∀ c ∈ f.support, c < a) → b ≠ 0 → motive f → motive (f + fun₀ | a => b)) : motive f - Finsupp.induction_on_min 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] [LinearOrder ι] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (single_add : ∀ (a : ι) (b : M) (f : ι →₀ M), (∀ c ∈ f.support, a < c) → b ≠ 0 → motive f → motive ((fun₀ | a => b) + f)) : motive f - Finsupp.induction_on_min₂ 📋 Mathlib.Algebra.Group.Finsupp
{ι : Type u_1} {M : Type u_3} [AddZeroClass M] [LinearOrder ι] {motive : (ι →₀ M) → Prop} (f : ι →₀ M) (zero : motive 0) (add_single : ∀ (a : ι) (b : M) (f : ι →₀ M), (∀ c ∈ f.support, a < c) → b ≠ 0 → motive f → motive (f + fun₀ | a => b)) : motive f - Finsupp.indicator 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) (f : (i : ι) → i ∈ s → α) : ι →₀ α - Finsupp.indicator_injective 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) : Function.Injective fun f => Finsupp.indicator s f - Finsupp.single_eq_indicator 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (i : ι) (b : α) : (fun₀ | i => b) = Finsupp.indicator {i} fun x x_1 => b - Finsupp.indicator_singleton 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (a : ι) (f : (j : ι) → j ∈ {a} → α) : Finsupp.indicator {a} f = fun₀ | a => f a ⋯ - Finsupp.indicator_eq_set_indicator 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) (g : ι → α) : ⇑(Finsupp.indicator s fun i x => g i) = (↑s).indicator g - Finsupp.indicator_of_mem 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] {s : Finset ι} {i : ι} (hi : i ∈ s) (f : (i : ι) → i ∈ s → α) : (Finsupp.indicator s f) i = f i hi - Finsupp.eq_indicator_self_iff 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) {d : ι →₀ α} : (d = Finsupp.indicator s fun i x => d i) ↔ d.support ⊆ s - Finsupp.indicator_of_notMem 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] {s : Finset ι} {i : ι} (hi : i ∉ s) (f : (i : ι) → i ∈ s → α) : (Finsupp.indicator s f) i = 0 - Finsupp.eq_indicator_iff 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) (f : (i : ι) → i ∈ s → α) {g : ι → α} : g = ⇑(Finsupp.indicator s f) ↔ Function.support g ⊆ ↑s ∧ ∀ ⦃i : ι⦄ (hi : i ∈ s), f i hi = g i - Finsupp.indicator_apply 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) (f : (i : ι) → i ∈ s → α) (i : ι) [DecidableEq ι] : (Finsupp.indicator s f) i = if hi : i ∈ s then f i hi else 0 - Finsupp.indicator_indicator 📋 Mathlib.Data.Finsupp.Indicator
{ι : Type u_1} {α : Type u_2} [Zero α] (s : Finset ι) {t : Finset ι} (f : (i : ι) → i ∈ s → α) [DecidableEq ι] : (Finsupp.indicator t fun i x => (Finsupp.indicator s f) i) = Finsupp.indicator (s ∩ t) fun i hi => f i ⋯ - Finsupp.prod_zero_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [Zero M] [CommMonoid N] {h : α → M → N} : Finsupp.prod 0 h = 1 - Finsupp.sum_zero_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [Zero M] [AddCommMonoid N] {h : α → M → N} : Finsupp.sum 0 h = 0 - Finsupp.indicator_eq_sum_single 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} [AddCommMonoid M] (s : Finset α) (f : α → M) : (Finsupp.indicator s fun x x_1 => f x) = ∑ x ∈ s, fun₀ | x => f x - Finsupp.prod_mapRange_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {M' : Type u_9} {N : Type u_10} [Zero M] [Zero M'] [CommMonoid N] {f : M → M'} {hf : f 0 = 0} {g : α →₀ M} {h : α → M' → N} (h0 : ∀ (a : α), h a 0 = 1) : (Finsupp.mapRange f hf g).prod h = g.prod fun a b => h a (f b) - Finsupp.sum_mapRange_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {M' : Type u_9} {N : Type u_10} [Zero M] [Zero M'] [AddCommMonoid N] {f : M → M'} {hf : f 0 = 0} {g : α →₀ M} {h : α → M' → N} (h0 : ∀ (a : α), h a 0 = 0) : (Finsupp.mapRange f hf g).sum h = g.sum fun a b => h a (f b) - Finsupp.prod_neg_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {G : Type u_12} [SubtractionMonoid G] [CommMonoid M] {g : α →₀ G} {h : α → G → M} (h0 : ∀ (a : α), h a 0 = 1) : (-g).prod h = g.prod fun a b => h a (-b) - Finsupp.sum_neg_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {G : Type u_12} [SubtractionMonoid G] [AddCommMonoid M] {g : α →₀ G} {h : α → G → M} (h0 : ∀ (a : α), h a 0 = 0) : (-g).sum h = g.sum fun a b => h a (-b) - Finsupp.indicator_eq_sum_attach_single 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} [AddCommMonoid M] {s : Finset α} (f : (a : α) → a ∈ s → M) : Finsupp.indicator s f = ∑ x ∈ s.attach, fun₀ | ↑x => f ↑x ⋯ - Finsupp.prod_finsetSum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {ι : Type u_2} {M : Type u_8} {N : Type u_10} [AddCommMonoid M] [CommMonoid N] {s : Finset ι} {g : ι → α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 1) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ * h a b₂) : ∏ i ∈ s, (g i).prod h = (∑ i ∈ s, g i).prod h - Finsupp.prod_finset_sum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {ι : Type u_2} {M : Type u_8} {N : Type u_10} [AddCommMonoid M] [CommMonoid N] {s : Finset ι} {g : ι → α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 1) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ * h a b₂) : ∏ i ∈ s, (g i).prod h = (∑ i ∈ s, g i).prod h - Finsupp.sum_finsetSum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {ι : Type u_2} {M : Type u_8} {N : Type u_10} [AddCommMonoid M] [AddCommMonoid N] {s : Finset ι} {g : ι → α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 0) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ + h a b₂) : ∑ i ∈ s, (g i).sum h = (∑ i ∈ s, g i).sum h - Finsupp.sum_finset_sum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {ι : Type u_2} {M : Type u_8} {N : Type u_10} [AddCommMonoid M] [AddCommMonoid N] {s : Finset ι} {g : ι → α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 0) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ + h a b₂) : ∑ i ∈ s, (g i).sum h = (∑ i ∈ s, g i).sum h - Finsupp.prod_sum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {β : Type u_7} {M : Type u_8} {N : Type u_10} {P : Type u_11} [Zero M] [AddCommMonoid N] [CommMonoid P] {f : α →₀ M} {g : α → M → β →₀ N} {h : β → N → P} (h_zero : ∀ (a : β), h a 0 = 1) (h_add : ∀ (a : β) (b₁ b₂ : N), h a (b₁ + b₂) = h a b₁ * h a b₂) : (f.sum g).prod h = f.prod fun a b => (g a b).prod h - Finsupp.sum_sum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {β : Type u_7} {M : Type u_8} {N : Type u_10} {P : Type u_11} [Zero M] [AddCommMonoid N] [AddCommMonoid P] {f : α →₀ M} {g : α → M → β →₀ N} {h : β → N → P} (h_zero : ∀ (a : β), h a 0 = 0) (h_add : ∀ (a : β) (b₁ b₂ : N), h a (b₁ + b₂) = h a b₁ + h a b₂) : (f.sum g).sum h = f.sum fun a b => (g a b).sum h - Finsupp.multiset_sum_sum_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [AddCommMonoid M] [AddCommMonoid N] (f : Multiset (α →₀ M)) (h : α → M → N) (h₀ : ∀ (a : α), h a 0 = 0) (h₁ : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ + h a b₂) : f.sum.sum h = (Multiset.map (fun g => g.sum h) f).sum - Finsupp.prod_add_index' 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [AddZeroClass M] [CommMonoid N] {f g : α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 1) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ * h a b₂) : (f + g).prod h = f.prod h * g.prod h - Finsupp.sum_add_index' 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [AddZeroClass M] [AddCommMonoid N] {f g : α →₀ M} {h : α → M → N} (h_zero : ∀ (a : α), h a 0 = 0) (h_add : ∀ (a : α) (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ + h a b₂) : (f + g).sum h = f.sum h + g.sum h - Finsupp.prod_add_index_of_disjoint 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} [AddCommMonoid M] {f1 f2 : α →₀ M} (hd : Disjoint f1.support f2.support) {β : Type u_16} [CommMonoid β] (g : α → M → β) : (f1 + f2).prod g = f1.prod g * f2.prod g - Finsupp.sum_add_index_of_disjoint 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} [AddCommMonoid M] {f1 f2 : α →₀ M} (hd : Disjoint f1.support f2.support) {β : Type u_16} [AddCommMonoid β] (g : α → M → β) : (f1 + f2).sum g = f1.sum g + f2.sum g - Finsupp.sum_sub_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {γ : Type u_3} {β : Type u_7} [AddGroup β] [AddCommGroup γ] {f g : α →₀ β} {h : α → β → γ} (h_sub : ∀ (a : α) (b₁ b₂ : β), h a (b₁ - b₂) = h a b₁ - h a b₂) : (f - g).sum h = f.sum h - g.sum h - Finsupp.sum_hom_add_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [AddZeroClass M] [AddCommMonoid N] {f g : α →₀ M} (h : α → M →+ N) : ((f + g).sum fun x => ⇑(h x)) = (f.sum fun x => ⇑(h x)) + g.sum fun x => ⇑(h x) - Finsupp.prod_add_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [DecidableEq α] [AddZeroClass M] [CommMonoid N] {f g : α →₀ M} {h : α → M → N} (h_zero : ∀ a ∈ f.support ∪ g.support, h a 0 = 1) (h_add : ∀ a ∈ f.support ∪ g.support, ∀ (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ * h a b₂) : (f + g).prod h = f.prod h * g.prod h - Finsupp.sum_add_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [DecidableEq α] [AddZeroClass M] [AddCommMonoid N] {f g : α →₀ M} {h : α → M → N} (h_zero : ∀ a ∈ f.support ∪ g.support, h a 0 = 0) (h_add : ∀ a ∈ f.support ∪ g.support, ∀ (b₁ b₂ : M), h a (b₁ + b₂) = h a b₁ + h a b₂) : (f + g).sum h = f.sum h + g.sum h - Finsupp.prod_hom_add_index 📋 Mathlib.Algebra.BigOperators.Finsupp.Basic
{α : Type u_1} {M : Type u_8} {N : Type u_10} [AddZeroClass M] [CommMonoid N] {f g : α →₀ M} (h : α → Multiplicative M →* N) : ((f + g).prod fun a b => (h a) (Multiplicative.ofAdd b)) = (f.prod fun a b => (h a) (Multiplicative.ofAdd b)) * g.prod fun a b => (h a) (Multiplicative.ofAdd b) - Finsupp.filter_eq_indicator 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {M : Type u_5} [Zero M] (p : α → Prop) [DecidablePred p] (f : α →₀ M) : ⇑(Finsupp.filter p f) = {x | p x}.indicator ⇑f - Finsupp.prod_filter_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {M : Type u_5} {N : Type u_6} [Zero M] (p : α → Prop) [DecidablePred p] (f : α →₀ M) [CommMonoid N] (g : α → M → N) : (Finsupp.filter p f).prod g = ∏ x ∈ (Finsupp.filter p f).support, g x (f x) - Finsupp.sum_filter_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {M : Type u_5} {N : Type u_6} [Zero M] (p : α → Prop) [DecidablePred p] (f : α →₀ M) [AddCommMonoid N] (g : α → M → N) : (Finsupp.filter p f).sum g = ∑ x ∈ (Finsupp.filter p f).support, g x (f x) - Finsupp.prod_subtypeDomain_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {M : Type u_5} {N : Type u_6} [Zero M] {p : α → Prop} [CommMonoid N] {v : α →₀ M} {h : α → M → N} (hp : ∀ x ∈ v.support, p x) : ((Finsupp.subtypeDomain p v).prod fun a b => h (↑a) b) = v.prod h - Finsupp.sum_subtypeDomain_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {M : Type u_5} {N : Type u_6} [Zero M] {p : α → Prop} [AddCommMonoid N] {v : α →₀ M} {h : α → M → N} (hp : ∀ x ∈ v.support, p x) : ((Finsupp.subtypeDomain p v).sum fun a b => h (↑a) b) = v.sum h - Finsupp.prod_mapDomain_index_inj 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [AddCommMonoid M] [CommMonoid N] {f : α → β} {s : α →₀ M} {h : β → M → N} (hf : Function.Injective f) : (Finsupp.mapDomain f s).prod h = s.prod fun a b => h (f a) b - Finsupp.sum_mapDomain_index_inj 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [AddCommMonoid M] [AddCommMonoid N] {f : α → β} {s : α →₀ M} {h : β → M → N} (hf : Function.Injective f) : (Finsupp.mapDomain f s).sum h = s.sum fun a b => h (f a) b - Finsupp.sum_curry_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [Zero M] [AddCommMonoid N] (f : α × β →₀ M) (g : α → β → M → N) : (f.curry.sum fun a f => f.sum (g a)) = f.sum fun p c => g p.1 p.2 c - Finsupp.sum_uncurry_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [Zero M] [AddCommMonoid N] (f : α →₀ β →₀ M) (g : α × β → M → N) : (f.uncurry.sum fun p c => g p c) = f.sum fun a f => f.sum fun b => g (a, b) - Finsupp.sum_uncurry_index' 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [Zero M] [AddCommMonoid N] (f : α →₀ β →₀ M) (g : α → β → M → N) : (f.uncurry.sum fun p c => g p.1 p.2 c) = f.sum fun a f => f.sum (g a) - Finsupp.prod_mapDomain_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [AddCommMonoid M] [CommMonoid N] {f : α → β} {s : α →₀ M} {h : β → M → N} (h_zero : ∀ (b : β), h b 0 = 1) (h_add : ∀ (b : β) (m₁ m₂ : M), h b (m₁ + m₂) = h b m₁ * h b m₂) : (Finsupp.mapDomain f s).prod h = s.prod fun a m => h (f a) m - Finsupp.sum_mapDomain_index 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [AddCommMonoid M] [AddCommMonoid N] {f : α → β} {s : α →₀ M} {h : β → M → N} (h_zero : ∀ (b : β), h b 0 = 0) (h_add : ∀ (b : β) (m₁ m₂ : M), h b (m₁ + m₂) = h b m₁ + h b m₂) : (Finsupp.mapDomain f s).sum h = s.sum fun a m => h (f a) m - Finsupp.sum_mapDomain_index_addMonoidHom 📋 Mathlib.Data.Finsupp.Basic
{α : Type u_1} {β : Type u_2} {M : Type u_5} {N : Type u_6} [AddCommMonoid M] [AddCommMonoid N] {f : α → β} {s : α →₀ M} (h : β → M →+ N) : ((Finsupp.mapDomain f s).sum fun b m => (h b) m) = s.sum fun a m => (h (f a)) m - Finsupp.prod_option_index 📋 Mathlib.Data.Finsupp.Option
{α : Type u_1} {M : Type u_2} {N : Type u_3} [AddZeroClass M] [CommMonoid N] (f : Option α →₀ M) (b : Option α → M → N) (h_zero : ∀ (o : Option α), b o 0 = 1) (h_add : ∀ (o : Option α) (m₁ m₂ : M), b o (m₁ + m₂) = b o m₁ * b o m₂) : f.prod b = b none (f none) * f.some.prod fun a => b (some a) - Finsupp.sum_option_index 📋 Mathlib.Data.Finsupp.Option
{α : Type u_1} {M : Type u_2} {N : Type u_3} [AddZeroClass M] [AddCommMonoid N] (f : Option α →₀ M) (b : Option α → M → N) (h_zero : ∀ (o : Option α), b o 0 = 0) (h_add : ∀ (o : Option α) (m₁ m₂ : M), b o (m₁ + m₂) = b o m₁ + b o m₂) : f.sum b = b none (f none) + f.some.sum fun a => b (some a) - Finsupp.sum_option_index_smul 📋 Mathlib.Data.Finsupp.Option
{α : Type u_1} {M : Type u_2} {R : Type u_4} [Semiring R] [AddCommMonoid M] [Module R M] (f : Option α →₀ R) (b : Option α → M) : (f.sum fun o r => r • b o) = f none • b none + f.some.sum fun a r => r • b (some a) - Finsupp.sum_smul_index' 📋 Mathlib.Data.Finsupp.SMul
{α : Type u_1} {M : Type u_3} {N : Type u_4} {R : Type u_6} [Zero M] [SMulZeroClass R M] [AddCommMonoid N] {g : α →₀ M} {b : R} {h : α → M → N} (h0 : ∀ (i : α), h i 0 = 0) : (b • g).sum h = g.sum fun i c => h i (b • c) - Finsupp.sum_smul_index 📋 Mathlib.Data.Finsupp.SMul
{α : Type u_1} {M : Type u_3} {R : Type u_6} [MulZeroClass R] [AddCommMonoid M] {g : α →₀ R} {b : R} {h : α → R → M} (h0 : ∀ (i : α), h i 0 = 0) : (b • g).sum h = g.sum fun i a => h i (b * a) - Finsupp.sum_smul_index_addMonoidHom 📋 Mathlib.Data.Finsupp.SMul
{α : Type u_1} {M : Type u_3} {N : Type u_4} {R : Type u_6} [AddZeroClass M] [AddCommMonoid N] [SMulZeroClass R M] {g : α →₀ M} {b : R} {h : α → M →+ N} : ((b • g).sum fun a => ⇑(h a)) = g.sum fun i c => (h i) (b • c) - Finsupp.sum_smul_index_linearMap' 📋 Mathlib.LinearAlgebra.Finsupp.LSum
{α : Type u_1} {R : Type u_3} {M : Type u_5} {M₂ : Type u_6} [Semiring R] [AddCommMonoid M] [Module R M] [AddCommMonoid M₂] [Module R M₂] {v : α →₀ M} {c : R} {h : α → M →ₗ[R] M₂} : ((c • v).sum fun a => ⇑(h a)) = c • v.sum fun a => ⇑(h a) - Finsupp.sum_smul_index_semilinearMap' 📋 Mathlib.LinearAlgebra.Finsupp.LSum
{α : Type u_1} {R : Type u_3} {R₂ : Type u_4} {M : Type u_5} {M₂ : Type u_6} [Semiring R] [Semiring R₂] [AddCommMonoid M] [Module R M] [AddCommMonoid M₂] [Module R₂ M₂] {σ : R →+* R₂} {v : α →₀ M} {c : R} {h : α → M →ₛₗ[σ] M₂} : ((c • v).sum fun a => ⇑(h a)) = σ c • v.sum fun a => ⇑(h a) - Finsupp.linearCombination_single_index 📋 Mathlib.LinearAlgebra.Finsupp.LinearCombination
(α : Type u_1) (M : Type u_2) (R : Type u_5) [Semiring R] [AddCommMonoid M] [Module R M] (c : M) (a : α) (f : α →₀ R) [DecidableEq α] : (Finsupp.linearCombination R (Pi.single a c)) f = f a • c - Module.Basis.repr_reindex 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_1} {ι' : Type u_2} {R : Type u_3} {M : Type u_6} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) (x : M) (e : ι ≃ ι') : (b.reindex e).repr x = Finsupp.mapDomain (⇑e) (b.repr x) - Module.Basis.repr_reindex_apply 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_1} {ι' : Type u_2} {R : Type u_3} {M : Type u_6} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) (x : M) (e : ι ≃ ι') (i' : ι') : ((b.reindex e).repr x) i' = (b.repr x) (e.symm i') - Module.Basis.reindexRange_repr_self 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_10} {R : Type u_11} {M : Type u_12} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) (i : ι) : b.reindexRange.repr (b i) = fun₀ | ⟨b i, ⋯⟩ => 1 - Module.Basis.reindexRange_repr' 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_10} {R : Type u_11} {M : Type u_12} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) (x : M) {bi : M} {i : ι} (h : b i = bi) : (b.reindexRange.repr x) ⟨bi, ⋯⟩ = (b.repr x) i - Module.Basis.reindexFinsetRange_repr_self 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_10} {R : Type u_11} {M : Type u_12} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) [Fintype ι] [DecidableEq M] (i : ι) : b.reindexFinsetRange.repr (b i) = fun₀ | ⟨b i, ⋯⟩ => 1 - Module.Basis.reindexRange_repr 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_10} {R : Type u_11} {M : Type u_12} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) (x : M) (i : ι) (h : b i ∈ Set.range ⇑b := ⋯) : (b.reindexRange.repr x) ⟨b i, h⟩ = (b.repr x) i - Module.Basis.reindexFinsetRange_repr 📋 Mathlib.LinearAlgebra.Basis.Defs
{ι : Type u_10} {R : Type u_11} {M : Type u_12} [Semiring R] [AddCommMonoid M] [Module R M] (b : Module.Basis ι R M) [Fintype ι] [DecidableEq M] (x : M) (i : ι) (h : b i ∈ Finset.image (⇑b) Finset.univ := ⋯) : (b.reindexFinsetRange.repr x) ⟨b i, h⟩ = (b.repr x) i - LinearIndependent.repr 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) : ↥(Submodule.span R (Set.range v)) →ₗ[R] ι →₀ R - LinearIndependent.finsuppLinearCombination_injective 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] : LinearIndependent R v → Function.Injective ⇑(Finsupp.linearCombination R v) - linearIndependent_iff_injective_finsuppLinearCombination 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] : LinearIndependent R v ↔ Function.Injective ⇑(Finsupp.linearCombination R v) - LinearIndependent.linearCombinationEquiv 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) : (ι →₀ R) ≃ₗ[R] ↥(Submodule.span R (Set.range v)) - not_linearIndependent_iff_finsupp 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : ¬LinearIndependent R v ↔ ∃ f, (f.sum fun x r => r • v x) = 0 ∧ f ≠ 0 - linearIndependent_iff_ker 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : LinearIndependent R v ↔ (Finsupp.linearCombination R v).ker = ⊥ - LinearIndependent.repr_range 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) : hv.repr.range = ⊤ - linearIndependent_iff 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : LinearIndependent R v ↔ ∀ (l : ι →₀ R), (Finsupp.linearCombination R v) l = 0 → l = 0 - linearIndependent_iffₛ 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] : LinearIndependent R v ↔ ∀ (l₁ l₂ : ι →₀ R), (Finsupp.linearCombination R v) l₁ = (Finsupp.linearCombination R v) l₂ → l₁ = l₂ - not_linearIndependent_iff_linearCombination 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : ¬LinearIndependent R v ↔ ∃ l, (Finsupp.linearCombination R v) l = 0 ∧ l ≠ 0 - linearIndepOn_iff_disjoint 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {s : Set ι} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : LinearIndepOn R v s ↔ Disjoint (Finsupp.supported R R s) (Finsupp.linearCombination R v).ker - LinearIndependent.linearCombination_comp_repr 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) : Finsupp.linearCombination R v ∘ₗ hv.repr = (Submodule.span R (Set.range v)).subtype - LinearIndependent.repr_ker 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) : hv.repr.ker = ⊥ - LinearIndependent.span_repr_eq 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) [Nontrivial R] (x : ↥(Submodule.span R (Set.range v))) : Span.repr R (Set.range v) x = Finsupp.equivMapDomain (Equiv.ofInjective v ⋯) (hv.repr x) - LinearIndependent.repr_eq_single 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) (i : ι) (x : ↥(Submodule.span R (Set.range v))) (hx : ↑x = v i) : hv.repr x = fun₀ | i => 1 - linearIndepOn_iff 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {s : Set ι} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : LinearIndepOn R v s ↔ ∀ l ∈ Finsupp.supported R R s, (Finsupp.linearCombination R v) l = 0 → l = 0 - LinearIndependent.linearCombination_repr 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) (x : ↥(Submodule.span R (Set.range v))) : (Finsupp.linearCombination R v) (hv.repr x) = ↑x - LinearIndependent.repr_eq 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) {l : ι →₀ R} {x : ↥(Submodule.span R (Set.range v))} (eq : (Finsupp.linearCombination R v) l = ↑x) : hv.repr x = l - linearIndepOn_iffₛ 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {s : Set ι} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] : LinearIndepOn R v s ↔ ∀ f ∈ Finsupp.supported R R s, ∀ g ∈ Finsupp.supported R R s, (Finsupp.linearCombination R v) f = (Finsupp.linearCombination R v) g → f = g - LinearIndependent.linearCombinationEquiv_apply_coe 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) (x : ι →₀ R) : ↑(hv.linearCombinationEquiv x) = (Finsupp.linearCombination R v) x - linearIndepOn_iff_linearCombinationOnₛ 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {s : Set ι} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] : LinearIndepOn R v s ↔ Function.Injective ⇑(Finsupp.linearCombinationOn ι M R v s) - linearIndepOn_iff_linearCombinationOn 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {s : Set ι} {M : Type u_4} [Ring R] [AddCommGroup M] [Module R M] {v : ι → M} : LinearIndepOn R v s ↔ (Finsupp.linearCombinationOn ι M R v s).ker = ⊥ - LinearIndependent.linearCombinationEquiv_symm_apply 📋 Mathlib.LinearAlgebra.LinearIndependent.Defs
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] (hv : LinearIndependent R v) (a✝ : ↥(Submodule.span R (Set.range v))) : hv.linearCombinationEquiv.symm a✝ = ((LinearEquiv.ofInjective (LinearMap.codRestrict (Submodule.span R (Set.range v)) (Finsupp.linearCombination R v) ⋯) ⋯).toEquiv.trans (LinearEquiv.ofTop (LinearMap.codRestrict (Submodule.span R (Set.range v)) (Finsupp.linearCombination R v) ⋯).range ⋯).toEquiv).invFun a✝ - LinearIndependent.linearCombination_ne_of_notMem_support 📋 Mathlib.LinearAlgebra.LinearIndependent.Basic
{ι : Type u'} {R : Type u_2} {M : Type u_4} {v : ι → M} [Semiring R] [AddCommMonoid M] [Module R M] [Nontrivial R] (hv : LinearIndependent R v) {x : ι} (f : ι →₀ R) (h : x ∉ f.support) : (Finsupp.linearCombination R v) f ≠ v x - union_support_maximal_linearIndependent_eq_range_basis 📋 Mathlib.LinearAlgebra.Basis.Cardinality
{R : Type u} {M : Type v} [Semiring R] [AddCommMonoid M] [Nontrivial R] [Module R M] {ι : Type w} (b : Module.Basis ι R M) {κ : Type w'} (v : κ → M) (ind : LinearIndependent R v) (m : ind.Maximal) : ⋃ k, ↑(b.repr (v k)).support = Set.univ - iSupIndep_range_lsingle 📋 Mathlib.LinearAlgebra.LinearIndependent.Lemmas
(ι : Type u') (R : Type u_2) (M : Type u_4) [Semiring R] [AddCommMonoid M] [Module R M] : iSupIndep fun i => (Finsupp.lsingle i).range - Finsupp.linearIndependent_single_one 📋 Mathlib.LinearAlgebra.Finsupp.VectorSpace
(R : Type u_1) (ι : Type u_3) [Semiring R] : LinearIndependent R fun i => fun₀ | i => 1 - Finsupp.linearIndependent_single 📋 Mathlib.LinearAlgebra.Finsupp.VectorSpace
{R : Type u_1} {M : Type u_2} {ι : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {φ : ι → Type u_4} (f : (i : ι) → φ i → M) (hf : ∀ (i : ι), LinearIndependent R (f i)) : LinearIndependent R fun ix => fun₀ | ix.fst => f ix.fst ix.snd - Finsupp.linearIndependent_single_iff 📋 Mathlib.LinearAlgebra.Finsupp.VectorSpace
{R : Type u_1} {M : Type u_2} {ι : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] {φ : ι → Type u_4} {f : (i : ι) → φ i → M} : (LinearIndependent R fun ix => fun₀ | ix.fst => f ix.fst ix.snd) ↔ ∀ (i : ι), LinearIndependent R (f i) - Finsupp.linearIndependent_single_of_ne_zero 📋 Mathlib.LinearAlgebra.Finsupp.VectorSpace
{R : Type u_1} {M : Type u_2} {ι : Type u_3} [Ring R] [AddCommGroup M] [IsDomain R] [Module R M] [Module.IsTorsionFree R M] {v : ι → M} (hv : ∀ (i : ι), v i ≠ 0) : LinearIndependent R fun i => fun₀ | i => v i - Finsupp.sum_le_sum_index 📋 Mathlib.Data.Finsupp.Order
{ι : Type u_1} {α : Type u_3} {β : Type u_4} [Zero α] [Preorder α] [AddCommMonoid β] [Preorder β] [IsOrderedAddMonoid β] [DecidableEq ι] {f₁ f₂ : ι →₀ α} {h : ι → α → β} (hf : f₁ ≤ f₂) (hh : ∀ i ∈ f₁.support ∪ f₂.support, Monotone (h i)) (hh₀ : ∀ i ∈ f₁.support ∪ f₂.support, h i 0 = 0) : f₁.sum h ≤ f₂.sum h - MvPolynomial.induction_on 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {motive : MvPolynomial σ R → Prop} (p : MvPolynomial σ R) (C : ∀ (a : R), motive (MvPolynomial.C a)) (add : ∀ (p q : MvPolynomial σ R), motive p → motive q → motive (p + q)) (mul_X : ∀ (p : MvPolynomial σ R) (n : σ), motive p → motive (p * MvPolynomial.X n)) : motive p - MvPolynomial.induction_on' 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {P : MvPolynomial σ R → Prop} (p : MvPolynomial σ R) (monomial : ∀ (u : σ →₀ ℕ) (a : R), P ((MvPolynomial.monomial u) a)) (add : ∀ (p q : MvPolynomial σ R), P p → P q → P (p + q)) : P p - MvPolynomial.induction_on_monomial 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {motive : MvPolynomial σ R → Prop} (C : ∀ (a : R), motive (MvPolynomial.C a)) (mul_X : ∀ (p : MvPolynomial σ R) (n : σ), motive p → motive (p * MvPolynomial.X n)) (s : σ →₀ ℕ) (a : R) : motive ((MvPolynomial.monomial s) a) - MvPolynomial.monomial_add_induction_on 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {motive : MvPolynomial σ R → Prop} (p : MvPolynomial σ R) (C : ∀ (a : R), motive (MvPolynomial.C a)) (monomial_add : ∀ (a : σ →₀ ℕ) (b : R) (f : MvPolynomial σ R), a ∉ f.support → b ≠ 0 → motive f → motive ((MvPolynomial.monomial a) b + f)) : motive p - MvPolynomial.monomial_sum_index 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {α : Type u_2} (s : Finset α) (f : α → σ →₀ ℕ) (a : R) : (MvPolynomial.monomial (∑ i ∈ s, f i)) a = MvPolynomial.C a * ∏ i ∈ s, (MvPolynomial.monomial (f i)) 1 - MvPolynomial.monomial_finsupp_sum_index 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {α : Type u_2} {β : Type u_3} [Zero β] (f : α →₀ β) (g : α → β → σ →₀ ℕ) (a : R) : (MvPolynomial.monomial (f.sum g)) a = MvPolynomial.C a * f.prod fun a b => (MvPolynomial.monomial (g a b)) 1 - MvPolynomial.induction_on'' 📋 Mathlib.Algebra.MvPolynomial.Basic
{R : Type u} {σ : Type u_1} [CommSemiring R] {motive : MvPolynomial σ R → Prop} (p : MvPolynomial σ R) (C : ∀ (a : R), motive (MvPolynomial.C a)) (monomial_add : ∀ (a : σ →₀ ℕ) (b : R) (f : MvPolynomial σ R), a ∉ f.support → b ≠ 0 → motive f → motive ((MvPolynomial.monomial a) b) → motive ((MvPolynomial.monomial a) b + f)) (mul_X : ∀ (p : MvPolynomial σ R) (n : σ), motive p → motive (p * MvPolynomial.X n)) : motive p - Nat.factorization_eq_zero_of_remainder 📋 Mathlib.Data.Nat.Factorization.Defs
{p r : ℕ} (i : ℕ) (hr : ¬p ∣ r) : (p * i + r).factorization p = 0 - Nat.factorization_eq_zero_iff_remainder 📋 Mathlib.Data.Nat.Factorization.Basic
{p r : ℕ} (i : ℕ) (pp : Nat.Prime p) (hr0 : r ≠ 0) : ¬p ∣ r ↔ (p * i + r).factorization p = 0 - MvPolynomial.linearIndependent_X 📋 Mathlib.RingTheory.MvPolynomial.Basic
(σ : Type u) (R : Type v) [CommSemiring R] : LinearIndependent R MvPolynomial.X - basisOfLinearIndependentOfCardEqFinrank_repr_apply 📋 Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {ι : Type u_1} [Fintype ι] [Nonempty ι] {b : ι → V} (lin_ind : LinearIndependent K b) (card_eq : Fintype.card ι = Module.finrank K V) (x : V) : (basisOfLinearIndependentOfCardEqFinrank lin_ind card_eq).repr x = lin_ind.repr ((LinearMap.codRestrict (Submodule.span K (Set.range b)) LinearMap.id ⋯) x) - basisOfLinearIndependentOfCardEqFinrank'_repr_apply 📋 Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {ι : Type u_1} [Fintype ι] [FiniteDimensional K V] (b : ι → V) (hb : LinearIndependent K b) (hι : Fintype.card ι = Module.finrank K V) (x : V) : (basisOfLinearIndependentOfCardEqFinrank' b hb hι).repr x = hb.repr ((LinearMap.codRestrict (Submodule.span K (Set.range b)) LinearMap.id ⋯) x) - setBasisOfLinearIndependentOfCardEqFinrank_repr_apply 📋 Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {s : Set V} [Nonempty ↑s] [Fintype ↑s] (lin_ind : LinearIndependent K Subtype.val) (card_eq : s.toFinset.card = Module.finrank K V) (x : V) : (setBasisOfLinearIndependentOfCardEqFinrank lin_ind card_eq).repr x = lin_ind.repr ((LinearMap.codRestrict (Submodule.span K (Set.range Subtype.val)) LinearMap.id ⋯) x) - finsetBasisOfLinearIndependentOfCardEqFinrank_repr_apply 📋 Mathlib.LinearAlgebra.FiniteDimensional.Lemmas
{K : Type u} {V : Type v} [DivisionRing K] [AddCommGroup V] [Module K V] {s : Finset V} (hs : s.Nonempty) (lin_ind : LinearIndependent K Subtype.val) (card_eq : s.card = Module.finrank K V) (x : V) : (finsetBasisOfLinearIndependentOfCardEqFinrank hs lin_ind card_eq).repr x = lin_ind.repr ((LinearMap.codRestrict (Submodule.span K (Set.range Subtype.val)) LinearMap.id ⋯) x) - MvPolynomial.bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) : MvPolynomial σ R →+* MvPolynomial σ S - MvPolynomial.bind₂_C_left 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} [CommSemiring R] : MvPolynomial.bind₂ MvPolynomial.C = RingHom.id (MvPolynomial σ R) - MvPolynomial.bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) : MvPolynomial σ R →ₐ[R] MvPolynomial τ R - MvPolynomial.bind₁_id 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} [CommSemiring R] : MvPolynomial.bind₁ id = MvPolynomial.join₁ - MvPolynomial.eval₂Hom_eq_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) : MvPolynomial.eval₂Hom f MvPolynomial.X = MvPolynomial.bind₂ f - MvPolynomial.bind₂_comp_C 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) : (MvPolynomial.bind₂ f).comp MvPolynomial.C = f - MvPolynomial.bind₂_id 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} [CommSemiring R] : MvPolynomial.bind₂ (RingHom.id (MvPolynomial σ R)) = MvPolynomial.join₂ - MvPolynomial.bind₁_X_left 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} [CommSemiring R] : MvPolynomial.bind₁ MvPolynomial.X = AlgHom.id R (MvPolynomial σ R) - MvPolynomial.aeval_eq_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) : MvPolynomial.aeval f = MvPolynomial.bind₁ f - MvPolynomial.bind₂_X_right 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) (i : σ) : (MvPolynomial.bind₂ f) (MvPolynomial.X i) = MvPolynomial.X i - MvPolynomial.eval₂Hom_comp_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : S →+* T) (g : σ → T) (h : R →+* MvPolynomial σ S) : (MvPolynomial.eval₂Hom f g).comp (MvPolynomial.bind₂ h) = MvPolynomial.eval₂Hom ((MvPolynomial.eval₂Hom f g).comp h) g - MvPolynomial.bind₁_X_right 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) (i : σ) : (MvPolynomial.bind₁ f) (MvPolynomial.X i) = f i - MvPolynomial.vars_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] [DecidableEq τ] (f : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : ((MvPolynomial.bind₁ f) φ).vars ⊆ φ.vars.biUnion fun i => (f i).vars - MvPolynomial.bind₁_comp_rename 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : τ → MvPolynomial υ R) (g : σ → τ) : (MvPolynomial.bind₁ f).comp (MvPolynomial.rename g) = MvPolynomial.bind₁ (f ∘ g) - MvPolynomial.mem_vars_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) {j : τ} (h : j ∈ ((MvPolynomial.bind₁ f) φ).vars) : ∃ i ∈ φ.vars, j ∈ (f i).vars - MvPolynomial.bind₂_comp_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : R →+* MvPolynomial σ S) (g : S →+* MvPolynomial σ T) : (MvPolynomial.bind₂ g).comp (MvPolynomial.bind₂ f) = MvPolynomial.bind₂ ((MvPolynomial.bind₂ g).comp f) - MvPolynomial.bind₂_C_right 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) (r : R) : (MvPolynomial.bind₂ f) (MvPolynomial.C r) = f r - MvPolynomial.aeval_comp_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] [Algebra R S] (f : τ → S) (g : σ → MvPolynomial τ R) : (MvPolynomial.aeval f).comp (MvPolynomial.bind₁ g) = MvPolynomial.aeval fun i => (MvPolynomial.aeval f) (g i) - MvPolynomial.bind₁_C_right 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) (x : R) : (MvPolynomial.bind₁ f) (MvPolynomial.C x) = MvPolynomial.C x - MvPolynomial.eval₂Hom_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : S →+* T) (g : σ → T) (h : R →+* MvPolynomial σ S) (φ : MvPolynomial σ R) : (MvPolynomial.eval₂Hom f g) ((MvPolynomial.bind₂ h) φ) = (MvPolynomial.eval₂Hom ((MvPolynomial.eval₂Hom f g).comp h) g) φ - MvPolynomial.bind₂_map 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : S →+* MvPolynomial σ T) (g : R →+* S) (φ : MvPolynomial σ R) : (MvPolynomial.bind₂ f) ((MvPolynomial.map g) φ) = (MvPolynomial.bind₂ (f.comp g)) φ - MvPolynomial.rename_comp_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : σ → MvPolynomial τ R) (g : τ → υ) : (MvPolynomial.rename g).comp (MvPolynomial.bind₁ f) = MvPolynomial.bind₁ fun i => (MvPolynomial.rename g) (f i) - MvPolynomial.bind₁_comp_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : σ → MvPolynomial τ R) (g : τ → MvPolynomial υ R) : (MvPolynomial.bind₁ g).comp (MvPolynomial.bind₁ f) = MvPolynomial.bind₁ fun i => (MvPolynomial.bind₁ g) (f i) - MvPolynomial.map_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : R →+* MvPolynomial σ S) (g : S →+* T) (φ : MvPolynomial σ R) : (MvPolynomial.map g) ((MvPolynomial.bind₂ f) φ) = (MvPolynomial.bind₂ ((MvPolynomial.map g).comp f)) φ - MvPolynomial.eval₂Hom_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* S) (g : τ → S) (h : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : (MvPolynomial.eval₂Hom f g) ((MvPolynomial.bind₁ h) φ) = (MvPolynomial.eval₂Hom f fun i => (MvPolynomial.eval₂Hom f g) (h i)) φ - MvPolynomial.bind₂_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] (f : R →+* MvPolynomial σ S) (g : S →+* MvPolynomial σ T) (φ : MvPolynomial σ R) : (MvPolynomial.bind₂ g) ((MvPolynomial.bind₂ f) φ) = (MvPolynomial.bind₂ ((MvPolynomial.bind₂ g).comp f)) φ - MvPolynomial.bind₂_monomial_one 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) (d : σ →₀ ℕ) : (MvPolynomial.bind₂ f) ((MvPolynomial.monomial d) 1) = (MvPolynomial.monomial d) 1 - MvPolynomial.hom_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : MvPolynomial τ R →+* S) (g : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : f ((MvPolynomial.bind₁ g) φ) = (MvPolynomial.eval₂Hom (f.comp MvPolynomial.C) fun i => f (g i)) φ - MvPolynomial.bind₁_monomial 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) (d : σ →₀ ℕ) (r : R) : (MvPolynomial.bind₁ f) ((MvPolynomial.monomial d) r) = MvPolynomial.C r * ∏ i ∈ d.support, f i ^ d i - MvPolynomial.bind₂_monomial 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* MvPolynomial σ S) (d : σ →₀ ℕ) (r : R) : (MvPolynomial.bind₂ f) ((MvPolynomial.monomial d) r) = f r * (MvPolynomial.monomial d) 1 - MvPolynomial.aeval_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] [Algebra R S] (f : τ → S) (g : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : (MvPolynomial.aeval f) ((MvPolynomial.bind₁ g) φ) = (MvPolynomial.aeval fun i => (MvPolynomial.aeval f) (g i)) φ - MvPolynomial.bind₁_rename 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : τ → MvPolynomial υ R) (g : σ → τ) (φ : MvPolynomial σ R) : (MvPolynomial.bind₁ f) ((MvPolynomial.rename g) φ) = (MvPolynomial.bind₁ (f ∘ g)) φ - MvPolynomial.eval₂Hom_C_eq_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (f : σ → MvPolynomial τ R) : MvPolynomial.eval₂Hom MvPolynomial.C f = ↑(MvPolynomial.bind₁ f) - MvPolynomial.aeval_bind₂ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {R : Type u_3} {S : Type u_4} {T : Type u_5} [CommSemiring R] [CommSemiring S] [CommSemiring T] [Algebra S T] (f : σ → T) (g : R →+* MvPolynomial σ S) (φ : MvPolynomial σ R) : (MvPolynomial.aeval f) ((MvPolynomial.bind₂ g) φ) = (MvPolynomial.eval₂Hom ((↑(MvPolynomial.aeval f)).comp g) f) φ - MvPolynomial.map_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} {S : Type u_4} [CommSemiring R] [CommSemiring S] (f : R →+* S) (g : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : (MvPolynomial.map f) ((MvPolynomial.bind₁ g) φ) = (MvPolynomial.bind₁ fun i => (MvPolynomial.map f) (g i)) ((MvPolynomial.map f) φ) - MvPolynomial.rename_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : σ → MvPolynomial τ R) (g : τ → υ) (φ : MvPolynomial σ R) : (MvPolynomial.rename g) ((MvPolynomial.bind₁ f) φ) = (MvPolynomial.bind₁ fun i => (MvPolynomial.rename g) (f i)) φ - MvPolynomial.bind₁_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Monad
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] {υ : Type u_6} (f : σ → MvPolynomial τ R) (g : τ → MvPolynomial υ R) (φ : MvPolynomial σ R) : (MvPolynomial.bind₁ g) ((MvPolynomial.bind₁ f) φ) = (MvPolynomial.bind₁ fun i => (MvPolynomial.bind₁ g) (f i)) φ - Finsupp.weight_single_index 📋 Mathlib.Data.Finsupp.Weight
{σ : Type u_1} {M : Type u_2} {R : Type u_3} [Semiring R] [AddCommMonoid M] [Module R M] [DecidableEq σ] (s : σ) (c : M) (f : σ →₀ R) : (Finsupp.weight (Pi.single s c)) f = f s • c - MvPolynomial.IsWeightedHomogeneous.induction_on 📋 Mathlib.RingTheory.MvPolynomial.WeightedHomogeneous
{R : Type u_1} {M : Type u_2} [CommSemiring R] {σ : Type u_3} [AddCommMonoid M] {w : σ → M} {m : M} {motive : (p : MvPolynomial σ R) → MvPolynomial.IsWeightedHomogeneous w p m → Prop} (zero : motive 0 ⋯) (add : ∀ (p q : MvPolynomial σ R) (hp : MvPolynomial.IsWeightedHomogeneous w p m) (hq : MvPolynomial.IsWeightedHomogeneous w q m), motive p hp → motive q hq → motive (p + q) ⋯) (monomial : ∀ (d : σ →₀ ℕ) (r : R) (hr : (Finsupp.weight w) d = m), motive ((MvPolynomial.monomial d) r) ⋯) {p : MvPolynomial σ R} (hp : MvPolynomial.IsWeightedHomogeneous w p m) : motive p hp - LinearMap.polyCharpolyAux_basisIndep 📋 Mathlib.Algebra.Module.LinearMap.Polynomial
{R : Type u_1} {L : Type u_2} {M : Type u_3} {ι : Type u_5} {ιM : Type u_7} [CommRing R] [AddCommGroup L] [Module R L] [AddCommGroup M] [Module R M] (φ : L →ₗ[R] Module.End R M) [Fintype ι] [Fintype ιM] [DecidableEq ι] [DecidableEq ιM] (b : Module.Basis ι R L) (bₘ : Module.Basis ιM R M) {ιM' : Type u_8} [Fintype ιM'] [DecidableEq ιM'] (bₘ' : Module.Basis ιM' R M) : φ.polyCharpolyAux b bₘ = φ.polyCharpolyAux b bₘ' - LinearMap.nilRankAux_basis_indep 📋 Mathlib.Algebra.Module.LinearMap.Polynomial
{R : Type u_1} {L : Type u_2} {M : Type u_3} {ι : Type u_5} {ι' : Type u_6} [CommRing R] [AddCommGroup L] [Module R L] [AddCommGroup M] [Module R M] (φ : L →ₗ[R] Module.End R M) [Fintype ι] [Fintype ι'] [DecidableEq ι] [DecidableEq ι'] [Module.Free R M] [Module.Finite R M] [Nontrivial R] (b : Module.Basis ι R L) (b' : Module.Basis ι' R L) : φ.nilRankAux b = (φ.polyCharpoly b').natTrailingDegree - Submodule.LinearDisjoint.linearIndependent_left_of_flat 📋 Mathlib.LinearAlgebra.LinearDisjoint
{R : Type u} {S : Type v} [CommRing R] [Ring S] [Algebra R S] {M N : Submodule R S} (H : M.LinearDisjoint N) [Module.Flat R ↥N] {ι : Type u_1} {m : ι → ↥M} (hm : LinearIndependent R m) : (Submodule.mulLeftMap N m).ker = ⊥ - Submodule.LinearDisjoint.linearIndependent_right_of_flat 📋 Mathlib.LinearAlgebra.LinearDisjoint
{R : Type u} {S : Type v} [CommRing R] [Ring S] [Algebra R S] {M N : Submodule R S} (H : M.LinearDisjoint N) [Module.Flat R ↥M] {ι : Type u_1} {n : ι → ↥N} (hn : LinearIndependent R n) : (M.mulRightMap n).ker = ⊥ - IsDedekindDomain.HeightOneSpectrum.factorization_eq_multiplicity 📋 Mathlib.RingTheory.DedekindDomain.Factorization
{R : Type u_3} [CommRing R] [IsDedekindDomain R] {I : Ideal R} (hI : I ≠ ⊥) (p : IsDedekindDomain.HeightOneSpectrum R) : (factorization I) p.asIdeal = multiplicity p.asIdeal I - MvPolynomial.expand_comp_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Expand
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (p : ℕ) (f : σ → MvPolynomial τ R) : (MvPolynomial.expand p).comp (MvPolynomial.bind₁ f) = MvPolynomial.bind₁ fun i => (MvPolynomial.expand p) (f i) - MvPolynomial.expand_bind₁ 📋 Mathlib.Algebra.MvPolynomial.Expand
{σ : Type u_1} {τ : Type u_2} {R : Type u_3} [CommSemiring R] (p : ℕ) (f : σ → MvPolynomial τ R) (φ : MvPolynomial σ R) : (MvPolynomial.expand p) ((MvPolynomial.bind₁ f) φ) = (MvPolynomial.bind₁ fun i => (MvPolynomial.expand p) (f i)) φ - algebraicIndependent_iff_injective_aeval 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] : AlgebraicIndependent R x ↔ Function.Injective ⇑(MvPolynomial.aeval x) - AlgebraicIndependent.aevalEquiv 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : MvPolynomial ι R ≃ₐ[R] ↥(Algebra.adjoin R (Set.range x)) - AlgebraicIndependent.repr 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : ↥(Algebra.adjoin R (Set.range x)) →ₐ[R] MvPolynomial ι R - AlgebraicIndepOn.aevalEquiv 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] {s : Set ι} (hx : AlgebraicIndepOn R x s) : MvPolynomial (↑s) R ≃ₐ[R] ↥(Algebra.adjoin R (x '' s)) - AlgebraicIndependent.eq_zero_of_aeval_eq_zero 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (h : AlgebraicIndependent R x) (p : MvPolynomial ι R) : (MvPolynomial.aeval x) p = 0 → p = 0 - algebraicIndependent_iff 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] : AlgebraicIndependent R x ↔ ∀ (p : MvPolynomial ι R), (MvPolynomial.aeval x) p = 0 → p = 0 - AlgebraicIndependent.aeval_comp_repr 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : (MvPolynomial.aeval x).comp hx.repr = (Algebra.adjoin R (Set.range x)).val - AlgebraicIndependent.aevalEquiv_apply_coe 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (a✝ : MvPolynomial ι R) : ↑(hx.aevalEquiv a✝) = (MvPolynomial.aeval x) a✝ - AlgebraicIndependent.aeval_repr 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (p : ↥(Algebra.adjoin R (Set.range x))) : (MvPolynomial.aeval x) (hx.repr p) = ↑p - AlgebraicIndependent.algebraMap_aevalEquiv 📋 Mathlib.RingTheory.AlgebraicIndependent.Defs
{ι : Type u_1} {R : Type u_3} {A : Type u_5} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (p : MvPolynomial ι R) : (algebraMap (↥(Algebra.adjoin R (Set.range x))) A) (hx.aevalEquiv p) = (MvPolynomial.aeval x) p - AlgebraicIndependent.aevalEquivField 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) : FractionRing (MvPolynomial ι F) ≃ₐ[F] ↥(IntermediateField.adjoin F (Set.range x)) - AlgebraicIndependent.reprField 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) : ↥(IntermediateField.adjoin F (Set.range x)) →ₐ[F] FractionRing (MvPolynomial ι F) - AlgebraicIndependent.aevalEquivField_apply_coe 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) (a : FractionRing (MvPolynomial ι F)) : ↑(hx.aevalEquivField a) = (IsFractionRing.lift ⋯) a - AlgebraicIndependent.aevalEquivField_algebraMap_apply_coe 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) (a : MvPolynomial ι F) : ↑(hx.aevalEquivField ((algebraMap (MvPolynomial ι F) (FractionRing (MvPolynomial ι F))) a)) = (MvPolynomial.aeval x) a - AlgebraicIndependent.lift_reprField 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) (p : ↥(IntermediateField.adjoin F (Set.range x))) : (IsFractionRing.lift ⋯) (hx.reprField p) = ↑p - AlgebraicIndependent.liftAlgHom_comp_reprField 📋 Mathlib.RingTheory.AlgebraicIndependent.Adjoin
{ι : Type u_1} {F : Type u_2} {E : Type u_3} {x : ι → E} [Field F] [Field E] [Algebra F E] (hx : AlgebraicIndependent F x) : (IsFractionRing.liftAlgHom ⋯).comp hx.reprField = (IntermediateField.adjoin F (Set.range x)).val - MvPolynomial.algebraicIndependent_X 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
(σ : Type u_3) (R : Type u_4) [CommRing R] : AlgebraicIndependent R MvPolynomial.X - AlgebraicIndependent.of_aeval 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] {f : ι → MvPolynomial ι R} (H : AlgebraicIndependent R fun i => (MvPolynomial.aeval x) (f i)) : AlgebraicIndependent R f - AlgebraicIndependent.aeval_of_algebraicIndependent 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) {f : ι → MvPolynomial ι R} (hf : AlgebraicIndependent R f) : AlgebraicIndependent R fun i => (MvPolynomial.aeval x) (f i) - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : MvPolynomial (Option ι) R ≃+* Polynomial ↥(Algebra.adjoin R (Set.range x)) - algebraicIndependent_iff_ker_eq_bot 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] : AlgebraicIndependent R x ↔ RingHom.ker (MvPolynomial.aeval x).toRingHom = ⊥ - algebraicIndependent_subtype 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{R : Type u_2} {A : Type v} [CommRing R] [CommRing A] [Algebra R A] {s : Set A} : AlgebraicIndependent R Subtype.val ↔ ∀ p ∈ MvPolynomial.supported R s, (MvPolynomial.aeval id) p = 0 → p = 0 - algebraicIndependent_comp_subtype 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] {s : Set ι} : AlgebraicIndependent R (x ∘ Subtype.val) ↔ ∀ p ∈ MvPolynomial.supported R s, (MvPolynomial.aeval x) p = 0 → p = 0 - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin_X_none 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : hx.mvPolynomialOptionEquivPolynomialAdjoin (MvPolynomial.X none) = Polynomial.X - AlgebraicIndependent.repr_ker 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) : RingHom.ker ↑hx.repr = ⊥ - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin_X_some 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (i : ι) : hx.mvPolynomialOptionEquivPolynomialAdjoin (MvPolynomial.X (some i)) = Polynomial.C (hx.aevalEquiv (MvPolynomial.X i)) - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin_C 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (r : R) : hx.mvPolynomialOptionEquivPolynomialAdjoin (MvPolynomial.C r) = Polynomial.C ((algebraMap R ↥(Algebra.adjoin R (Set.range x))) r) - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin_C' 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (r : R) : Polynomial.C (hx.aevalEquiv (MvPolynomial.C r)) = Polynomial.C ((algebraMap R ↥(Algebra.adjoin R (Set.range x))) r) - AlgebraicIndependent.mvPolynomialOptionEquivPolynomialAdjoin_apply 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (y : MvPolynomial (Option ι) R) : hx.mvPolynomialOptionEquivPolynomialAdjoin y = Polynomial.map (↑hx.aevalEquiv) ((MvPolynomial.aeval fun o => o.elim Polynomial.X fun s => Polynomial.C (MvPolynomial.X s)) y) - AlgebraicIndependent.aeval_comp_mvPolynomialOptionEquivPolynomialAdjoin 📋 Mathlib.RingTheory.AlgebraicIndependent.Basic
{ι : Type u} {R : Type u_2} {A : Type v} {x : ι → A} [CommRing R] [CommRing A] [Algebra R A] (hx : AlgebraicIndependent R x) (a : A) : (↑(Polynomial.aeval a)).comp hx.mvPolynomialOptionEquivPolynomialAdjoin.toRingHom = ↑(MvPolynomial.aeval fun o => o.elim a x) - MvPolynomial.algebraicIndependent_polynomial_aeval_X 📋 Mathlib.RingTheory.AlgebraicIndependent.Transcendental
{ι : Type u_1} {R : Type u_3} [CommRing R] (f : ι → Polynomial R) (hf : ∀ (i : ι), Transcendental R (f i)) : AlgebraicIndependent R fun i => (Polynomial.aeval (MvPolynomial.X i)) (f i) - Algebra.SubmersivePresentation.linearIndependent_aeval_val_pderiv_relation 📋 Mathlib.RingTheory.Extension.Presentation.Submersive
{R : Type u} {S : Type v} {ι : Type w} {σ : Type t} [CommRing R] [CommRing S] [Algebra R S] [Finite σ] (P : Algebra.SubmersivePresentation R S ι σ) : LinearIndependent S fun i j => (MvPolynomial.aeval P.val) ((MvPolynomial.pderiv (P.map j)) (P.relation i)) - Algebra.PreSubmersivePresentation.jacobiMatrix_reindex 📋 Mathlib.RingTheory.Extension.Presentation.Submersive
{R : Type u} {S : Type v} {ι : Type w} {σ : Type t} [CommRing R] [CommRing S] [Algebra R S] (P : Algebra.PreSubmersivePresentation R S ι σ) {ι' : Type u_1} {σ' : Type u_2} (e : ι' ≃ ι) (f : σ' ≃ σ) [Fintype σ'] [DecidableEq σ'] [Fintype σ] [DecidableEq σ] : (P.reindex e f).jacobiMatrix = ((Matrix.reindex f.symm f.symm) P.jacobiMatrix).map ⇑(MvPolynomial.rename ⇑e.symm) - Algebra.PreSubmersivePresentation.isUnit_jacobian_of_linearIndependent_of_span_eq_top 📋 Mathlib.RingTheory.Extension.Presentation.Submersive
{R : Type u} {S : Type v} {ι : Type w} {σ : Type t} [CommRing R] [CommRing S] [Algebra R S] (P : Algebra.PreSubmersivePresentation R S ι σ) [Finite σ] (hli : LinearIndependent S fun j i => (MvPolynomial.aeval P.val) ((MvPolynomial.pderiv (P.map i)) (P.relation j))) (hsp : Submodule.span S (Set.range fun j i => (MvPolynomial.aeval P.val) ((MvPolynomial.pderiv (P.map i)) (P.relation j))) = ⊤) : IsUnit P.jacobian - MvPolynomial.eval_indicator_apply_eq_one 📋 Mathlib.FieldTheory.Finite.Polynomial
{K : Type u_1} {σ : Type u_2} [Fintype K] [Fintype σ] [CommRing K] (a : σ → K) : (MvPolynomial.eval a) (MvPolynomial.indicator a) = 1 - MvPolynomial.eval_indicator_apply_eq_zero 📋 Mathlib.FieldTheory.Finite.Polynomial
{K : Type u_1} {σ : Type u_2} [Fintype K] [Fintype σ] [Field K] (a b : σ → K) (h : a ≠ b) : (MvPolynomial.eval a) (MvPolynomial.indicator b) = 0
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 a114d38 serving mathlib revision 476fb97