Loogle!
Result
Found 151 declarations mentioning Composition.
- Composition π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : Type - Composition.ones π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : Composition n - compositionFintype π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : Fintype (Composition n) - instDecidableEqComposition π Mathlib.Combinatorics.Enumerative.Composition
{nβ : β} : DecidableEq (Composition nβ) - Composition.instInhabited π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : Inhabited (Composition n) - Composition.instToString π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : ToString (Composition n) - Composition.length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : β - Composition.blocks π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (self : Composition n) : List β - Composition.reverse π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : Composition n - Composition.sizeUpTo π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : β) : β - Composition.toCompositionAsSet π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : CompositionAsSet n - CompositionAsSet.toComposition π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : CompositionAsSet n) : Composition n - compositionEquiv π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : Composition n β CompositionAsSet n - Composition.reverse_involutive π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : Function.Involutive Composition.reverse - Composition.blocksFun π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : Fin c.length β β - Composition.reverse_bijective π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : Function.Bijective Composition.reverse - Composition.reverse_injective π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : Function.Injective Composition.reverse - Composition.reverse_surjective π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : Function.Surjective Composition.reverse - Composition.index π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : Fin c.length - List.splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {Ξ± : Type u_1} (l : List Ξ±) (c : Composition n) : List (List Ξ±) - Composition.cast π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (c : Composition m) (hmn : m = n) : Composition n - Composition.length_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.length β€ n - Composition.reverse_ones π Mathlib.Combinatorics.Enumerative.Composition
{n : β} : (Composition.ones n).reverse = Composition.ones n - Composition.monotone_sizeUpTo π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : Monotone c.sizeUpTo - instDecidableEqComposition.decEq π Mathlib.Combinatorics.Enumerative.Composition
{nβ : β} (xβ xβΒΉ : Composition nβ) : Decidable (xβ = xβΒΉ) - Composition.reverse_reverse π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.reverse.reverse = c - Composition.single π Mathlib.Combinatorics.Enumerative.Composition
(n : β) (h : 0 < n) : Composition n - Composition.sizeUpTo_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : β) : c.sizeUpTo i β€ n - Composition.sizeUpTo_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.sizeUpTo c.length = n - Composition.blocks_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.blocks.length = c.length - Composition.invEmbedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : Fin (c.blocksFun (c.index j)) - Composition.toCompositionAsSet_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.toCompositionAsSet.length = c.length - Composition.cast_rfl π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.cast β― = c - Composition.toCompositionAsSet_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.toCompositionAsSet.blocks = c.blocks - Composition.blocksFun_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) : c.blocksFun i β€ n - Composition.blocks_sum π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (self : Composition n) : self.blocks.sum = n - Composition.append π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (cβ : Composition m) (cβ : Composition n) : Composition (m + n) - Composition.eq_ones_iff_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {c : Composition n} : c = Composition.ones n β c.length = n - Composition.reverse_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.reverse.blocks = c.blocks.reverse - Composition.toCompositionAsSet_boundaries π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.toCompositionAsSet.boundaries = c.boundaries - Composition.eq_ones_iff_le_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {c : Composition n} : c = Composition.ones n β n β€ c.length - Composition.ofFn_blocksFun π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : List.ofFn c.blocksFun = c.blocks - Composition.boundaries π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : Finset (Fin (n + 1)) - Composition.reverse_eq_ones π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {c : Composition n} : c.reverse = Composition.ones n β c = Composition.ones n - Composition.sizeUpTo_ofLength_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : β) (h : c.length β€ i) : c.sizeUpTo i = n - Composition.sizeUpTo_zero π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.sizeUpTo 0 = 0 - Composition.blocks_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {i : β} (h : i β c.blocks) : i β€ n - Composition.cast_heq π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (c : Composition m) (hmn : m = n) : c.cast hmn β c - Composition.ext π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {x y : Composition n} (blocks : x.blocks = y.blocks) : x = y - Composition.one_le_blocksFun π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) : 1 β€ c.blocksFun i - List.length_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {Ξ± : Type u_1} (l : List Ξ±) (c : Composition n) : (l.splitWrtComposition c).length = c.length - Composition.blocksFinEquiv π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : (i : Fin c.length) Γ Fin (c.blocksFun i) β Fin n - Composition.blocksFun_mem_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) : c.blocksFun i β c.blocks - Composition.blocks_eq_nil π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.blocks = [] β n = 0 - Composition.ext_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {x y : Composition n} : x = y β x.blocks = y.blocks - Composition.reverse_inj π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {cβ cβ : Composition n} : cβ.reverse = cβ.reverse β cβ = cβ - List.flatten_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{Ξ± : Type u_1} (l : List Ξ±) (c : Composition l.length) : (l.splitWrtComposition c).flatten = l - Composition.cast_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (c : Composition m) (hmn : m = n) : (c.cast hmn).blocks = c.blocks - Composition.reverse_single π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (hn : 0 < n) : (Composition.single n hn).reverse = Composition.single n hn - Composition.embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) : Fin (c.blocksFun i) βͺo Fin n - Composition.length_eq_zero π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.length = 0 β n = 0 - Composition.sizeUpTo_index_le π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : c.sizeUpTo β(c.index j) β€ βj - Composition.blocks_pos π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (self : Composition n) {i : β} : i β self.blocks β 0 < i - Composition.length_pos_of_pos π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : 0 < n β 0 < c.length - Composition.one_le_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {i : β} (h : i β c.blocks) : 1 β€ i - Composition.length_pos_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : 0 < c.length β 0 < n - List.map_length_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{Ξ± : Type u_1} (l : List Ξ±) (c : Composition l.length) : List.map List.length (l.splitWrtComposition c) = c.blocks - Composition.eq_ones_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {c : Composition n} : c = Composition.ones n β β i β c.blocks, i = 1 - Composition.reverse_eq_single π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {hn : 0 < n} {c : Composition n} : c.reverse = Composition.single n hn β c = Composition.single n hn - Composition.eq_single_iff_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (h : 0 < n) {c : Composition n} : c = Composition.single n h β c.length = 1 - Composition.sum_blocksFun π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : β i, c.blocksFun i = n - Composition.ne_single_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (hn : 0 < n) {c : Composition n} : c β Composition.single n hn β β (i : Fin c.length), c.blocksFun i < n - Composition.mk π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (blocks : List β) (blocks_pos : β {i : β}, i β blocks β 0 < i) (blocks_sum : blocks.sum = n) : Composition n - Composition.ne_ones_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {c : Composition n} : c β Composition.ones n β β i β c.blocks, 1 < i - Composition.sizeUpTo_strict_mono π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {i : β} (h : i < c.length) : c.sizeUpTo i < c.sizeUpTo (i + 1) - List.length_pos_of_mem_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{Ξ± : Type u_1} {l l' : List Ξ±} {c : Composition l.length} (h : l' β l.splitWrtComposition c) : 0 < l'.length - composition_card π Mathlib.Combinatorics.Enumerative.Composition
(n : β) : Fintype.card (Composition n) = 2 ^ (n - 1) - Composition.card_boundaries_eq_succ_length π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.boundaries.card = c.length + 1 - Composition.lt_sizeUpTo_index_succ π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : βj < c.sizeUpTo β(c.index j).succ - List.sum_take_map_length_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{Ξ± : Type u_1} (l : List Ξ±) (c : Composition l.length) (i : β) : (List.take i (List.map List.length (l.splitWrtComposition c))).sum = c.sizeUpTo i - Composition.coe_invEmbedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : β(c.invEmbedding j) = βj - c.sizeUpTo β(c.index j) - Composition.index_exists π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {j : β} (h : j < n) : β i, j < c.sizeUpTo (i + 1) β§ i < c.length - Composition.blocks_pos' π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : β) (h : i < c.length) : 0 < c.blocks[i] - Composition.one_le_blocks' π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {i : β} (h : i < c.length) : 1 β€ c.blocks[i] - Composition.append_blocks π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (cβ : Composition m) (cβ : Composition n) : (cβ.append cβ).blocks = cβ.blocks ++ cβ.blocks - Composition.cast_eq_cast π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (c : Composition m) (hmn : m = n) : c.cast hmn = cast β― c - List.splitWrtComposition_flatten π Mathlib.Combinatorics.Enumerative.Composition
{Ξ± : Type u_1} (L : List (List Ξ±)) (c : Composition L.flatten.length) (h : List.map List.length L = c.blocks) : L.flatten.splitWrtComposition c = L - Composition.sigma_eq_iff_blocks_eq π Mathlib.Combinatorics.Enumerative.Composition
{c c' : (n : β) Γ Composition n} : c = c' β c.snd.blocks = c'.snd.blocks - Composition.sizeUpTo_succ' π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) : c.sizeUpTo (βi + 1) = c.sizeUpTo βi + c.blocksFun i - Composition.blocksFun_congr π Mathlib.Combinatorics.Enumerative.Composition
{nβ nβ : β} (cβ : Composition nβ) (cβ : Composition nβ) (iβ : Fin cβ.length) (iβ : Fin cβ.length) (hn : nβ = nβ) (hc : cβ.blocks = cβ.blocks) (hi : βiβ = βiβ) : cβ.blocksFun iβ = cβ.blocksFun iβ - Composition.sizeUpTo_succ π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {i : β} (h : i < c.length) : c.sizeUpTo (i + 1) = c.sizeUpTo i + c.blocks[i] - Composition.boundary π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : Fin (c.length + 1) βͺo Fin (n + 1) - Composition.index_embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) (j : Fin (c.blocksFun i)) : c.index ((c.embedding i) j) = i - Composition.reverse_append π Mathlib.Combinatorics.Enumerative.Composition
{n m : β} (cβ : Composition m) (cβ : Composition n) : (cβ.append cβ).reverse = (cβ.reverse.append cβ.reverse).cast β― - List.getElem_splitWrtComposition π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {Ξ± : Type u_1} (l : List Ξ±) (c : Composition n) (i : β) (h : i < (l.splitWrtComposition c).length) : (l.splitWrtComposition c)[i] = List.drop (c.sizeUpTo i) (List.take (c.sizeUpTo (i + 1)) l) - List.getElem_splitWrtComposition' π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {Ξ± : Type u_1} (l : List Ξ±) (c : Composition n) {i : β} (hi : i < (l.splitWrtComposition c).length) : (l.splitWrtComposition c)[i] = List.drop (c.sizeUpTo i) (List.take (c.sizeUpTo (i + 1)) l) - Composition.embedding_comp_inv π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : (c.embedding (c.index j)) (c.invEmbedding j) = j - Composition.recOnAppendSingle π Mathlib.Combinatorics.Enumerative.Composition
{motive : (n : β) β Composition n β Sort u_1} {n : β} (c : Composition n) (zero : motive 0 (Composition.ones 0)) (append_single : (k n : β) β (c : Composition n) β motive n c β motive (n + (k + 1)) (c.append (Composition.single (k + 1) β―))) : motive n c - Composition.recOnSingleAppend π Mathlib.Combinatorics.Enumerative.Composition
{motive : (n : β) β Composition n β Sort u_1} {n : β} (c : Composition n) (zero : motive 0 (Composition.ones 0)) (single_append : (k n : β) β (c : Composition n) β motive n c β motive (k + 1 + n) ((Composition.single (k + 1) β―).append c)) : motive n c - Composition.coe_embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) (j : Fin (c.blocksFun i)) : β((c.embedding i) j) = c.sizeUpTo βi + βj - Composition.mem_range_embedding_iff' π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {j : Fin n} {i : Fin c.length} : j β Set.range β(c.embedding i) β i = c.index j - Composition.mem_range_embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (j : Fin n) : j β Set.range β(c.embedding (c.index j)) - Composition.mem_range_embedding_iff π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {j : Fin n} {i : Fin c.length} : j β Set.range β(c.embedding i) β c.sizeUpTo βi β€ βj β§ βj < c.sizeUpTo (βi).succ - Composition.prod_prod_apply_embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {A : Type u_1} [CommMonoid A] (a : Fin n β A) (x : Composition n) : β i, β j, a ((x.embedding i) j) = β i, a i - Composition.sum_sum_apply_embedding π Mathlib.Combinatorics.Enumerative.Composition
{n : β} {A : Type u_1} [AddCommMonoid A] (a : Fin n β A) (x : Composition n) : β i, β j, a ((x.embedding i) j) = β i, a i - Composition.invEmbedding_comp π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) (i : Fin c.length) (j : Fin (c.blocksFun i)) : β(c.invEmbedding ((c.embedding i) j)) = βj - Composition.disjoint_range π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) {iβ iβ : Fin c.length} (h : iβ β iβ) : Disjoint (Set.range β(c.embedding iβ)) (Set.range β(c.embedding iβ)) - Composition.boundary_last π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.boundary (Fin.last c.length) = Fin.last n - Composition.orderEmbOfFin_boundaries π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.boundaries.orderEmbOfFin β― = c.boundary - Composition.boundary_zero π Mathlib.Combinatorics.Enumerative.Composition
{n : β} (c : Composition n) : c.boundary 0 = 0 - Nat.Partition.ofComposition π Mathlib.Combinatorics.Enumerative.Partition.Basic
(n : β) (c : Composition n) : n.Partition - Nat.Partition.ofComposition_surj π Mathlib.Combinatorics.Enumerative.Partition.Basic
{n : β} : Function.Surjective (Nat.Partition.ofComposition n) - Nat.Partition.ofComposition_parts π Mathlib.Combinatorics.Enumerative.Partition.Basic
(n : β) (c : Composition n) : (Nat.Partition.ofComposition n c).parts = βc.blocks - Composition.gather π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) : Composition n - FormalMultilinearSeries.compPartialSumTarget π Mathlib.Analysis.Analytic.Composition
(m M N : β) : Finset ((n : β) Γ Composition n) - FormalMultilinearSeries.compPartialSumTargetSet π Mathlib.Analysis.Analytic.Composition
(m M N : β) : Set ((n : β) Γ Composition n) - Composition.length_gather π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) : (a.gather b).length = b.length - Composition.sigmaCompositionAux π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) (i : Fin (a.gather b).length) : Composition ((a.gather b).blocksFun i) - Composition.sigmaEquivSigmaPi π Mathlib.Analysis.Analytic.Composition
(n : β) : (a : Composition n) Γ Composition a.length β (c : Composition n) Γ ((i : Fin c.length) β Composition (c.blocksFun i)) - FormalMultilinearSeries.compPartialSumTarget_tendsto_atTop π Mathlib.Analysis.Analytic.Composition
: Filter.Tendsto (fun N => FormalMultilinearSeries.compPartialSumTarget 0 N N) Filter.atTop Filter.atTop - FormalMultilinearSeries.compChangeOfVariables π Mathlib.Analysis.Analytic.Composition
(m M N : β) (i : (n : β) Γ (Fin n β β)) (hi : i β FormalMultilinearSeries.compPartialSumSource m M N) : (n : β) Γ Composition n - FormalMultilinearSeries.compPartialSumTarget_tendsto_prod_atTop π Mathlib.Analysis.Analytic.Composition
: Filter.Tendsto (fun p => FormalMultilinearSeries.compPartialSumTarget 0 p.1 p.2) Filter.atTop Filter.atTop - FormalMultilinearSeries.compChangeOfVariables_length π Mathlib.Analysis.Analytic.Composition
(m M N : β) {i : (n : β) Γ (Fin n β β)} (hi : i β FormalMultilinearSeries.compPartialSumSource m M N) : (FormalMultilinearSeries.compChangeOfVariables m M N i hi).snd.length = i.fst - Composition.sigma_composition_eq_iff π Mathlib.Analysis.Analytic.Composition
{n : β} (i j : (a : Composition n) Γ Composition a.length) : i = j β i.fst.blocks = j.fst.blocks β§ i.snd.blocks = j.snd.blocks - FormalMultilinearSeries.mem_compPartialSumTarget_iff π Mathlib.Analysis.Analytic.Composition
{m M N : β} {a : (n : β) Γ Composition n} : a β FormalMultilinearSeries.compPartialSumTarget m M N β m β€ a.snd.length β§ a.snd.length < M β§ β (j : Fin a.snd.length), a.snd.blocksFun j < N - FormalMultilinearSeries.compChangeOfVariables_sum π Mathlib.Analysis.Analytic.Composition
{Ξ± : Type u_6} [AddCommMonoid Ξ±] (m M N : β) (f : (n : β) Γ (Fin n β β) β Ξ±) (g : (n : β) Γ Composition n β Ξ±) (h : β (e : (n : β) Γ (Fin n β β)) (he : e β FormalMultilinearSeries.compPartialSumSource m M N), f e = g (FormalMultilinearSeries.compChangeOfVariables m M N e he)) : β e β FormalMultilinearSeries.compPartialSumSource m M N, f e = β e β FormalMultilinearSeries.compPartialSumTarget m M N, g e - FormalMultilinearSeries.compPartialSumTargetSet_image_compPartialSumSource π Mathlib.Analysis.Analytic.Composition
(m M N : β) (i : (n : β) Γ Composition n) (hi : i β FormalMultilinearSeries.compPartialSumTargetSet m M N) : β j, β (hj : j β FormalMultilinearSeries.compPartialSumSource m M N), FormalMultilinearSeries.compChangeOfVariables m M N j hj = i - Composition.length_sigmaCompositionAux π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) (i : Fin b.length) : (a.sigmaCompositionAux b β¨βi, β―β©).length = b.blocksFun i - Composition.sizeUpTo_sizeUpTo_add π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) {i j : β} (hi : i < b.length) (hj : j < b.blocksFun β¨i, hiβ©) : a.sizeUpTo (b.sizeUpTo i + j) = (a.gather b).sizeUpTo i + (a.sigmaCompositionAux b β¨i, β―β©).sizeUpTo j - Composition.sigma_pi_composition_eq_iff π Mathlib.Analysis.Analytic.Composition
{n : β} (u v : (c : Composition n) Γ ((i : Fin c.length) β Composition (c.blocksFun i))) : u = v β (List.ofFn fun i => (u.snd i).blocks) = List.ofFn fun i => (v.snd i).blocks - FormalMultilinearSeries.applyComposition π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [CommRing π] [AddCommGroup E] [AddCommGroup F] [Module π E] [Module π F] [TopologicalSpace E] [TopologicalSpace F] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] (p : FormalMultilinearSeries π E F) {n : β} (c : Composition n) : (Fin n β E) β Fin c.length β F - FormalMultilinearSeries.compChangeOfVariables_blocksFun π Mathlib.Analysis.Analytic.Composition
(m M N : β) {i : (n : β) Γ (Fin n β β)} (hi : i β FormalMultilinearSeries.compPartialSumSource m M N) (j : Fin i.fst) : (FormalMultilinearSeries.compChangeOfVariables m M N i hi).snd.blocksFun β¨βj, β―β© = i.snd j - FormalMultilinearSeries.removeZero_applyComposition π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [CommRing π] [AddCommGroup E] [AddCommGroup F] [Module π E] [Module π F] [TopologicalSpace E] [TopologicalSpace F] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] (p : FormalMultilinearSeries π E F) {n : β} (c : Composition n) : p.removeZero.applyComposition c = p.applyComposition c - ContinuousMultilinearMap.compAlongComposition π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] {n : β} (p : FormalMultilinearSeries π E F) (c : Composition n) (f : F [Γc.length]βL[π] G) : E [Γn]βL[π] G - FormalMultilinearSeries.compAlongComposition π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] [IsTopologicalAddGroup G] [ContinuousConstSMul π G] {n : β} (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (c : Composition n) : E [Γn]βL[π] G - ContinuousMultilinearMap.compAlongComposition_apply π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] {n : β} (p : FormalMultilinearSeries π E F) (c : Composition n) (f : F [Γc.length]βL[π] G) (v : Fin n β E) : (ContinuousMultilinearMap.compAlongComposition p c f) v = f (p.applyComposition c v) - FormalMultilinearSeries.compContinuousLinearMap_applyComposition π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] [IsTopologicalAddGroup G] [ContinuousConstSMul π G] {n : β} (p : FormalMultilinearSeries π F G) (f : E βL[π] F) (c : Composition n) (v : Fin n β E) : (p.compContinuousLinearMap f).applyComposition c v = p.applyComposition c (βf β v) - FormalMultilinearSeries.applyComposition_apply_prod π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} [CommRing π] [AddCommGroup E] [Module π E] [TopologicalSpace E] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] {H : Type u_6} [CommRing H] [Algebra π H] [TopologicalSpace H] [IsTopologicalRing H] [ContinuousConstSMul π H] (p : FormalMultilinearSeries π E H) {n : β} (c : Composition n) (v : Fin n β E) : β i, p.applyComposition c v i = β i, (p (c.blocksFun i)) (v β β(c.embedding i)) - FormalMultilinearSeries.compAlongComposition_apply π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [CommRing π] [AddCommGroup E] [AddCommGroup F] [AddCommGroup G] [Module π E] [Module π F] [Module π G] [TopologicalSpace E] [TopologicalSpace F] [TopologicalSpace G] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] [IsTopologicalAddGroup G] [ContinuousConstSMul π G] {n : β} (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (c : Composition n) (v : Fin n β E) : (q.compAlongComposition p c) v = (q c.length) (p.applyComposition c v) - FormalMultilinearSeries.applyComposition_update π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} [CommRing π] [AddCommGroup E] [AddCommGroup F] [Module π E] [Module π F] [TopologicalSpace E] [TopologicalSpace F] [IsTopologicalAddGroup E] [ContinuousConstSMul π E] [IsTopologicalAddGroup F] [ContinuousConstSMul π F] (p : FormalMultilinearSeries π E F) {n : β} (c : Composition n) (j : Fin n) (v : Fin n β E) (z : E) : p.applyComposition c (Function.update v j z) = Function.update (p.applyComposition c v) (c.index j) ((p (c.blocksFun (c.index j))) (Function.update (v β β(c.embedding (c.index j))) (c.invEmbedding j) z)) - Composition.blocksFun_sigmaCompositionAux π Mathlib.Analysis.Analytic.Composition
{n : β} (a : Composition n) (b : Composition a.length) (i : Fin b.length) (j : Fin (b.blocksFun i)) : (a.sigmaCompositionAux b β¨βi, β―β©).blocksFun β¨βj, β―β© = a.blocksFun ((b.embedding i) j) - FormalMultilinearSeries.compAlongComposition_bound π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] {n : β} (p : FormalMultilinearSeries π E F) (c : Composition n) (f : F [Γc.length]βL[π] G) (v : Fin n β E) : β(ContinuousMultilinearMap.compAlongComposition p c f) vβ β€ (βfβ * β i, βp (c.blocksFun i)β) * β i, βv iβ - FormalMultilinearSeries.compAlongComposition_norm π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] {n : β} (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (c : Composition n) : βq.compAlongComposition p cβ β€ βq c.lengthβ * β i, βp (c.blocksFun i)β - FormalMultilinearSeries.comp_summable_nnreal π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (hq : 0 < q.radius) (hp : 0 < p.radius) : β r > 0, Summable fun i => βq.compAlongComposition p i.sndββ * r ^ i.fst - FormalMultilinearSeries.compAlongComposition_nnnorm π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] {n : β} (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (c : Composition n) : βq.compAlongComposition p cββ β€ βq c.lengthββ * β i, βp (c.blocksFun i)ββ - FormalMultilinearSeries.comp_partialSum π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (M N : β) (z : E) : q.partialSum M (β i β Finset.Ico 1 N, (p i) fun _j => z) = β i β FormalMultilinearSeries.compPartialSumTarget 0 M N, (q.compAlongComposition p i.snd) fun _j => z - FormalMultilinearSeries.le_comp_radius_of_summable π Mathlib.Analysis.Analytic.Composition
{π : Type u_1} {E : Type u_2} {F : Type u_3} {G : Type u_4} [NontriviallyNormedField π] [NormedAddCommGroup E] [NormedSpace π E] [NormedAddCommGroup F] [NormedSpace π F] [NormedAddCommGroup G] [NormedSpace π G] (q : FormalMultilinearSeries π F G) (p : FormalMultilinearSeries π E F) (r : NNReal) (hr : Summable fun i => βq.compAlongComposition p i.sndββ * r ^ i.fst) : βr β€ (q.comp p).radius - FormalMultilinearSeries.radius_right_inv_pos_of_radius_pos_aux1 π Mathlib.Analysis.Analytic.Inverse
(n : β) (p : β β β) (hp : β (k : β), 0 β€ p k) {r a : β} (hr : 0 β€ r) (ha : 0 β€ a) : β k β Finset.Ico 2 (n + 1), a ^ k * β c β {c | 1 < c.length}.toFinset, r ^ c.length * β j, p (c.blocksFun j) β€ β j β Finset.Ico 2 (n + 1), r ^ j * (β k β Finset.Ico 1 n, a ^ k * p k) ^ j - FormalMultilinearSeries.rightInv_coeff π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) (n : β) (hn : 2 β€ n) : p.rightInv i x n = -(βi.symm).compContinuousMultilinearMap (β c β {c | 1 < c.length}.toFinset, p.compAlongComposition (p.rightInv i x) c) - FormalMultilinearSeries.comp_rightInv_aux1 π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] {n : β} (hn : 0 < n) (p : FormalMultilinearSeries π E F) (q : FormalMultilinearSeries π F E) (v : Fin n β F) : (p.comp q n) v = β c β {c | 1 < c.length}.toFinset, (p c.length) (q.applyComposition c v) + (p 1) fun x => (q n) v - FormalMultilinearSeries.comp_rightInv_aux2 π Mathlib.Analysis.Analytic.Inverse
{π : Type u_1} [NontriviallyNormedField π] {E : Type u_2} [NormedAddCommGroup E] [NormedSpace π E] {F : Type u_3} [NormedAddCommGroup F] [NormedSpace π F] (p : FormalMultilinearSeries π E F) (i : E βL[π] F) (x : E) (n : β) (v : Fin (n + 2) β F) : β c β {c | 1 < c.length}.toFinset, (p c.length) (FormalMultilinearSeries.applyComposition (fun k => if k < n + 2 then p.rightInv i x k else 0) c v) = β c β {c | 1 < c.length}.toFinset, (p c.length) ((p.rightInv i x).applyComposition c v)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c