Theorems · Theorem · combinatorics
Fin.sum_univ_succ
∀ {M : Type u_2} [inst : AddCommMonoid M] {n : ℕ} (f : Fin (n + 1) → M), ∑ i, f i = f 0 + ∑ i, f i.succA sum of a function f : Fin (n + 1) → M over all Fin (n + 1) is the sum of
f 0 plus the remaining sum
- Defined in
- Mathlib.Algebra.BigOperators.Fin
- Cited by
- 36 results in Mathlib
- Foundations
- Depth 79 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddCommMonoid
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- AddCommMonoidstatement and proof · cited by 12,281
- Finset.sumstatement · cited by 5,195
- Finset.univstatement · cited by 3,473
- Fin.sum_univ_succAboveproof · cited by 3
Cited by36
Results whose statement or proof uses this declaration.
- Fin.sum_univ_twoproof · cited by 49
- Matrix.det_fin_twoproof · cited by 33
- Orientation.eq_or_eq_neg_of_isEmptyproof · cited by 6
- Matrix.dotProduct_consproof · cited by 5
- hasStrictFDerivAt_list_prod'proof · cited by 4
- Behrend.map_succproof · cited by 3
- Matrix.det_fin_threeproof · cited by 3
- AlgebraicTopology.DoldKan.HigherFacesVanish.comp_Hσ_eq_zeroproof · cited by 3
- Matrix.cons_dotProductproof · cited by 3
- UpperHalfPlane.denom_cocycleproof · cited by 2
- Convexity.dist_convexCombPair_convexCombPair_leproof · cited by 2
- LinearIndependent.finCons'proof · cited by 2