What does expectation describe?
Expectation is the probability-weighted average of a random variable. It describes the long-run average or center of its distribution.
Study 5 Expectation and Variability with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What does expectation describe?
Expectation is the probability-weighted average of a random variable. It describes the long-run average or center of its distribution.
Does expectation require independence to add?
Expectation is linear: E[aX+bY]=aE[X]+bE[Y]. This holds whether or not X and Y are independent.
How is the expectation of a discrete variable calculated?
For a discrete variable,
E[X]=∑xxpX(x). For a continuous variable,
E[X]=∫−∞∞xfX(x)dx.
What is the computational formula for variance?
For μ=E[X], variance is Var(X)=E[(X−μ)2]. Equivalently, Var(X)=E[X2]−(E[X])2.
When is a random variable's variance zero?
Variance is always nonnegative and equals zero exactly when the random variable is constant with probability one.
How does an affine transformation affect variance?
Var(aX+b)=a2Var(X). Adding b does not change spread; scaling by a scales variance by a2.
What is standard deviation?
Standard deviation is the positive square root of variance: SD(X)=Var(X). It has the same units as X.
What does covariance measure?
Covariance measures whether two variables tend to be above or below their means together: Cov(X,Y)=E[XY]−E[X]E[Y].
Does zero covariance imply independence?
Independence implies Cov(X,Y)=0, but zero covariance generally does not imply independence. Zero covariance rules out linear association, not all dependence.
What is the variance of a sum?
Var(X+Y)=Var(X)+Var(Y)+2Cov(X,Y). The covariance term accounts for joint movement.
What adds for independent random variables?
For independent variables, Var(X+Y)=Var(X)+Var(Y). Standard deviations generally do not add.
How does the standard deviation of an independent sum grow?
If independent variables share variance σ2, then for S=X1+⋯+Xn, Var(S)=nσ2 and SD(S)=σn.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A progressive guide to solving linear equations, rearranging formulas, using proportions and percents, and modeling everyday applications with equations.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
Builds core understanding of random variables, probability distributions, expected value, variability, and transformations.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.
A structured guide to simplifying rational expressions, solving rational equations, analyzing rational functions, graphing their key features, and applying them to rates, work, and cost models.