Theorems · Definition · combinatorics
Fin.partialSum
{M : Type u_2} → [AddMonoid M] → {n : ℕ} → (Fin n → M) → Fin (n + 1) → MFor f = (a₁, ..., aₙ) in αⁿ, partialSum f is
(0, a₁, a₁ + a₂, ..., a₁ + ... + aₙ) in αⁿ⁺¹.
- Defined in
- Mathlib.Algebra.BigOperators.Fin
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses no axioms
- Assumes
- AddMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddMonoidstatement and proof · cited by 2,864
Cited by10
Results whose statement or proof uses this declaration.
- Fin.partialSum_succstatement · cited by 6
- Fin.partialSum_zerostatement · cited by 3
- Representation.FiniteCyclicGroup.coinvariantsKer_eq_rangeproof · cited by 1
- Representation.apply_sub_id_partialSum_eqstatement and proof · cited by 1
- Fin.partialSum_initstatement and proof · cited by 1
- Fin.partialSum_right_negstatement and proof · cited by 1
- Fin.neg_partialSum_add_eq_contractNthstatement and proof · cited by 0
- Fin.partialSum_contractNthstatement and proof · cited by 0
- Fin.partialSum_left_negstatement and proof · cited by 0
- Fin.partialSum_succ'statement · cited by 0