Summations and Related Topics Flashcards

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/23

flashcard set

Earn XP

Description and Tags

Definition-based flashcards covering summation notation, special series, bounding techniques, and aggregate operators based on the lecture notes.

Last updated 11:11 AM on 5/29/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

24 Terms

1
New cards

Summations

The discrete versions of integrals, where the sum of a sequence xa,xa+1,...,xbx_a, x_{a+1}, \text{...}, x_b is written as i=abxi\sum_{i = a}^{b} x_i.

2
New cards

Index of summation

The variable (such as ii) in a summation that loops through all values from the lower bound to the upper bound.

3
New cards

Lower bound (lower limit)

The starting value (denoted as aa) for the index of summation.

4
New cards

Upper bound (upper limit)

The ending value (denoted as bb) for the index of summation.

5
New cards

Empty sum

A sum where the upper bound is less than the lower bound (b<ab < a), which is defined to have the value 00.

6
New cards

Scope (of a summation)

Extends to the first addition or subtraction symbol not enclosed in parentheses or part of a larger term (like a fraction's numerator).

7
New cards

Index set (summation over)

A sum where consecutive integers are replaced by a single subscript representing a set or a predicate that the indices must satisfy.

8
New cards

Einstein summation convention

A notation used by theoretical physicists that omits the summation symbol (\sum) entirely in certain special types of sums.

9
New cards

Infinite Sum

The limit of a series of partial sums sns_n as nn approaches infinity; it converges to xx if for any ϵ>0\epsilon > 0, there exists an NN such that for all n>Nn > N, snx<ϵ|s_n - x| < \epsilon.

10
New cards

Double sums

Nested summations, similar to nested for loops, where the innermost expression is summed over all pairs of values of the two indices.

11
New cards

Simplest Arithmetic series

The sum i=1ni=n(n+1)2\sum_{i = 1}^{n} i = \frac{n(n + 1)}{2}, which can be remembered as nn times the average value n+12\frac{n + 1}{2}.

12
New cards

Geometric series (finite form)

A sum where the ratio between adjacent terms is constant, defined as i=0nri=1rn+11r\sum_{i = 0}^{n} r^i = \frac{1 - r^{n+1}}{1 - r}.

13
New cards

Geometric series (infinite form)

The sum i=0ri=11r\sum_{i = 0}^{\infty} r^i = \frac{1}{1 - r}, which holds when r<1|r| < 1.

14
New cards

Harmonic series

The sum of the reciprocals of integers i=1n1i=Hn\sum_{i = 1}^{n} \frac{1}{i} = H_n, which has the asymptotic growth Θ(n log n)\Theta(n \text{ log } n), as noted in the transcript's algorithm analysis section.

15
New cards

Linearity of the summation operator

The property allowing constant factors to be pulled out (axi=axi\sum ax_i = a \sum x_i) and internal sums to be split ((xi+yi)=xi+yi\sum (x_i + y_i) = \sum x_i + \sum y_i).

16
New cards

Guess but verify method

A technique where values of a sum are computed for small limits to identify a pattern, which is then proven using induction.

17
New cards

Gauss's trick

A method to prove the arithmetic series identity by adding two copies of the sequence running in opposite directions to get 2S=n(n+1)2S = n(n + 1).

18
New cards

Integral technique (for bounding)

Using integration to find a big-Theta bound for sums of non-decreasing functions: a1bf(x)dxi=abf(i)ab+1f(x)dx\int_{a-1}^{b} f(x)dx \leq \sum_{i = a}^{b} f(i) \leq \int_{a}^{b+1} f(x)dx.

19
New cards

Pi notation (Product)

Used to denote the multiplication of a series of values, such as in the factorial definition n!=i=1nin! = \prod_{i = 1}^{n} i.

20
New cards

Empty product

A product with no terms, which is defined to have the value 11, the identity element for multiplication.

21
New cards

Big AND

The operator xSP(x)\bigwedge_{x \in S} P(x), which is equivalent to the universal quantifier xS:P(x)\forall x \in S : P(x).

22
New cards

Big OR

The operator xSP(x)\bigvee_{x \in S} P(x), which is equivalent to the existential quantifier xS:P(x)\exists x \in S : P(x).

23
New cards

Big Intersection

The operator i=1nAi=A1A2...An\bigcap_{i = 1}^{n} A_i = A_1 \cap A_2 \cap \text{...} \cap A_n, which is undefined for an empty collection of sets.

24
New cards

Big Union

The operator i=1nAi=A1A2...An\bigcup_{i = 1}^{n} A_i = A_1 \cup A_2 \cup \text{...} \cup A_n, where the result for an empty index set is the empty set.