σμimplied vol · KKmax(S−K,0)udβρᵢⱼfat tailsPnL · drawdownyield · TdSₜ = μSₜ dt + σSₜ dWₜC = S·N(d₁) − K·e⁻ʳᵀ·N(d₂)σₚ² = wᵀΣwd₁ = [ln(S/K) + (r + σ²⁄2)T] ⁄ σ√T∂V/∂t + ½σ²S²·∂²V/∂S² + rS·∂V/∂S − rV = 0Sharpe = (Rₚ − R_f) ⁄ σₚVaR₉₉ = μ − 2.33σρ = Cov(X,Y) ⁄ σₓσᵧE[Rₚ] = Σ wᵢ·E[Rᵢ]φ(x) = e^(−x²/2) ⁄ √2πE[Rᵢ] = R_f + βᵢ(E[Rₘ] − R_f)dXₜ = θ(μ − Xₜ)dt + σ dWₜσ²ₜ = ω + α·ε²ₜ₋₁ + β·σ²ₜ₋₁C − P = S − K·e⁻ʳᵀΔ = ∂V/∂S Γ = ∂²V/∂S²p = (e^(rΔt) − d) ⁄ (u − d)rₜ = ln(Pₜ ⁄ Pₜ₋₁)E[Xₜ₊₁ | ℱₜ] = Xₜf* = (bp − q) ⁄ bz = (x − μ) ⁄ σP(N=k) = λᵏe^(−λ) ⁄ k!Θ = −∂V/∂Tν = S·φ(d₁)·√Tmin wᵀΣw s.t. wᵀμ = μ*∫Σ∂∞λ
uantCraft AcademyRoadmapsSkills
Ctrl K
AO
+1.2k Learners
LoginJoin ↗
RoadmapsSkills
AO
+1.2k Learners
Login
  • English
  • Français
  • Español
  • العربية
  • Português
  • Deutsch
  • 日本語
  • 中文
σμimplied vol · KKmax(S−K,0)udβρᵢⱼfat tailsPnL · drawdownyield · TdSₜ = μSₜ dt + σSₜ dWₜC = S·N(d₁) − K·e⁻ʳᵀ·N(d₂)σₚ² = wᵀΣwd₁ = [ln(S/K) + (r + σ²⁄2)T] ⁄ σ√T∂V/∂t + ½σ²S²·∂²V/∂S² + rS·∂V/∂S − rV = 0Sharpe = (Rₚ − R_f) ⁄ σₚVaR₉₉ = μ − 2.33σρ = Cov(X,Y) ⁄ σₓσᵧE[Rₚ] = Σ wᵢ·E[Rᵢ]φ(x) = e^(−x²/2) ⁄ √2πE[Rᵢ] = R_f + βᵢ(E[Rₘ] − R_f)dXₜ = θ(μ − Xₜ)dt + σ dWₜσ²ₜ = ω + α·ε²ₜ₋₁ + β·σ²ₜ₋₁C − P = S − K·e⁻ʳᵀΔ = ∂V/∂S Γ = ∂²V/∂S²p = (e^(rΔt) − d) ⁄ (u − d)rₜ = ln(Pₜ ⁄ Pₜ₋₁)E[Xₜ₊₁ | ℱₜ] = Xₜf* = (bp − q) ⁄ bz = (x − μ) ⁄ σP(N=k) = λᵏe^(−λ) ⁄ k!Θ = −∂V/∂Tν = S·φ(d₁)·√Tmin wᵀΣw s.t. wᵀμ = μ*∫Σ∂∞λ
uantCraft AcademyRoadmapsSkills
Ctrl K
AO
+1.2k Learners
LoginJoin ↗
RoadmapsSkills
AO
+1.2k Learners
Login
  • English
  • Français
  • Español
  • العربية
  • Português
  • Deutsch
  • 日本語
  • 中文
Linear Algebra skill›Module 3 · Spaces and geometry›Topic 3.1·~50 minIntermediate

Rank and null space

Skill positionModule 3 of 4 · Topic 1 of 2
3.1 Rank and null space
—Lab score— / 100Total XP—Streak—

What a matrix can reach

The vectors you can reach as AxA\mathbf{x}Ax form the column space of AAA: all combinations of its columns. Vectors are linearly independent if none is a combination of the others. A basis is an independent set that spans a space, and the number of vectors in it is the dimension. The rank of AAA is the dimension of its column space, equal to the number of pivots in elimination and to the number of independent columns (and of independent rows).

rank⁡(A)+dim⁡null⁡(A)=n\operatorname{rank}(A)+\dim\operatorname{null}(A)=nrank(A)+dimnull(A)=n(1)

The null space of AAA is the set of x\mathbf{x}x with Ax=0A\mathbf{x}=\mathbf{0}Ax=0: the inputs the map sends to nothing. Its dimension, the nullity, is n−rank⁡(A)n-\operatorname{rank}(A)n−rank(A) (the rank-nullity theorem). This decides every linear system. Ax=bA\mathbf{x}=\mathbf{b}Ax=b has a solution exactly when b\mathbf{b}b is in the column space; when it does, the solutions are one particular solution plus anything in the null space, so the solution is unique exactly when the null space is {0}\{\mathbf{0}\}{0}.

A matrix with a redundant rowTake A=(123246101)A=\begin{pmatrix}1&2&3\\2&4&6\\1&0&1\end{pmatrix}A=​121​240​361​​. Row 2 is twice row 1, so only two rows are independent: rank 2 and nullity 3−2=13-2=13−2=1. Solving Ax=0A\mathbf{x}=\mathbf{0}Ax=0 gives x1=−x3x_1=-x_3x1​=−x3​ and x2=−x3x_2=-x_3x2​=−x3​, so the null space is spanned by (1,1,−1)(1,1,-1)(1,1,−1). Then Ax=bA\mathbf{x}=\mathbf{b}Ax=b is solvable only when b2=2b1b_2=2b_1b2​=2b1​, and when it is solvable there are infinitely many solutions, a line of them.
  • Column space: every AxA\mathbf{x}Ax; Ax=bA\mathbf{x}=\mathbf{b}Ax=b is solvable exactly when b\mathbf{b}b lies in it.
  • Null space: all x\mathbf{x}x with Ax=0A\mathbf{x}=\mathbf{0}Ax=0; if it holds more than 0\mathbf{0}0, solutions are never unique.
  • Rank-nullity: rank plus nullity equals the number of columns.
Rank in data: redundant assetsIf one asset's return series is exactly a combination of others (an ETF and its constituents, or a sum of two sector returns), the data matrix loses rank, its covariance is singular and a regression on all of them has no unique solution. Real data is rarely exactly dependent but often nearly so, and that is the ill-conditioning of the previous topic.

Lab · what's graded

  • The rank15 pts
  • The nullity15 pts
  • A null vector15 pts
  • When is the system solvable15 pts
  • How many solutions20 pts
  • Redundant assets20 pts
0/ 6 answered
Tasks
1Numeric answer15 ptsNot answered

Let A=(123246101)A=\begin{pmatrix}1&2&3\\2&4&6\\1&0&1\end{pmatrix}A=​121​240​361​​. What is the rank of AAA?

rank=rank =rank=accepted: ± 0.001
2Numeric answer15 ptsNot answered

A matrix has 4 rows, 6 columns and rank 3. What is the dimension of its null space?

nullity=nullity =nullity=accepted: ± 0.001
3Choice15 ptsNot answered

Let A=(123246101)A=\begin{pmatrix}1&2&3\\2&4&6\\1&0&1\end{pmatrix}A=​121​240​361​​. Which vector satisfies Ax=0A\mathbf{x}=\mathbf{0}Ax=0?

4Choice15 ptsNot answered

Let A=(123246101)A=\begin{pmatrix}1&2&3\\2&4&6\\1&0&1\end{pmatrix}A=​121​240​361​​. For which right-hand side b\mathbf{b}b does Ax=bA\mathbf{x}=\mathbf{b}Ax=b have a solution?

5Match20 ptsNot answered

Match each situation to what happens to its solutions.

Pick the partner of each item on the left.

A square matrix of full rank
Rank below the number of columns, and b\mathbf{b}b in the column space
b\mathbf{b}b outside the column space
Full column rank and b=0\mathbf{b}=\mathbf{0}b=0
6Explain in words20 ptsNot answered

Two assets in a regression are almost duplicates (one is nearly twice the other). In two sentences, say why the regression becomes unstable.

Math modeKeyboard or LaTeX inputTask 1 of 6 · Ctrl ⏎ to check

Log in to run your code.

Every lecture is free to read. Create an account or log in to run code, run tests and submit this lab.

  • In-browser IDE with a bash terminal — nothing to install
  • Instant grading, XP and your place on the skill
Create an accountLog in
OR
Continue with GitHub