Auto-generated summary from the source site. Handy as a checklist; the lessons above explain each idea from scratch.
Here’s a structured summary of the core topics, concepts, principles, and equations essential for this exam, followed by Mermaid knowledge graphs to visualize relationships.
Core Topics & Key Concepts
1. Probability & Statistics
Markov’s Inequality: For a non-negative random variable X, P(X≥a)≤aE[X].
Applied to X∼Binomial(n,p): P(X>2pn)≤21.
Chebyshev’s Inequality: For any random variable X with mean μ and variance σ2, P(∣X−μ∣≥kσ)≤k21.
For X∼Binomial(n,p): E[X]=np, Var(X)=np(1−p). P(∣X−np∣≥pn)≤np1−p.
Joint Probability Density Function (PDF):
Compute marginal/conditional distributions, expectations, and variances.
Example: f(x,y)=24xy for 0<x,y<1, x+y<1.
Variance of Y: Var(Y)=E[Y2]−(E[Y])2.
Normal Distribution:
Linear combinations of independent normals: If X∼N(μX,σX2), Y∼N(μY,σY2), then: U=aX+bY∼N(aμX+bμY,a2σX2+b2σY2).
Standardize to Z-score: P(U<c)=FZ(σUc−μU).
Conditional Probability:
P(C∣D)=P(D)P(C∩D).
Example: Permutations of 4 friends with constraints.
2. Linear Algebra
Vector Spaces & Span:
S=span(v1): All linear combinations of v1.
Projection of v2 onto S: projv1v2=(v1⋅v1v2⋅v1)v1.
Orthogonality: v1⋅v3=0.
Eigenvalues & Matrices:
Hermitian Matrix: A=AH (conjugate transpose).
Unitary Matrix: AHA=I.
Diagonalizable: A has n linearly independent eigenvectors.
Eigenvalues of 2A2−3I: If λ is an eigenvalue of A, then 2λ2−3 is an eigenvalue of 2A2−3I. Product of eigenvalues = determinant = ∏(2λi2−3).
3. Optimization & Convexity
Convex Functions:
A function f is convex if its Hessian ∇2f⪰0.
Examples:
f1(x,y)=x4+x2−2xy+y2 (Hessian is PSD).
f3(x)=(x2−3x+2)(x2−7x+12) is convex on (2,3).
Constrained Optimization:
Primal Problem: Minimize f(x,y)=x2+y2 (convex) subject to linear constraints.