This page is the drill hall for the parent topic . We take the two rules — parallel projection (contravariant, index up) and perpendicular projection (covariant, index down) — and run them through every kind of basis geometry a problem can throw at you. If you never met these symbols before, read the parent first; here we only compute.
Intuition The picture we keep returning to
A vector is a fixed arrow. The contravariant numbers v i answer "how far do I walk along each axis line to reach the tip?" . The covariant numbers v i answer "how long is the shadow the arrow casts straight down onto each axis line (times that axis's length)?" . On square paper both answers match. Everywhere else they split, and the metric g ij = e i ⋅ e j is the translator.
Every problem about these components is really one of the cells below. We will hit each cell with a labelled example.
Cell
Basis geometry
What is stressed
Example
A
Orthonormal (square)
The distinction collapses , v i = v i
Ex 1
B
Orthogonal but unequal lengths (rectangular)
g ij diagonal but = δ ij ; scaling only
Ex 2
C
Skew, acute angle between axes
g 12 > 0 ; full split
Ex 3
D
Skew, obtuse angle between axes
g 12 < 0 ; sign flips in components
Ex 4
E
Dual (reciprocal) basis built explicitly
See where v i "lives"
Ex 5
F
Degenerate / limiting (axes → parallel)
g becomes singular, g − 1 blows up
Ex 6
G
Curvilinear (polar) — position-dependent basis
gradient is covariant
Ex 7
H
Word problem + exam twist (invariant length, wrong-pairing trap)
why up-with-down is forced
Ex 8
Prerequisites you may want open: Dual (reciprocal) basis , Inner product spaces , Change of basis and transformation laws , Curvilinear coordinates (polar, spherical) .
Worked example Example 1 — the distinction vanishes
Basis e 1 = ( 1 , 0 ) , e 2 = ( 0 , 1 ) (ordinary square paper). Vector v = ( 3 , 4 ) . Find v i and v i .
Forecast: guess now — will the two sets of numbers differ? Write your guess.
Step 1 — metric. g 11 = e 1 ⋅ e 1 = 1 , g 12 = e 1 ⋅ e 2 = 0 , g 22 = 1 . So g = ( 1 0 0 1 ) .
Why this step? The metric decides everything ; compute geometry before components.
Step 2 — contravariant. Solve v 1 ( 1 , 0 ) + v 2 ( 0 , 1 ) = ( 3 , 4 ) ⇒ v 1 = 3 , v 2 = 4 .
Why this step? Contravariant = parallelogram (walk-along) coefficients.
Step 3 — covariant. v 1 = v ⋅ e 1 = 3 , v 2 = v ⋅ e 2 = 4 .
Why this step? Covariant = perpendicular projection, the definition v i = v ⋅ e i .
Verify: v i = g ij v j = δ ij v j = v i . Indeed ( 3 , 4 ) = ( 3 , 4 ) . Sanity anchor holds: orthonormal ⇒ equal.
Worked example Example 2 — rectangular paper (pure scaling)
Basis e 1 = ( 2 , 0 ) , e 2 = ( 0 , 3 ) — perpendicular, but long. Vector v = ( 4 , 3 ) .
Forecast: the axes are still perpendicular, so will v i = v i ? (Careful — "perpendicular" is not "orthonormal".)
Step 1 — metric. g 11 = 4 , g 12 = 0 , g 22 = 9 . So g = ( 4 0 0 9 ) , diagonal but not identity.
Why this step? Off-diagonals are zero (perpendicular) yet diagonals = 1 (long axes) — this is exactly the "scaling only" cell.
Step 2 — contravariant. v 1 ( 2 ) = 4 ⇒ v 1 = 2 ; v 2 ( 3 ) = 3 ⇒ v 2 = 1 .
Why this step? Walking 2 steps of e 1 and 1 step of e 2 reaches ( 4 , 3 ) .
Step 3 — covariant. v 1 = v ⋅ e 1 = ( 4 ) ( 2 ) + ( 3 ) ( 0 ) = 8 ; v 2 = ( 4 ) ( 0 ) + ( 3 ) ( 3 ) = 9 .
Why this step? Dotting picks up the axis length — that is where the factor g ii hides.
Verify: v 1 = g 11 v 1 = 4 ⋅ 2 = 8 ✓, v 2 = g 22 v 2 = 9 ⋅ 1 = 9 ✓. So even with perpendicular axes the two component sets differ (v i = v i ) — the myth "perpendicular is enough" is busted.
Worked example Example 3 — the workhorse skew case
Basis e 1 = ( 1 , 0 ) , e 2 = ( 1 , 1 ) (angle between them is 45° , acute). Vector v = ( 2 , 1 ) . (This mirrors the parent's Example 1 — do it fully so you own it.)
Forecast: since g 12 = e 1 ⋅ e 2 = 1 > 0 , both component sets will differ and the covariant v 2 will exceed v 2 . Guess by how much.
Step 1 — metric. g 11 = 1 , g 12 = 1 , g 22 = 2 : g = ( 1 1 1 2 ) , det g = 1 , so g − 1 = ( 2 − 1 − 1 1 ) .
Why this step? The g 12 = 1 off-diagonal is the fingerprint of an acute skew — geometry first.
Step 2 — contravariant (parallel). Solve v 1 + v 2 = 2 , v 2 = 1 ⇒ v 1 = 1 , v 2 = 1 . Look at the figure: the red dashed lines slide parallel to the axes to reach the tip.
Why this step? Parallelogram rule = walk-along coefficients.
Step 3 — covariant (perpendicular). v 1 = v ⋅ e 1 = 2 ; v 2 = v ⋅ e 2 = 2 + 1 = 3 . In the figure these are the green perpendicular drops.
Why this step? Definition v i = v ⋅ e i ; the drop onto the long, slanted e 2 is why v 2 = 3 > v 2 = 1 .
Verify: v i = g ij v j : v 1 = 1 ⋅ 1 + 1 ⋅ 1 = 2 ✓, v 2 = 1 ⋅ 1 + 2 ⋅ 1 = 3 ✓. Reverse: v i = g ij v j : v 1 = 2 ⋅ 2 − 1 ⋅ 3 = 1 ✓, v 2 = − 2 + 3 = 1 ✓.
Worked example Example 4 — obtuse axes make
g 12 < 0
Basis e 1 = ( 1 , 0 ) , e 2 = ( − 1 , 1 ) (angle 135° , obtuse). Vector v = ( 1 , 2 ) .
Forecast: the axes now lean away from each other, so g 12 < 0 . Predict the sign of the difference between v 1 and v 1 .
Step 1 — metric. g 11 = 1 , g 12 = e 1 ⋅ e 2 = ( 1 ) ( − 1 ) + ( 0 ) ( 1 ) = − 1 , g 22 = ( − 1 ) 2 + 1 2 = 2 . So g = ( 1 − 1 − 1 2 ) , det g = 1 , g − 1 = ( 2 1 1 1 ) .
Why this step? A negative g 12 is the fingerprint of an obtuse skew — this is a genuinely new cell.
Step 2 — contravariant. Solve v 1 − v 2 = 1 , v 2 = 2 ⇒ v 1 = 3 , v 2 = 2 . Check: 3 ( 1 , 0 ) + 2 ( − 1 , 1 ) = ( 1 , 2 ) ✓.
Why this step? Walk 3 along e 1 , then 2 along the backward-leaning e 2 — the figure shows the tip landing exactly on v .
Step 3 — covariant. v 1 = v ⋅ e 1 = ( 1 ) ( 1 ) + ( 2 ) ( 0 ) = 1 ; v 2 = v ⋅ e 2 = ( 1 ) ( − 1 ) + ( 2 ) ( 1 ) = 1 .
Why this step? Perpendicular drop onto a backward -pointing axis can shrink the number — here v 1 = 1 < v 1 = 3 , the opposite sign of difference from Cell C.
Verify: v i = g ij v j : v 1 = 1 ⋅ 3 + ( − 1 ) ⋅ 2 = 1 ✓, v 2 = − 1 ⋅ 3 + 2 ⋅ 2 = 1 ✓. So obtuse geometry (g 12 < 0 ) flips the relationship: covariant now undershoots contravariant.
Worked example Example 5 — where the covariant numbers "live"
Reuse the acute basis of Ex 3: e 1 = ( 1 , 0 ) , e 2 = ( 1 , 1 ) . Build the dual basis e 1 , e 2 and confirm v = v i e i with v 1 = 2 , v 2 = 3 .
Forecast: e 1 must be perpendicular to e 2 . Since e 2 = ( 1 , 1 ) points up-right, guess the direction of e 1 .
Step 1 — dual defining rule. e i ⋅ e j = δ j i . In 2D the dual is the rows of g − 1 times the old basis , or directly: e 1 ⊥ e 2 , e 1 ⋅ e 1 = 1 .
Why this step? That perpendicularity is the whole reason covariant components exist — they are contravariant components in this basis.
Step 2 — solve for e 1 = ( a , b ) . Perp to e 2 = ( 1 , 1 ) : a + b = 0 . And e 1 ⋅ e 1 = a = 1 . So a = 1 , b = − 1 : e 1 = ( 1 , − 1 ) .
Why this step? Two scalar conditions fix the 2 unknowns exactly.
Step 3 — solve for e 2 = ( c , d ) . Perp to e 1 = ( 1 , 0 ) : c = 0 . And e 2 ⋅ e 2 = c + d = 1 ⇒ d = 1 . So e 2 = ( 0 , 1 ) .
Why this step? Same recipe, second axis.
Step 4 — reassemble v . v 1 e 1 + v 2 e 2 = 2 ( 1 , − 1 ) + 3 ( 0 , 1 ) = ( 2 , − 2 + 3 ) = ( 2 , 1 ) = v ✓.
Why this step? This is the punchline: the covariant numbers ( 2 , 3 ) are the walk-along coefficients in the dual grid, reproducing the same arrow.
Verify: e 1 ⋅ e 1 = 1 , e 1 ⋅ e 2 = ( 1 ) ( 1 ) + ( − 1 ) ( 1 ) = 0 , e 2 ⋅ e 1 = 0 , e 2 ⋅ e 2 = 1 — all δ j i ✓. And 2 ( 1 , − 1 ) + 3 ( 0 , 1 ) = ( 2 , 1 ) ✓.
Worked example Example 6 — what breaks when axes go parallel
Family e 1 = ( 1 , 0 ) , e 2 = ( 1 , ε ) with ε → 0 + (the second axis tips down toward the first). Watch the metric.
Forecast: as ε → 0 the two axes merge. Do you expect g to stay invertible? What happens to g − 1 ?
Step 1 — metric as a function of ε . g 11 = 1 , g 12 = 1 , g 22 = 1 + ε 2 . So det g = ( 1 ) ( 1 + ε 2 ) − 1 2 = ε 2 .
Why this step? The determinant is the "volume" of the parallelogram spanned by the axes; it should vanish exactly when they align.
Step 2 — inverse blows up. g − 1 = ε 2 1 ( 1 + ε 2 − 1 − 1 1 ) . As ε → 0 every entry → ∞ .
Why this step? Raising indices needs g − 1 ; if the basis degenerates, raising becomes impossible — mathematically encoded by det g → 0 .
Step 3 — geometric meaning. With v = ( 0 , 1 ) : contravariant needs v 1 ( 1 , 0 ) + v 2 ( 1 , ε ) = ( 0 , 1 ) , giving v 2 = 1/ ε → ∞ , v 1 = − 1/ ε → − ∞ .
Why this step? To reach a tip off the near-parallel axes you must walk enormous, opposite distances — the components explode even though v is unit length.
Verify: det g = ε 2 ; at ε = 0.1 , det g = 0.01 , and v 2 = 1/0.1 = 10 , v 1 = − 10 . Sanity: − 10 ( 1 , 0 ) + 10 ( 1 , 0.1 ) = ( 0 , 1 ) ✓. Rule learned: a basis is usable iff det g = 0 ; degeneracy = the metric goes singular.
Worked example Example 7 — polar coordinates, position-dependent metric
Polar coordinates x 1 = r , x 2 = θ with line element d s 2 = d r 2 + r 2 d θ 2 , so the metric is g ij = ( 1 0 0 r 2 ) . Take f ( r , θ ) = r 2 . Find the covariant gradient ∂ i f and the contravariant (true vector) gradient ( ∇ f ) i .
Forecast: guess whether the θ -component of the raised gradient carries a factor of r 2 or 1/ r 2 .
Step 1 — read off the metric. g 11 = 1 , g 22 = r 2 (angles at radius r span arc length r d θ ), g 12 = 0 . Inverse: g 11 = 1 , g 22 = 1/ r 2 .
Why this step? Here g depends on position — this is the essential new feature versus Cells A–F.
Step 2 — covariant gradient. ∂ r f = 2 r , ∂ θ f = 0 . So ∂ i f = ( 2 r , 0 ) .
Why this step? ∂ i f = ∂ f / ∂ x i naturally carries a lower index — differentiation w.r.t. a contravariant coordinate produces a covector (see Tensors and index notation ).
Step 3 — raise to get the true gradient vector. ( ∇ f ) i = g ij ∂ j f : ( ∇ f ) 1 = g 11 ∂ r f = 2 r ; ( ∇ f ) 2 = g 22 ∂ θ f = ( 1/ r 2 ) ( 0 ) = 0 .
Why this step? Only after raising with g ij does the gradient point the way steepest ascent physically points (General relativity — raising and lowering indices ).
Verify: For f = r 2 , physically ∣∇ f ∣ = ∣ df / d r ∣ = 2 r (radial). Compute ∣∇ f ∣ 2 = g ij ( ∇ f ) i ( ∇ f ) j = 1 ⋅ ( 2 r ) 2 + r 2 ⋅ 0 = 4 r 2 , so magnitude = 2 r ✓. In Cartesian f = x 2 + y 2 , ∇ f = ( 2 x , 2 y ) , ∣∇ f ∣ = 2 x 2 + y 2 = 2 r ✓ — same invariant.
Worked example Example 8 — the "wrong pairing" trap
Word problem. A surveyor lays out a skew grid e 1 = ( 1 , 0 ) , e 2 = ( 1 , 1 ) . A pipeline runs as v = ( 2 , 1 ) . She needs the pipeline's true length-squared (an inner-product invariant). A rushing student computes ∑ i ( v i ) 2 . Show why that is wrong and give the right number.
Forecast: naïve ∑ ( v i ) 2 = 1 2 + 1 2 = 2 . But the honest length of ( 2 , 1 ) is 5 . Which is right?
Step 1 — the invariant rule. A coordinate-free scalar must contract one up with one down : ∣ v ∣ 2 = v i v i = g ij v i v j .
Why this step? Only up-with-down survives a change of basis (A and A − 1 cancel). Two-ups-summed depends on the (wrong) assumption g = δ .
Step 2 — correct contraction. From Ex 3: v i = ( 1 , 1 ) , v i = ( 2 , 3 ) . Then v i v i = ( 1 ) ( 2 ) + ( 1 ) ( 3 ) = 5 .
Why this step? This is the pairing the rule demands.
Step 3 — the trap's number. ∑ i ( v i ) 2 = 1 + 1 = 2 ; ∑ i ( v i ) 2 = 4 + 9 = 13 . Neither equals 5 — both are basis-dependent junk.
Why this step? To show concretely that both same-level sums fail.
Verify: Background-Cartesian truth: v = ( 2 , 1 ) , ∣ v ∣ 2 = 2 2 + 1 2 = 5 ✓. Equals v i v i = 5 ✓. The pipeline is 5 ≈ 2.236 units. Exam moral: always sum a staircase, one index up + one down.
Recall Which cell am I in? (fast triage)
Diagonal g with all 1 s? ::: Cell A — components coincide.
Diagonal g , entries = 1 ? ::: Cell B — perpendicular but scaled; v i = v i .
g 12 > 0 ? ::: Cell C — acute skew; covariant overshoots.
g 12 < 0 ? ::: Cell D — obtuse skew; covariant undershoots.
det g → 0 ? ::: Cell F — degenerate; g − 1 blows up, no raising possible.
g depends on position? ::: Cell G — curvilinear; gradient must be raised.
Mnemonic One-line recap of the whole page
Geometry → metric → components. Compute g ij = e i ⋅ e j first, always . Then v i by walking along axes, v i = g ij v j by dropping perpendiculars, and pair up-with-down for anything real.