Theorems · Theorem · several complex variables
Composition.sizeUpTo_sizeUpTo_add
∀ {n : ℕ} (a : Composition n) (b : Composition a.length) {i j : ℕ} (hi : i < b.length),
j < b.blocksFun ⟨i, hi⟩ →
a.sizeUpTo (b.sizeUpTo i + j) = (a.gather b).sizeUpTo i + (a.sigmaCompositionAux b ⟨i, ⋯⟩).sizeUpTo jAuxiliary lemma to prove that the composition of formal multilinear series is associative.
Consider a composition a of n and a composition b of a.length. Grouping together some
blocks of a according to b as in a.gather b, one can compute the total size of the blocks
of a up to an index sizeUpTo b i + j (where the j corresponds to a set of blocks of a
that do not fill a whole block of a.gather b). The first part corresponds to a sum of blocks
in a.gather b, and the second one to a sum of blocks in the next block of
sigmaCompositionAux a b. This is the content of this lemma.
- Defined in
- Mathlib.Analysis.Analytic.Composition
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 77 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites22
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- add_assocproof · cited by 746
- lt_of_lt_of_leproof · cited by 438
- lt_transproof · cited by 165
- Compositionstatement and proof · cited by 138
- lt_add_oneproof · cited by 105
- Composition.lengthstatement and proof · cited by 92
- min_eq_leftproof · cited by 67
- Composition.blocksFunstatement and proof · cited by 52
- Composition.blocksproof · cited by 49
- Composition.sizeUpTostatement and proof · cited by 26
- List.splitWrtCompositionproof · cited by 12
- List.sum_take_succproof · cited by 6
Cited by1
Results whose statement or proof uses this declaration.
- FormalMultilinearSeries.comp_assocproof · cited by 1