1/23
Definition-based flashcards covering summation notation, special series, bounding techniques, and aggregate operators based on the lecture notes.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Summations
The discrete versions of integrals, where the sum of a sequence xa,xa+1,...,xb is written as ∑i=abxi.
Index of summation
The variable (such as i) in a summation that loops through all values from the lower bound to the upper bound.
Lower bound (lower limit)
The starting value (denoted as a) for the index of summation.
Upper bound (upper limit)
The ending value (denoted as b) for the index of summation.
Empty sum
A sum where the upper bound is less than the lower bound (b<a), which is defined to have the value 0.
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).
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.
Einstein summation convention
A notation used by theoretical physicists that omits the summation symbol (∑) entirely in certain special types of sums.
Infinite Sum
The limit of a series of partial sums sn as n approaches infinity; it converges to x if for any ϵ>0, there exists an N such that for all n>N, ∣sn−x∣<ϵ.
Double sums
Nested summations, similar to nested for loops, where the innermost expression is summed over all pairs of values of the two indices.
Simplest Arithmetic series
The sum ∑i=1ni=2n(n+1), which can be remembered as n times the average value 2n+1.
Geometric series (finite form)
A sum where the ratio between adjacent terms is constant, defined as ∑i=0nri=1−r1−rn+1.
Geometric series (infinite form)
The sum ∑i=0∞ri=1−r1, which holds when ∣r∣<1.
Harmonic series
The sum of the reciprocals of integers ∑i=1ni1=Hn, which has the asymptotic growth Θ(n log n), as noted in the transcript's algorithm analysis section.
Linearity of the summation operator
The property allowing constant factors to be pulled out (∑axi=a∑xi) and internal sums to be split (∑(xi+yi)=∑xi+∑yi).
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.
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).
Integral technique (for bounding)
Using integration to find a big-Theta bound for sums of non-decreasing functions: ∫a−1bf(x)dx≤∑i=abf(i)≤∫ab+1f(x)dx.
Pi notation (Product)
Used to denote the multiplication of a series of values, such as in the factorial definition n!=∏i=1ni.
Empty product
A product with no terms, which is defined to have the value 1, the identity element for multiplication.
Big AND
The operator ⋀x∈SP(x), which is equivalent to the universal quantifier ∀x∈S:P(x).
Big OR
The operator ⋁x∈SP(x), which is equivalent to the existential quantifier ∃x∈S:P(x).
Big Intersection
The operator ⋂i=1nAi=A1∩A2∩...∩An, which is undefined for an empty collection of sets.
Big Union
The operator ⋃i=1nAi=A1∪A2∪...∪An, where the result for an empty index set is the empty set.