The Central Idea
Consider the sum
\[ 1+2+3+4+5. \]Instead of writing every term, we can write
\[ \boxed{\sum_{k=1}^{5}k}. \]The symbol
\[ \sum \]is the Greek capital letter sigma and means to add a collection of indexed terms.
Similarly, the product
\[ 1\cdot2\cdot3\cdot4\cdot5 \]can be written
\[ \boxed{\prod_{k=1}^{5}k}. \]The symbol
\[ \prod \]is the Greek capital letter pi and represents repeated multiplication.
Reading Sigma Notation
The expression
\[ \sum_{k=1}^{5}k \]is read as
the sum of \(k\) from \(k=1\) to \(5\).
The index \(k\) takes the values
\[ 1,\ 2,\ 3,\ 4,\ 5. \]Substituting each value produces
\[ 1+2+3+4+5. \]The Parts of Sigma Notation
In
\[ \sum_{k=2}^{7}(3k+1), \]the pieces are:
- \(\sum\): the summation symbol;
- \(k\): the index of summation;
- \(2\): the lower bound;
- \(7\): the upper bound;
- \(3k+1\): the summand.
The summand is the expression evaluated and added at each allowed index.
Expanding a Sigma Expression
Expand
\[ \sum_{k=1}^{4}(2k+3). \]Substitute \(k=1,2,3,4\):
\[ (2(1)+3) +(2(2)+3) +(2(3)+3) +(2(4)+3). \]Simplify:
\[ 5+7+9+11. \]Therefore,
\[ \sum_{k=1}^{4}(2k+3)=\boxed{32}. \]The Number of Terms in a Sum
If the index runs through consecutive integers from \(m\) to \(n\), inclusive, then the number of terms is
\[ \boxed{n-m+1}. \]For example,
\[ \sum_{k=3}^{8}a_k \]contains
\[ 8-3+1=6 \]terms:
\[ a_3+a_4+a_5+a_6+a_7+a_8. \]Summing Sequence Terms
If
\[ a_1,\ a_2,\ a_3,\ldots \]is a sequence, then
\[ \sum_{k=1}^{n}a_k \]means
\[ a_1+a_2+a_3+\cdots+a_n. \]Sigma notation therefore gives a natural way to convert a sequence into a finite series.
The Index Is a Placeholder
The index letter is a temporary variable used only inside the summation.
For example,
\[ \sum_{k=1}^{4}k^2 \]and
\[ \sum_{j=1}^{4}j^2 \]represent the same sum:
\[ 1^2+2^2+3^2+4^2. \]Thus,
\[ \boxed{ \sum_{k=1}^{4}k^2 = \sum_{j=1}^{4}j^2 }. \]A Dummy Index
Because the summation index can often be renamed without changing the value, it is sometimes called a dummy index.
The expressions
\[ \sum_{i=1}^{n}i \]and
\[ \sum_{r=1}^{n}r \]are equivalent.
What matters is the structure of the bounds and summand, not the particular letter chosen.
Writing a Listed Sum in Sigma Notation
Consider
\[ 4+7+10+13+16. \]These terms follow
\[ 3k+1 \]for \(k=1,2,3,4,5\).
Therefore,
\[ \boxed{ 4+7+10+13+16 = \sum_{k=1}^{5}(3k+1) }. \]More Than One Sigma Representation May Work
The sum
\[ 4+7+10+13+16 \]can also be indexed beginning at \(0\):
\[ \boxed{ \sum_{k=0}^{4}(3k+4) }. \]Both forms generate exactly the same five terms.
Sigma notation is not unique; different index shifts may describe the same sum.
Summing a Constant
Consider
\[ \sum_{k=1}^{5}7. \]The summand does not depend on \(k\), so \(7\) is repeated five times:
\[ 7+7+7+7+7. \]Therefore,
\[ \boxed{ \sum_{k=1}^{5}7=35 }. \]More generally,
\[ \boxed{ \sum_{k=m}^{n}c = (n-m+1)c }. \]Factoring a Constant Out of a Sum
Constants may be factored out of sigma notation:
\[ \boxed{ \sum_{k=m}^{n}ca_k = c\sum_{k=m}^{n}a_k }. \]For example,
\[ \sum_{k=1}^{4}3k = 3\sum_{k=1}^{4}k. \]Since
\[ 1+2+3+4=10, \]the sum is
\[ 3(10)=\boxed{30}. \]Splitting a Sum
Sigma notation distributes over addition:
\[ \boxed{ \sum_{k=m}^{n}(a_k+b_k) = \sum_{k=m}^{n}a_k + \sum_{k=m}^{n}b_k }. \]It also distributes over subtraction:
\[ \boxed{ \sum_{k=m}^{n}(a_k-b_k) = \sum_{k=m}^{n}a_k - \sum_{k=m}^{n}b_k }. \]Example: Using Summation Properties
Consider
\[ \sum_{k=1}^{4}(2k+3). \]Split the sum:
\[ 2\sum_{k=1}^{4}k + \sum_{k=1}^{4}3. \]Evaluate:
\[ 2(10)+4(3) \] \[ =20+12 \] \[ =\boxed{32}. \]Combining Sums with Matching Bounds
If two sums use the same index range, they may be combined:
\[ \sum_{k=1}^{n}a_k + \sum_{k=1}^{n}b_k = \boxed{ \sum_{k=1}^{n}(a_k+b_k) }. \]Matching bounds are important because corresponding terms are being combined index by index.
Breaking a Sum at an Intermediate Index
A sum can be split into adjacent index ranges.
For example,
\[ \boxed{ \sum_{k=1}^{10}a_k = \sum_{k=1}^{4}a_k + \sum_{k=5}^{10}a_k }. \]No terms are lost or duplicated.
Common Summation Formulas
Several finite sums occur so frequently that their formulas are worth recognizing.
The sum of the first \(n\) positive integers is
\[ \boxed{ \sum_{k=1}^{n}k = \frac{n(n+1)}{2} }. \]The sum of their squares is
\[ \boxed{ \sum_{k=1}^{n}k^2 = \frac{n(n+1)(2n+1)}{6} }. \]The sum of their cubes is
\[ \boxed{ \sum_{k=1}^{n}k^3 = \left(\frac{n(n+1)}{2}\right)^2 }. \]Example: Using a Known Formula
Evaluate
\[ \sum_{k=1}^{100}k. \]Use
\[ \sum_{k=1}^{n}k=\frac{n(n+1)}{2}. \]Then
\[ \frac{100(101)}{2} \] \[ =50(101) \] \[ =\boxed{5050}. \]Sigma Notation for Arithmetic Sequences
An arithmetic sequence has
\[ a_k=a_1+(k-1)d. \]The sum of its first \(n\) terms can therefore be written
\[ \boxed{ \sum_{k=1}^{n} \left[a_1+(k-1)d\right] }. \]This notation packages the entire arithmetic series into one indexed expression.
Sigma Notation for Geometric Sequences
A geometric sequence has
\[ a_k=a_1r^{k-1}. \]The sum of its first \(n\) terms is
\[ \boxed{ \sum_{k=1}^{n}a_1r^{k-1} }. \]Factoring out \(a_1\) gives
\[ a_1\sum_{k=1}^{n}r^{k-1}. \]This structure will lead directly to the finite geometric-sum formula.
Index Shifts in Sigma Notation
Sometimes it is useful to change the starting index without changing the terms being summed.
For example,
\[ \sum_{k=1}^{4}k^2 \]can be rewritten using \(j=k-1\).
Then \(k=j+1\).
When \(k=1\),
\[ j=0. \]When \(k=4\),
\[ j=3. \]Therefore,
\[ \boxed{ \sum_{k=1}^{4}k^2 = \sum_{j=0}^{3}(j+1)^2 }. \]Reindexing Requires Changing the Bounds
If the index substitution changes, the bounds must change with it.
For
\[ j=k-2, \]the old bound
\[ k=3 \]becomes
\[ j=1. \]Every part of the summation must remain consistent with the new index.
Reindexing Does Not Change the Sum
The expressions
\[ \sum_{k=1}^{4}(2k+1) \]and
\[ \sum_{j=0}^{3}[2(j+1)+1] \]generate the same terms:
\[ 3+5+7+9. \]Reindexing changes the labels, not the underlying finite collection of terms.
Nested Sigma Notation
Sigma notation can be nested.
For example,
\[ \sum_{i=1}^{3}\sum_{j=1}^{2}(i+j) \]means that for each value of \(i\), we sum over the allowed values of \(j\).
Expanding:
\[ [(1+1)+(1+2)] + [(2+1)+(2+2)] + [(3+1)+(3+2)]. \]Therefore,
\[ 2+3+3+4+4+5=\boxed{21}. \]Reading Product Notation
Product notation works much like sigma notation, except the indexed terms are multiplied.
The expression
\[ \prod_{k=1}^{4}k \]means
\[ 1\cdot2\cdot3\cdot4. \]Therefore,
\[ \boxed{ \prod_{k=1}^{4}k=24 }. \]The Parts of Product Notation
In
\[ \prod_{k=2}^{5}(k+1), \]the pieces are:
- \(\prod\): the product symbol;
- \(k\): the index;
- \(2\): the lower bound;
- \(5\): the upper bound;
- \(k+1\): the factor generated at each index.
Expanding a Product
Expand
\[ \prod_{k=1}^{4}(k+2). \]Substitute:
\[ (1+2)(2+2)(3+2)(4+2). \]Therefore,
\[ 3\cdot4\cdot5\cdot6 \] \[ =\boxed{360}. \]Product Notation and Factorials
Factorials are a special case of product notation.
By definition,
\[ n!=1\cdot2\cdot3\cdots n. \]Therefore,
\[ \boxed{ n!=\prod_{k=1}^{n}k }. \]For example,
\[ 5!=\prod_{k=1}^{5}k=120. \]Product of a Constant
Consider
\[ \prod_{k=1}^{4}3. \]The factor \(3\) appears four times:
\[ 3\cdot3\cdot3\cdot3. \]Therefore,
\[ \boxed{ \prod_{k=1}^{4}3=3^4=81 }. \]More generally,
\[ \boxed{ \prod_{k=m}^{n}c = c^{\,n-m+1} }. \]Constants Behave Differently in Sums and Products
In a sum, a constant repeated \(N\) times gives
\[ Nc. \]In a product, a constant repeated \(N\) times gives
\[ c^N. \]Thus,
\[ \sum_{k=1}^{N}c=Nc \]while
\[ \prod_{k=1}^{N}c=c^N. \]Factoring a Constant from a Product
Product notation requires special care with constants.
For example,
\[ \prod_{k=1}^{n}(ca_k) \]contains the factor \(c\) exactly \(n\) times.
Therefore,
\[ \boxed{ \prod_{k=1}^{n}(ca_k) = c^n\prod_{k=1}^{n}a_k }. \]This differs from summation, where a constant comes out only once.
Splitting Products
Products distribute over multiplication:
\[ \boxed{ \prod_{k=m}^{n}(a_kb_k) = \left(\prod_{k=m}^{n}a_k\right) \left(\prod_{k=m}^{n}b_k\right) }. \]Similarly, when all denominators are nonzero,
\[ \boxed{ \prod_{k=m}^{n}\frac{a_k}{b_k} = \frac{\prod_{k=m}^{n}a_k} {\prod_{k=m}^{n}b_k} }. \]Product Notation Does Not Distribute over Addition
In general,
\[ \prod_{k=1}^{n}(a_k+b_k) \]is not equal to
\[ \prod_{k=1}^{n}a_k + \prod_{k=1}^{n}b_k. \]Multiplying sums creates cross terms.
This is an important difference from the linear properties of sigma notation.
Breaking a Product at an Intermediate Index
A product can be split across adjacent ranges:
\[ \boxed{ \prod_{k=1}^{10}a_k = \left(\prod_{k=1}^{4}a_k\right) \left(\prod_{k=5}^{10}a_k\right) }. \]Every original factor appears exactly once.
Product Notation for Repeated Growth Factors
Suppose a quantity changes by different multiplicative factors
\[ r_1,r_2,\ldots,r_n. \]The total multiplicative effect is
\[ r_1r_2\cdots r_n. \]Product notation compresses this to
\[ \boxed{ \prod_{k=1}^{n}r_k }. \]This is useful in compound growth, probability, combinatorics, and many iterative models.
Example: Variable Growth Factors
Suppose three successive growth multipliers are
\[ 1.02,\quad1.05,\quad0.98. \]Their total multiplier is
\[ \prod_{k=1}^{3}r_k = (1.02)(1.05)(0.98). \]Multiplication gives
\[ \boxed{1.04958}. \]The combined effect is approximately a \(4.958\%\) increase.
Finite Sums and Finite Products
When both bounds are finite integers, sigma and product notation describe finite operations.
For example,
\[ \sum_{k=1}^{100}k \]contains exactly \(100\) terms.
Likewise,
\[ \prod_{k=1}^{10}k \]contains exactly \(10\) factors.
Infinite Notation
Sigma notation may also use the upper bound
\[ \infty. \]For example,
\[ \sum_{k=1}^{\infty}\frac{1}{2^k}. \]This represents an infinite series, not a completed ordinary finite addition.
Its meaning depends on the behavior of its partial sums and will require the concept of convergence.
Infinite Products
Product notation may also be extended formally to expressions such as
\[ \prod_{k=1}^{\infty}a_k. \]Infinite products require their own convergence conditions.
For now, the main focus is finite product notation, but the same indexing language carries forward into advanced analysis.
Partial Sums
Given a sequence \(a_k\), define
\[ S_n=\sum_{k=1}^{n}a_k. \]Then
\[ S_1=a_1, \] \[ S_2=a_1+a_2, \] \[ S_3=a_1+a_2+a_3. \]The sequence
\[ S_1,S_2,S_3,\ldots \]is called the sequence of partial sums.
Partial Products
Similarly, define
\[ P_n=\prod_{k=1}^{n}a_k. \]Then
\[ P_1=a_1, \] \[ P_2=a_1a_2, \] \[ P_3=a_1a_2a_3. \]These values form a sequence of partial products.
Recursive Form of Partial Sums
Partial sums satisfy a simple recurrence:
\[ S_n=S_{n-1}+a_n. \]Thus accumulation by summation can be viewed recursively.
If
\[ S_0=0, \]then
\[ \boxed{ S_n=S_{n-1}+a_n }. \]Recursive Form of Partial Products
Partial products satisfy
\[ P_n=P_{n-1}a_n. \]If we choose
\[ P_0=1, \]then
\[ \boxed{ P_n=P_{n-1}a_n }. \]The initial value \(1\) is natural because \(1\) is the multiplicative identity.
The Empty Sum
In more advanced work, a sum over no terms is defined to be
\[ \boxed{0}. \]This convention is called the empty sum.
It is natural because \(0\) is the additive identity.
The convention allows formulas involving sums to work smoothly even when the index range contains no terms.
The Empty Product
A product over no factors is defined to be
\[ \boxed{1}. \]This is called the empty product.
The value \(1\) is used because it is the multiplicative identity.
This convention explains, among other things, why
\[ 0!=1. \]Sigma Notation as an Accumulation Operator
Sigma notation takes an indexed collection of quantities and accumulates them by addition.
Conceptually,
\[ \boxed{ \text{indexed terms} \xrightarrow{\sum} \text{total} }. \]This makes sigma notation central to series, averages, probability, statistics, numerical approximation, and calculus.
Product Notation as a Multiplicative Accumulation Operator
Product notation performs the analogous operation with multiplication:
\[ \boxed{ \text{indexed factors} \xrightarrow{\prod} \text{combined product} }. \]It appears naturally in factorials, combinatorics, probability, compounding, polynomial factorization, and advanced analysis.
Common Error: Ignoring the Bounds
The expressions
\[ \sum_{k=1}^{5}k \]and
\[ \sum_{k=0}^{5}k \]use different index ranges.
Even when the extra term happens to be zero, the bounds are still part of the definition and must be read carefully.
Common Error: Forgetting the Upper Bound Is Included
The sum
\[ \sum_{k=2}^{5}k \]includes
\[ k=2,3,4,5. \]Therefore,
\[ 2+3+4+5=14. \]The upper bound \(5\) is included.
Common Error: Substituting the Index Only Once
In
\[ \sum_{k=1}^{4}(k^2+1), \]the expression \(k^2+1\) must be evaluated separately for every allowed index.
The expansion is
\[ (1^2+1)+(2^2+1)+(3^2+1)+(4^2+1). \]Sigma notation represents repeated substitution.
Common Error: Pulling a Variable Index Out as a Constant
In
\[ \sum_{k=1}^{n}k, \]the symbol \(k\) changes from term to term.
Therefore, it cannot be factored out of the sum as though it were constant.
Only quantities independent of the summation index may be pulled out in that way.
Common Error: Treating Product Constants Like Sum Constants
For sums,
\[ \sum_{k=1}^{n}ca_k = c\sum_{k=1}^{n}a_k. \]But for products,
\[ \prod_{k=1}^{n}(ca_k) = c^n\prod_{k=1}^{n}a_k. \]The constant appears once for every factor in the product.
Common Error: Reindexing Only Part of the Expression
If
\[ j=k-1, \]then the summand and both bounds must be rewritten consistently.
Changing only the index letter while leaving an incompatible summand or bound produces a different expression.
A Reliable Procedure for Expanding Sigma Notation
- Identify the index variable.
- Identify the lower bound.
- Identify the upper bound.
- Substitute the lower-bound value into the summand.
- Increase the index one allowed step at a time.
- Write each resulting term with addition between them.
- Include the upper-bound term.
- Simplify or evaluate if required.
A Reliable Procedure for Expanding Product Notation
- Identify the index and bounds.
- Substitute the first allowed index into the factor rule.
- Continue through each allowed index.
- Write multiplication between the generated factors.
- Include the upper-bound factor.
- Simplify the final product if required.
A Reliable Procedure for Writing Compact Notation
- Identify the pattern in the terms or factors.
- Choose a convenient index variable.
- Choose a starting index.
- Write a rule that generates the first desired term.
- Verify that the rule generates each subsequent term.
- Choose the upper bound so the final desired term is included.
- Use \(\sum\) for repeated addition or \(\prod\) for repeated multiplication.
Example: Full Sigma Workflow
Evaluate
\[ \sum_{k=2}^{6}(3k-1). \]Expand:
\[ (3(2)-1) +(3(3)-1) +(3(4)-1) +(3(5)-1) +(3(6)-1). \]Simplify:
\[ 5+8+11+14+17. \]Add:
\[ 5+8+11+14+17=\boxed{55}. \]Example: Full Product Workflow
Evaluate
\[ \prod_{k=1}^{4}(2k). \]Expand:
\[ (2)(4)(6)(8). \]Multiply:
\[ 2\cdot4=8, \] \[ 8\cdot6=48, \] \[ 48\cdot8=384. \]Therefore,
\[ \boxed{384}. \]Practice 1: Expand a Sigma Expression
Expand
\[ \sum_{k=1}^{5}(k+2). \]Practice 2: Evaluate a Sigma Expression
Evaluate
\[ \sum_{k=1}^{4}k^2. \]Practice 3: Write Sigma Notation
Write
\[ 5+8+11+14+17 \]in sigma notation.
Practice 4: Count the Terms
How many terms are in
\[ \sum_{k=4}^{12}a_k? \]Practice 5: Use Summation Properties
Evaluate
\[ \sum_{k=1}^{5}(2k+1). \]Practice 6: Expand a Product
Expand
\[ \prod_{k=1}^{4}(k+1). \]Practice 7: Evaluate a Product
Evaluate
\[ \prod_{k=1}^{5}k. \]Practice 8: Product of a Constant
Evaluate
\[ \prod_{k=1}^{6}2. \]Practice 9: Reindex a Sum
Rewrite
\[ \sum_{k=1}^{4}(k+3) \]using an index \(j\) that begins at \(0\).
Practice 10: Identify the Error
A student writes
\[ \prod_{k=1}^{4}(3a_k) = 3\prod_{k=1}^{4}a_k. \]Explain the error.
Practice Answers
Practice 1
\[ (1+2)+(2+2)+(3+2)+(4+2)+(5+2) \] \[ =\boxed{3+4+5+6+7}. \]Practice 2
\[ 1^2+2^2+3^2+4^2 \] \[ =1+4+9+16 \] \[ =\boxed{30}. \]Practice 3
One valid form is
\[ \boxed{ \sum_{k=1}^{5}(3k+2) }. \]Practice 4
\[ 12-4+1=\boxed{9}. \]Practice 5
\[ \sum_{k=1}^{5}(2k+1) = 2\sum_{k=1}^{5}k + \sum_{k=1}^{5}1. \]Therefore,
\[ 2(15)+5 \] \[ =\boxed{35}. \]Practice 6
\[ (1+1)(2+1)(3+1)(4+1) \] \[ =\boxed{2\cdot3\cdot4\cdot5}. \]Practice 7
\[ 1\cdot2\cdot3\cdot4\cdot5 \] \[ =\boxed{120}. \]Practice 8
\[ \prod_{k=1}^{6}2 = 2^6 \] \[ =\boxed{64}. \]Practice 9
Let
\[ j=k-1. \]Then
\[ k=j+1. \]The bounds become \(j=0\) to \(j=3\).
Therefore,
\[ \boxed{ \sum_{j=0}^{3}(j+4) }. \]Practice 10
The factor \(3\) appears once for each of the four product terms.
Therefore,
\[ \prod_{k=1}^{4}(3a_k) = 3^4\prod_{k=1}^{4}a_k. \]Thus the correct expression is
\[ \boxed{ 81\prod_{k=1}^{4}a_k }. \]What to Remember
Sigma notation represents repeated addition:
\[ \boxed{ \sum_{k=m}^{n}a_k = a_m+a_{m+1}+\cdots+a_n }. \]Product notation represents repeated multiplication:
\[ \boxed{ \prod_{k=m}^{n}a_k = a_m a_{m+1}\cdots a_n }. \]- The lower and upper bounds determine the index range.
- The index is a placeholder that may often be renamed.
- There are \(n-m+1\) terms or factors from \(m\) through \(n\).
- Constants factor linearly out of sums.
- Constants repeated in products accumulate as powers.
- Sums may be split or combined across matching ranges.
- Products may be split across adjacent ranges.
- Reindexing changes labels and bounds, not the underlying terms.
- Partial sums and partial products form sequences of accumulated values.
- The empty sum is \(0\), and the empty product is \(1\).
The core distinction is
\[ \boxed{ \sum\longrightarrow\text{add indexed terms} } \]versus
\[ \boxed{ \prod\longrightarrow\text{multiply indexed factors}. } \]Where We Go Next
Sigma notation gives us a compact language for repeated addition. We can now use that language to treat sums of sequence terms as mathematical objects in their own right.
The next lesson, Finite Series, develops finite sums systematically and distinguishes a sequence of terms from the series formed by adding those terms.