Fact-checked by Grok 2 weeks ago

Empty sum

In mathematics, the empty sum, also known as the nullary sum, refers to the summation of zero terms or an empty collection of addends, which is conventionally defined to equal zero.^[1] This convention arises because zero serves as the additive identity element, ensuring that the sum remains unchanged when no elements are added, analogous to how the empty product is defined as one, the multiplicative identity.^[2] The empty sum plays a crucial role in extending summation notation to handle cases where the index set is empty, such as when the upper limit of a sigma summation is less than the lower limit (e.g., \sum_{k=2}^{1} f(k) = 0) or when summing over an empty set (e.g., \sum_{x \in \emptyset} x^2 = 0).^[3]^[4] This definition prevents the need for special cases in mathematical proofs, recursive formulas, and algorithms, promoting consistency across algebraic structures and set theory.^[1] For instance, in telescoping series or interval sums, empty intervals are assigned a sum of zero to maintain closure under addition without exceptions.^[5]^[6] By establishing this neutral value, the empty sum facilitates broader applications in combinatorics, linear algebra, and computational mathematics, where variable-sized collections are common.^[2]

Definition and Motivation

Formal Definition

The empty sum, often denoted as \sum_{i \in \emptyset} a_i, is the summation over an empty index set and is formally defined to equal the additive identity element 0 of the underlying algebraic structure, such as the real numbers \mathbb{R} or integers \mathbb{Z}. This convention ensures consistency in summation formulas by treating the absence of terms as the neutral element for addition. The index set \emptyset contains no elements, so the summation includes no addends, resulting directly in the value 0, analogous to how the empty product yields the multiplicative identity 1. In standard indexed summation notation, this manifests as cases where the upper limit is less than or equal to the lower limit minus one, such as \sum_{k=1}^{0} a_k = [0](/page/0), regardless of the specific terms a_k.^[7] This definition extends to more general settings in abstract algebra. In rings or abelian groups, the empty sum is the zero element (additive identity), denoted $0 or e when emphasizing the identity, preserving the structure's operations even without summands. For instance, in a vector space, the empty linear combination sums to the zero vector.^[8]^[9]

Rationale from Summation Conventions

The convention for the empty sum arises naturally from standard practices in finite summation notation. Consider the general sum \sum_{k=m}^{n} a_k; when m > n, there are no terms to add, resulting in an empty sum. This case is defined to equal 0 to preserve the consistency of summation formulas, such as those for arithmetic or geometric series, without requiring separate handling for boundary conditions.^[2] This definition also ensures consistency in fundamental mathematical identities, particularly those proven by induction. For example, in verifying the formula for the sum of the first n positive integers, \sum_{i=1}^{n} i = \frac{n(n+1)}{2}, the base case n=0 involves an empty sum on the left side, which equals 0, matching the right side \frac{0 \cdot 1}{2} = 0. Without this convention, the inductive step—from the sum to n plus the (n+1)-th term equaling the sum to n+1—would fail at the boundary, complicating proofs across algebra and discrete mathematics.^[10] By setting the empty sum to 0, mathematicians avoid introducing special cases like "provided n \geq 1" in numerous theorems from calculus, algebra, and beyond. This aligns with 0 being the additive identity, ensuring that rules such as \sum_{i \in A} f(i) + \sum_{i \in B} f(i) = \sum_{i \in A \cup B} f(i) hold universally, even when A or B is empty, thereby simplifying notation and enhancing the generality of expressions in rigorous analysis.^[2]

Properties

Algebraic Properties

The empty sum, denoted \sum_{i \in \emptyset} a_i or simply \sum_{\emptyset}, is defined to be the additive identity element $0 of the underlying abelian group G in which the summands a_i reside. This convention ensures that the empty sum acts as both a left and right identity for addition with any finite sum: \sum_{\emptyset} + \sum_{i \in I} a_i = \sum_{i \in I} a_i and \sum_{i \in I} a_i + \sum_{\emptyset} = \sum_{i \in I} a_i, for any finite non-empty index set I \subseteq \mathbb{N} and a_i \in G.^[11]^[12] This identity property extends to additivity when combining the empty sum with non-empty sums. Specifically, if A and B are disjoint finite index sets with A = \emptyset, then the sum over their union simplifies as \sum_{i \in A \cup B} a_i = \sum_{i \in A} a_i + \sum_{i \in B} a_i = 0 + \sum_{i \in B} a_i = \sum_{i \in B} a_i, preserving the structure of the non-empty sum. The proof follows directly from the disjoint union of index sets: since A = \emptyset, no additional terms are introduced, and the summation reduces to the original non-empty portion by the additivity axiom for disjoint families.^[11] The empty sum also maintains associativity in chained summations without disruption. For disjoint finite index sets A and B, the expression (\sum_{\emptyset} + \sum_{i \in A} a_i) + \sum_{i \in B} a_i = (\sum_{i \in A} a_i) + \sum_{i \in B} a_i = \sum_{i \in A \cup B} a_i, which aligns with the direct sum over the combined index set. This compatibility ensures that inserting an empty sum into associative groupings yields consistent results, as required by the prefix and insertive associativity axioms for summable families.^[11] In the context of an abelian group (G, +), a detailed derivation confirms the empty sum's behavior: define \sum_{\emptyset} = 0_G, the unique element satisfying $0_G + x = x for all x \in G. For any summand x \in G, the equation \sum_{\emptyset} \oplus x = 0_G + x = x holds by the group identity axiom, where \oplus denotes the group operation (addition). This follows from the empty index set contributing no terms, reducing to the identity operation on x.^[11]^[12] Within integral domains, which possess an underlying additive abelian group structure, the empty sum $0 is the unique element fulfilling these identity, additivity, and associativity properties for summation. The uniqueness of the additive identity in any group guarantees that no other element can serve equivalently, as supposing another e' \neq 0 with e' + x = x for all x leads to a contradiction via the group axioms: e' = e' + 0 = e'.^[13]^[11]

Relation to Empty Product and Other Empty Operations

The empty sum is defined to equal 0, the additive identity in the real numbers, while the empty product is defined to equal 1, the multiplicative identity; this analogy ensures consistency across algebraic identities, such as the distributive law holding vacuously for empty cases.^[14]^[15] In the broader context of abstract algebra, these definitions generalize to monoids, where the result of an empty operation yields the monoid's identity element; for the additive monoid of real numbers, this is 0 for the empty sum, and for the multiplicative monoid, it is 1 for the empty product.^[16]^[14] Semigroups lack an identity, but the monoid extension provides a unified framework for nullary operations in algebraic structures.^[15] This duality between sum and product extends to other empty operations in lattice theory, such as the empty union yielding the empty set (the bottom element) and the empty intersection yielding the universal set (the top element), though the primary focus remains on the additive-multiplicative contrast.^[16]^[17] For instance, the relation between products and sums via logarithms illustrates the consistency:

\log\left( \prod_{i \in \emptyset} a_i \right) = \sum_{i \in \emptyset} \log a_i = [0](/page/0),

implying \prod_{i \in \emptyset} a_i = e^[0](/page/0) = [1](/page/1) for positive real a_i, in contrast to the empty sum directly equaling 0.^[1] These conventions preserve the structure of free algebras by maintaining recursive identities without exceptions and avoid inconsistencies like division by zero in derived formulas; for example, defining $0! = 1 as the empty product ensures the factorial recursion n! = n \cdot (n-1)! holds at n=0 without requiring division.^[18]^[1]

Applications

In Combinatorics and Generating Functions

In combinatorics, the empty sum convention facilitates the extension of the binomial theorem to its base case, ensuring consistency across all non-negative integer exponents. The binomial theorem asserts that

(1 + x)^n = \sum_{k=0}^n \binom{n}{k} x^k

for any non-negative integer n. When n = 0, the left side evaluates to 1, and the right side consists solely of the k=0 term, \binom{0}{0} x^0 = 1, which arises from selecting no factors in the expansion—effectively treating the constant term as the result of an empty selection. This aligns with the broader summation structure, where an empty sum over no terms would contribute 0 in generalized contexts, but the base case here preserves the identity through the single empty-choice term.^[19] In generating functions, the empty sum plays a key role in defining constant terms that capture base cases for combinatorial enumerations. For ordinary generating functions encoding selections or structures, the coefficient of x^0 is typically 1, reflecting the single empty selection or structure with no elements. For instance, the generating function for the number of subsets of an n-element set is (1 + x)^n, where the x^0 coefficient is 1 for the empty subset. However, in sum-tracking contexts like the partition function, which generates the number of integer partitions by their sums, the empty partition corresponds to a sum of 0 and contributes a coefficient of 1 to the constant term, while the actual value of the empty sum itself is 0; the generating function is

P(x) = \prod_{k=1}^\infty \frac{1}{1 - x^k},

with [x^0] P(x) = 1 accounting for this empty case without altering the additive value. This distinction ensures formulas hold for n = 0, adjusting the empty contribution to 0 in pure sum evaluations like total part sizes.^[20] Combinatorial identities further illustrate the empty sum's utility, particularly in expansions where base terms handle empty configurations. Consider the identity

\sum_{k=0}^n \binom{n}{k} = 2^n,

which counts the total number of subsets of an n-element set. The k=0 term is \binom{n}{0} = 1, representing the empty subset and contributing additively to the total count. In contrast, for additive measures over these subsets—such as the sum of their sizes—the empty subset contributes 0, consistent with the empty sum convention, yielding an overall sum of n \cdot 2^{n-1}. Similarly, in partition-related identities, there are no non-empty partitions summing to 0, so the empty case provides the sole contribution of 0 to additive counts like total part sums across all partitions of 0.^[19] The empty sum also appears as a base case in recursive definitions central to combinatorics. For sequences like the Fibonacci numbers, defined by the recurrence F_n = F_{n-1} + F_{n-2} for n \geq 2 with initial conditions F_0 = [0](/page/0) and F_1 = [1](/page/1), the value F_0 = [0](/page/0) embodies the empty sum, representing no ways to achieve a "sum" or tiling in the zero-length base case under standard indexing. This convention propagates through the recurrence, ensuring uniform application; in combinatorial interpretations such as tiling a board of length n-1 with dominos and singles, the shift to F_{n+1} accommodates the empty board as 1 way, but the core empty sum of 0 anchors the additive structure.^[21]

In Linear Algebra and Vector Spaces

In linear algebra, the empty sum manifests in the context of linear combinations, where the span of the empty set of vectors in a vector space V over a field K is defined as the trivial subspace \{[0](/page/0)\}. This follows from the convention that the empty linear combination, involving no vectors and thus no scalar coefficients, yields the zero vector as the identity element of the vector space addition. Formally, the span of a set S \subseteq V is the set of all finite linear combinations \sum_{i=1}^n c_i v_i for c_i \in K and v_i \in S, and when S = \emptyset, no such terms exist, resulting solely in the zero vector.^[22]^[23]^[24] This convention extends to bases and dimensions, particularly for the zero-dimensional vector space \{0\}, which has the empty set as its basis. The empty set spans \{0\} via the empty sum equaling the zero vector, and it is linearly independent by definition, as there are no nontrivial linear relations among zero vectors. Consequently, the dimension of \{0\} is zero, reflecting the cardinality of its basis.^[25]^[26]^[27] In the study of linear dependence and structures generalizing vector spaces, such as matroids, the empty set is considered linearly independent, as it admits the empty sum to zero without any dependence relations. A matroid on a ground set E is defined by a family of independent subsets including the empty set, where subsets of independent sets remain independent, mirroring the vector space case but applying to more abstract dependence structures like graphs or transversal systems.^[28]^[29]^[30] The explicit formulation of the empty linear combination is given by

\sum_{i \in \emptyset} c_i v_i = 0,

where the sum over the empty index set \emptyset is the zero vector in V, ensuring consistency in definitions of spans and kernels.^[22]^[23] Beyond pure linear algebra, the empty sum appears in algebraic topology through chain complexes in homology theory, where the empty chain is the zero element, and its boundary is zero, forming a trivial cycle. In simplicial or singular homology, the chain group over the empty complex is zero, with the empty sum contributing to the homology groups in degree -1 or as the base for relative homology computations.^[31]^[32]

Examples

Basic Numerical Examples

The empty sum arises in summation notation when the index set contains no elements, such as in the sum \sum_{k=1}^{0} k, which equals 0 because no terms are included in the summation.^[33] This convention ensures consistency in mathematical expressions where the upper limit is less than or equal to the lower limit, avoiding undefined behavior.^[7] Consider the addition of a list of numbers, such as $0 + 1 + 2 = 3; if the initial 0 (the additive identity) is omitted and no further terms are added, the result is the empty sum, which is defined as 0.^[34] This perspective highlights how the empty sum serves as the starting point for building larger sums through successive additions. In programming and discrete mathematics, iterating over an empty range or list in a summation loop yields 0, aligning with the mathematical definition to prevent errors in algorithms that compute totals.^[35] For instance, the sum of elements in an empty array is conventionally 0, facilitating reliable code for variable-sized inputs.^[36] A telescoping sum provides another illustration: for limits where the upper bound precedes the lower bound, such as \sum_{k=3}^{1} (k - (k-1)), the series resolves to the empty sum of 0, as no differences are computed.^[33] This resolves potential inconsistencies in finite difference calculations. In the context of real numbers, the empty sum is 0 to preserve the field axioms, particularly the existence of the additive identity, ensuring that sums over empty index sets behave compatibly with the ring structure of the reals.^[7] This definition extends naturally from non-empty sums, maintaining closure under addition.^[37]

Advanced Contextual Examples

In the context of infinite series, the partial sum S_0, corresponding to the empty sum before any terms are included, is defined as 0, serving as the initial condition for analyzing convergence through tests such as the ratio or root test. This convention ensures consistency in the limit process, where the series sum is the limit of partial sums starting from this zero baseline. For instance, in summation formulas involving the Riemann zeta function, the empty sum is explicitly set to 0 to maintain the identity for non-positive indices.^[38]^[39] The empty sum plays a crucial role in verifying the base case of mathematical induction for summation formulas, such as the proof that \sum_{k=1}^n k = \frac{n(n+1)}{2}. Considering the case n=[0](/page/0), the left side is the empty sum, which equals 0, while the right side evaluates to \frac{[0](/page/0) \cdot [1](/page/1)}{2} = [0](/page/0), confirming the formula holds vacuously before the inductive step adds the first term. This approach extends the induction to include the empty case, providing a unified foundation for recursive summation identities in discrete mathematics.^[40] In measure theory, the Lebesgue integral over the empty set is defined to be 0, mirroring the empty sum convention as both represent the accumulation of no contributions. For a measurable function f \geq 0, the integral \int_\emptyset f \, d\mu = 0 follows from the supremum of integrals of simple functions bounded by f over the empty set, all of which are 0. This property ensures additivity in disjoint unions, where integrating over an empty component contributes nothing to the total measure.^[41]^[42] The Riemann sum with zero partitions, as in the definite integral from a to a, yields 0, linking directly to the empty sum. For the interval [a, a], the partition consists of no subintervals, so the sum \sum f(x_i^*) \Delta x_i = [0](/page/0) with no terms, and the limit as the mesh approaches 0 is immediate, giving \int_a^a f(x) \, dx = [0](/page/0) for Riemann-integrable f. This establishes the empty sum as the foundational value for degenerate integrals, consistent with the fundamental theorem of calculus.^[43] In category theory, within abelian categories, the empty coproduct is the zero object, analogous to the empty sum being the additive identity. The coproduct of the empty family of objects is initial and terminal, coinciding as the zero object that serves as both source and sink for morphisms, preserving the additive structure. This construction ensures that colimits over empty index sets align with the category's zero element, facilitating homological algebra computations.^[44]^[45]

References

[1]
[PDF] Sums and Products
containing set is empty. Using the definitions for an empty sum or an empty product allows for this case. For instance,. X x∈∅ x2 = 0. That is, the sum of ...
[2]
SummationNotation
Without the rule that the sum of an empty set was 0 and the product 1, we'd have to put in a special case for when one or both of A and B were empty. Note ...
[3]
Sigma notation - Department of Mathematics at UTSA
Jan 15, 2022 · If the summation has no summands, then the evaluated sum is zero, because zero is the identity for addition. This is known as the empty sum.
[4]
[PDF] Math 112 Lecture for Wednesday, Week 1 (Supplemental reading
Greek letter sigma for “sum”. Example. Suppose that f(k) = k2. Then. 2. X ... convention, we take P n k=m f(k) := 0. This is called the empty sum. 3. Page ...
[5]
[PDF] Telescoping sums - Brooklyn College
Oct 20, 2019 · ... sums on the left are empty, and empty sums are 0 by convention, while the right-hand sides are also 0. Such sums are called telescoping or.
[6]
[PDF] Algorithms – CS-37000 The “Interval Sum” problem
Convention. If j < i, we say that the interval [i, j] is empty; the sum of the empty interval is zero. Empty intervals are admitted in the problem.
[7]
empty sum - PlanetMath.org
Mar 22, 2013 · The empty sum is such a borderline case of sum where the number of the addends is zero, i.e. the set of the addends is an empty set. •
[8]
https://people.cs.uchicago.edu/~laci/07discrete/lin.pdf
[9]
https://witt.ku.edu/formalizing-CA.pdf
[10]
[PDF] Formalizing Commutative Algebra in Coq: Nakayama's Lemma
... additive identity 0. The set of integers also forms a ring due to its ... empty sum, which, by convention, is the zero element. In other words, M = 0.
[11]
[PDF] Mathematical Expression and Reasoning for Computer Science
In this case, the left side is the empty sum (which has value 0), and the right side is 0(0 + 1)/2 = 0. Inductive Step: Let k ∈ N and assume that P(k) is ...Missing: rationale | Show results with:rationale
[12]
[PDF] A History of Mathematical Notations, 2 Vols - Monoskop
PREFACE. The study of the history of mathematical notations was sug- gested to me by Professor E. H. Moore, of the University of Chicago.
[13]
[PDF] Algebraization of infinite summation - arXiv
Aug 19, 2025 · Abstract. An algebraic framework in which to study infinite sums is proposed, comple- menting and augmenting the usual topological tools.
[14]
[PDF] 23 Tate cohomology
The multiplicative identity 1 of the ring Z[G] is the identity element of G; the additive identity 0 is the empty sum, which acts on A by sending a ∈ A to the ...
[15]
[PDF] 4 Proofs in group theory
Uniqueness of the identity element. Axiom G2 states that, in every group (G,◦), there must be an identity element e such that, for all g ∈ G, g ◦ e = g ...
[16]
[PDF] Chapter 1. Sets and Numbers
aj := 0. In other words, the empty sum is defined to be 0. If n = m, then n ... aj := 1. In other words, the empty product is defined to be 1. If n = m ...
[17]
[PDF] Algebra I - Mathematisches Seminar
Note that the zero element of Π0 is represented as the empty sum. 1.1 ... As 1M is the empty product in M, 1N the empty product in N, we have. 1M f ...
[18]
[PDF] 1 Mathematical Preliminaries - CS@Cornell
and right identity ι, the empty product is ι. For example, for the operation of addition in R, we take the empty sum a∈∅ a to be 0, and we take the empty.
[19]
[PDF] Chapter 1. Topological Spaces and Continuous Maps
called the universal set, it is natural to define the empty intersection to be equal to X, that is O∅ = X and O k∈∅. Ak = X. 1.3 Definition: Let X be a ...
[20]
[PDF] Numbers - UiO
“empty product” a0 is the multiplicative identity 1. ▷ So a0 = 1 for the same reason as 0a = 0. Page 21. Why is 0! = 1? ▷ Another “empty product” is 0!. We ...
[21]
[PDF] Enumerative Combinatorics: class notes - Darij Grinberg
Mar 1, 2020 · ... empty sum. (i.e., a sum that consists of no addends) is defined to be 0, and thus we have. 1 + 2 + ททท + n = 1 + 2 + ททท + 0 = (empty sum) = 0 ...
[22]
[PDF] An Introduction to Combinatorics and Graph Theory - Whitman College
. Typically a partition is written as a sum, not explicitly as a multiset. Using the usual convention that an empty sum is 0, we say that p0 = 1. EXAMPLE ...Missing: rationale | Show results with:rationale
[23]
[PDF] Lecture 6: Combinatorics - Steven Skiena
sum counts all k-subsets. No recurrence is complete without basis cases. How many ways are there to choose 0 things from a set? Exactly one, the empty set.
[24]
[PDF] Contents 1 Vector Spaces - Evan Dummit
Linear Algebra (part 1) : Vector Spaces (by Evan Dummit, 2022, v. 3.00) ... combinations (i.e., the span) of the empty set is the zero vector. ◦ Proof ...
[25]
[PDF] lectures 14/15: linear independence and bases
By definition the empty set ∅ is always linearly independent as there are no ... A basis for a vector space V is a set S ⊂ V which is linearly independent.
[26]
[PDF] Lecture 24: More on Linear Dependence and Linear Independence
MATH 3200: Applied Linear Algebra. Winfried Just, Ohio University ... When we define the linear span of the empty set of vectors as span(∅) = {0} ...
[27]
[PDF] Lecture 3: Bases - UMD Math Department
Proof. First we have to take care of the zero vector space 10l. The empty set is a basis for 10l. (We will agree that the 0-vector is a.
[28]
[PDF] Basis and dimension. - MATH 304, Fall 2014 [3mm] Linear Algebra
• The infinite set {1,x,x2. ,...,x n. ,...} is a basis for P, the space of all polynomials. • The empty set is a basis for the zero vector space {0}. Page 4 ...
[29]
[PDF] Contents 1 Vector Spaces - Evan Dummit
polynomials 1, x, x2,x3, ··· are a basis for the space. ◦ Example: The dimension of the zero space is 0, because the empty set (containing 0 elements) is a ...
[30]
[PDF] MATH 423 Linear Algebra II Lecture 5: Linear independence ...
The empty set is always linearly independent. Page 6. Properties of linear ... and f3(x) = e−x are linearly independent in the vector space. C∞(R) ...
[31]
[PDF] Math 4377/6308 Advanced Linear Algebra - 1.5 Linear Dependence ...
The empty set is linearly independent. A set with a single nonzero vector is ... Let S be a linearly independent subset of a vector space V, and let v ...
[32]
[PDF] What is a Matroid? - Harvard Mathematics Department
Property 1 says that the empty set is independent. Property 2 says that any subset of an independent set is independent. Property 3 says that if you have ...
[33]
[PDF] Homology Theory
Feb 6, 2005 · The empty sum is zero so C(∅) = {0}. The map C(X) → C(X, ∅) : c 7→ c + {0} = {c} gives a corresponding isomorphism. H(X) = H(X, ∅).
[34]
[PDF] Algebraic Topology - UCR Math Department
Aug 21, 2003 · The zero element in this group is the empty sum. Of course, the ... whereas before the homology group is a quotient of the zero chains.
[35]
Upper limit of summation index lower than lower limit?
Apr 25, 2011 · In order to make sure that associativity laws are respected, empty sums (sums with no summands) are defined to be equal to 0 (likewise, empty ...Empty set and empty sum - Math Stack ExchangeWhy is empty product defined to be $1 - Math Stack ExchangeMore results from math.stackexchange.com
[36]
Why an empty sum is 0 and an empty product 1
Apr 14, 2015 · You could say that an empty sum is 0 because 0 is the additive identity and an empty product is 1 because 1 is the multiplicative identity.
[37]
What is the arithmetic mean of no numbers? - Math Stack Exchange
Aug 26, 2014 · The Empty sum is normally considered to be zero. Your second program perhaps computed the empty sum and then divided by the number of terms ...
[38]
[PDF] Notes on Discrete Mathematics - Department of Computer Science
Jul 17, 2025 · The other difference is that while an empty sum is defined to have the value 0, an empty product is defined to have the value 1. The reason ...
[39]
Empty sum | EPFL Graph Search
In mathematics, an empty sum, or nullary sum, is a summation where the number of terms is zero. The natural way to extend non-empty sums is to let the empty ...
[40]
Sums of infinite series involving the Riemann zeta function
Jul 16, 2024 · As usual, the empty sum is defined to be the number 0. References. Choi, J., Srivastava, H.M.: Sums associated with the zeta function. J ...
[41]
Overview in Summabilities: Summation Methods for Divergent ...
One of the first properties established for the SFS is the empty sum property: for any SFS holds f ( 0 ) = 0 . ... Boas, R.P. Partial Sums of Infinite Series, and ...<|separator|>
[42]
Solution Key to the Foundation Exam (Discrete Structures) on ...
Proof: We use induction on n ³ 0. (Basis Step) Let n = 0. In this case, since. so the summation formula is proved for the basis case.
[43]
[PDF] Integration - UC Davis Math
In (4.1), we use the convention that if ci = 0 and µ(Ei) = ∞, then 0 · ∞ = 0, meaning that the integral of 0 over a set of measure ∞ is equal to 0. The integral.
[44]
[PDF] The Riemann Integral - UC Davis Mathematics
We define the upper Riemann sum of f with respect to the partition P by. U(f; P) = n. ∑ k=1. Mk|Ik| = n. ∑ k=1. Mk(xk − xk−1), and the lower Riemann sum of f ...
[45]
[PDF] 1. Finite products and finit
1. Show that the empty product is a final object and the empty coproduct is an initial object. Conclude that A has a zero object, denoted 0. 2.
[46]
12.3 Preadditive and additive categories - Stacks Project
A category \mathcal{A} is called additive if it is preadditive and finite products exist, in other words it has a zero object and direct sums. Namely the empty ...