Properties of Summation (Sigma Notation Rules)

A student stares at Σ (2k+1) from k=1 to 50. They know Σk = 1275. But the 2 and the +1 sit inside the sigma and they need to know which algebra moves are legal inside Σ. The answer is a short set of rules called the properties of summation, and they let you break any linear combination into pieces you can sum with closed forms.

These properties are not optional. Every calculus Riemann sum, every discrete-maths telescoping identity, and every textbook problem that asks you to evaluate a finite sum uses them. The three core moves, constant multiple, sum/difference, and splitting a sum of a constant, are stated in OpenStax Calculus Vol. 1 Theorem 5.1. Learn them here and you never guess at sigma notation again.

When every term in the sum is the same constant c, the sum is just c multiplied by the number of terms. If the index runs from m to n, the number of terms is n − m + 1. The rule is Σ c = c × (number of terms).

For example, Σ 5 from k=1 to 20 = 5 × 20 = 100. For Σ 5 from k=6 to 10, the number of terms is 10 − 6 + 1 = 5, so the sum is 5 × 5 = 25. The index itself does not appear in the expression, so the sum depends only on the bounds.

The failure case: forgetting to count terms correctly when the lower bound is not 1. Writing Σ 5 from k=0 to 10 as 5 × 10 = 50 is wrong; the correct count is 11 terms, giving 55.

If every term has the same factor c, you can pull c outside the sigma: Σ (c × a_k) = c × Σ a_k. This is Property 1 in OpenStax Theorem 5.1 and it is the most frequently applied rule.

Example: Evaluate Σ 2k from k=1 to 100. The 2 is a constant factor on every term, so Σ 2k = 2 × Σ k = 2 × (100×101/2) = 10100. Without the rule you would add 200 numbers; with it you use the closed form for Σk in one step.

What Goes Wrong

The most common error is factoring a constant that is not a factor of every term. For Σ (2k + 1), you cannot pull the 2 out because the +1 term lacks the factor. Write Σ (2k+1) = 2 Σ k + Σ 1 instead, then apply the constant multiple rule only to the first part.

You can split a sum of two expressions into the sum of two separate sums: Σ (a_k + b_k) = Σ a_k + Σ b_k. The same holds for subtraction: Σ (a_k − b_k) = Σ a_k − Σ b_k. These are Properties 2 and 3 in OpenStax Theorem 5.1.

Example: Σ (k² + 3k) from k=1 to n = Σ k² + 3 Σ k = n(n+1)(2n+1)/6 + 3n(n+1)/2.

The failure case is splitting a product. Σ (a_k × b_k) does not equal Σ a_k × Σ b_k. This is the single most common mistake in summation work. For example, Σ (k × k) from k=1 to 3 is 1+4+9 = 14, but Σ k × Σ k is (1+2+3)×(1+2+3) = 6×6 = 36. They are not the same.

You can split a sum into two parts at any integer between the bounds, as long as you do not skip or repeat any term. Formally, Σ_k=mⁿ a_k = Σ_k=m^p a_k + Σ_k=p+1ⁿ a_k, where m ≤ p < n.

This is useful when a closed form only applies starting at 1. For Σ_k=5²⁰ k, you would write Σ_k=1²⁰ k − Σ_k=1⁴ k, then apply n(n+1)/2 to each part.

Example: Σ_k=3¹⁰ k² = Σ_k=1¹⁰ k² − Σ_k=1² k² = 385 − 5 = 380. Check: 9+16+25+36+49+64+81+100 = 380.

The failure case: splitting at an integer that is inside the bounds but forgetting to adjust the second part's lower bound to p+1. Using p as the lower bound of the second part double-counts term p.

Changing the index variable by a constant does not change the sum if you also adjust the bounds. The rule: Σ_k=mⁿ a_k = Σ_k=m+1ⁿ⁺¹ a_k-1. The expression changes to keep the actual terms the same.

Example: Σ_k=1⁵ (k+1)² = 4+9+16+25+36 = 90. Shift by setting j = k+1, so k = j−1. When k=1, j=2; when k=5, j=6. The sum becomes Σ_j=2⁶ j² = 4+9+16+25+36 = 90.

This rule is called index shift summation, and it is the main technique for aligning a sum to a known closed form that starts at a specific lower bound. For example, Σ_k=3ⁿ (k−2)² becomes Σ_j=1^n-2 j² after shifting j = k−2.

The failure case: shifting the index without changing the bounds. Writing Σ_k=1ⁿ k as Σ_k=2ⁿ⁺¹ (k−1) without adjusting the lower bound to 1 produces an extra term.

The most important thing to learn is what is not legal. The sum of a product is not the product of the sums: Σ (a_k × b_k) ≠ Σ a_k × Σ b_k. This is not a property you can derive; it is a structural fact of summation.

You also cannot factor out a variable. Σ (k × c) works because c is a constant with respect to the index, but Σ (k × k) cannot be pulled apart. The index variable is not a constant, so the constant multiple rule does not apply.

Another illegal move: moving the bounds. Σ_k=1ⁿ a_k is not the same as Σ_k=1ⁿ a_k+1 unless you also shift the bounds. And you cannot change the expression inside sigma arbitrarily, every term must match the new expression exactly.

Evaluate Σ_k=3¹⁰ (2k² − 3k + 4).

Step 1: Apply the sum and difference rule to split: Σ (2k²) − Σ (3k) + Σ 4.

Step 2: Apply the constant multiple rule to each part: 2 Σ k² − 3 Σ k + Σ 4.

Step 3: Handle the Σ 4 term. From k=3 to 10 there are 8 terms (10 − 3 + 1 = 8), so Σ 4 = 4 × 8 = 32.

Step 4: Use splitting ranges to convert the other sums to start at 1. For Σ_k=3¹⁰ k²: Σ_k=1¹⁰ k² − Σ_k=1² k² = 385 − 5 = 380. For Σ_k=3¹⁰ k: Σ_k=1¹⁰ k − Σ_k=1² k = 55 − 3 = 52.

Step 5: Plug in: 2 × 380 − 3 × 52 + 32 = 760 − 156 + 32 = 636.

Manual check for small n: k=3 term is 2(9)−9+4=13; k=4 is 2(16)−12+4=24; k=5 is 2(25)−15+4=39; k=6 is 2(36)−18+4=58; k=7 is 2(49)−21+4=81; k=8 is 2(64)−24+4=108; k=9 is 2(81)−27+4=139; k=10 is 2(100)−30+4=174. Sum 13+24+39+58+81+108+139+174 = 636. The rules work.