Intuition The one core idea
You want to steer a machine (rocket, drone, robot arm) optimally , but you can only see it through noisy, incomplete sensors. LQG's whole game is: build a running best-guess of the true state, then act on that guess exactly as if it were the truth — and a small miracle called the separation principle proves this two-step plan is still the best you could ever do.
This page assumes you have seen none of the notation in the parent note. We build every letter, arrow, and squiggle from the ground up, in an order where each rung of the ladder rests on the one below it. If you have read the parent LQG topic and hit a symbol you couldn't parse, this is the page that fixes it.
Before any letters, picture the object we control.
Intuition A machine as a moving dot in a room
Think of the thing we control as a dot . We push on it (control), the wind shoves it (noise), and we watch it through a smudged window (measurement). Every symbol below is just a label for one of those pieces.
x
x is a list of numbers that completely describes the machine right now — enough that, if you also knew the pushes, you could predict what happens next. For a moving cart it might be x = ( position , velocity ) .
Picture: in figure s01, we draw the two-number state x = ( position , velocity ) as a single dot in a state plane — one axis is position, the other is velocity. The dot's location is the state; the axes are not the room, they are the two state coordinates.
Why the topic needs it: everything in LQG — steering, estimating, cost — is measured relative to the state . Our whole goal will be "drive x to zero" (bring the dot to the target at the origin).
Intuition Why write it as a column, not just "position and velocity"?
Stacking the numbers into a column vector lets one clean symbol x stand for any number of quantities. Two-wheeled robot? x has 6 numbers. Satellite attitude? maybe 12. The maths never changes shape — only the height of the column does. See State-space Representation .
Definition Column vector, and the transpose
⊤
A column vector is numbers stacked vertically. The transpose x ⊤ tips that column onto its side into a row . Nothing changes about the numbers — only their orientation, so they can be multiplied.
Why we ever need x ⊤ : to build a single number out of a vector's size we compute x ⊤ x = x 1 2 + x 2 2 + … — the sum of squares, i.e. how far the dot is from the origin, squared. A row times a column collapses a whole vector into one honest number. That single number is what we will try to make small.
x ⊤ x and x x ⊤ are the same thing."
Why it feels right: both just multiply x by itself.
Why it's wrong: x ⊤ x (row × column) is one number (a length²). x x ⊤ (column × row) is a whole matrix (a grid). Order decides the shape.
Fix: row-then-column ⇒ scalar; column-then-row ⇒ matrix.
A matrix is a rectangular grid of numbers that eats one vector and spits out another — it rotates, stretches, and mixes the numbers. Feeding x into matrix A (written A x ) gives a new vector.
Picture: a matrix is an arrow-bender . Give it the arrow x ; it hands back a different arrow A x .
The three named grids each need one more symbol first — the control u (what you push with) and the noises w , v — so we introduce those now , before writing any equation that uses them.
u
u is what you get to choose — the throttle, the steering, the thruster command. It is the arrow you apply to move the machine. In figure s01 it is the push arrow.
Now the three named grids, each answering one physical question:
Definition The three system matrices
A — the dynamics grid. Answers "if I do nothing, where does the state drift?" It turns the current state x into a velocity contribution A x .
B — the input grid. Answers "how does my push u move the state?" Turns control u into a velocity contribution B u .
C — the measurement grid. Answers "what does my sensor actually see?" Turns the true state x into the clean reading C x .
Why the topic needs them: they are the rules of the room . Every equation in LQG is these three grids plus noise. See State-space Representation .
x ˙
x ˙ (read "x -dot") is how fast x is changing per second — its velocity. If x is where the dot is, x ˙ is which way and how fast it's sliding.
Why this notation and not, say, "Δ x "? Because the machine changes continuously , not in jumps. The overdot is the derivative — the instantaneous rate — which is the only honest way to describe smooth motion. It answers "where is the dot heading this very instant?"
Putting §3 and §4 together (with u , w , v already named) gives the state and measurement equations :
x ˙ = A x + B u + w , y = C x + v
Read the first in plain words: the velocity of the dot ( x ˙ ) is: its natural drift ( A x ) plus the effect of my push ( B u ) plus a random shove ( w ) . The second says: what the sensor reports ( y ) is the clean projection of the truth ( C x ) plus sensor error ( v ) .
u was defined in §3; the measurement y appeared just above. Here we name what we build from y .
y
y = C x + v is what the sensor reports : the clean truth C x (only a part of the state, whatever C lets through) blurred by noise v . It is what you see , not what is .
x ^ (read "x-hat")
The hat means "our best guess of" . x ^ is our reconstructed idea of the true state, built from measurements. The whole reason it exists: we never get x directly, only y .
Intuition Truth vs. guess vs. reading — three different dots
There are three dots in the story: the true state x (which nature hides), the measured shadow y (blurred and flattened by C and v ), and our guess x ^ (which we compute and steer by). Figure s03 shows all three. The gap between true and guess gets its own symbol next.
Definition Estimation error
e
e = x − x ^ — how wrong our guess is. The distance between the true dot and the guessed dot. If the filter is good, e stays tiny.
We named w and v in §3; now we say precisely how big they are.
Definition Gaussian noise and its size
w ∼ N ( 0 , W ) : process noise is Gaussian , centred at 0, with spread described by the matrix W .
v ∼ N ( 0 , V ) : measurement noise is Gaussian , centred at 0, with spread described by the matrix V .
N means "bell-curve random" (Gaussian). The 0 says the noise has no bias — equally likely either way. W and V say how big each noise typically is.
Why "0"? If noise had an average other than zero it would be a known drift, and we'd fold it into A or B . True noise averages out — hence centred at 0.
W and V are "trust dials"
W (size of the process noise w ) and V (size of the sensor noise v ) are the two dials the filter reads. Big W = the world is chaotic, don't trust your model. Big V = the sensor is rubbish, don't trust your reading. This is the G (Gaussian) in LQG.
Definition The weighting matrices
Q and R
Q — how much you hate being off-target . Multiplies the state error.
R — how much you hate spending effort . Multiplies the control.
The cost we minimise is
J = ∫ 0 ∞ ( off-target badness x ⊤ Q x + effort badness u ⊤ R u ) d t .
Intuition Why square, and why integrate?
Squaring (that's what x ⊤ Q x is — a weighted sum of squares) makes badness always positive and punishes big errors far more than small ones. The integral ∫ 0 ∞ … d t just adds up the badness over all time — total pain from now until forever. Minimising J = "be least-bad, summed across the whole future." This is the Q (Quadratic) in LQG.
The two ordering constraints you'll meet:
Q ⪰ 0 ("positive semi definite"): badness is never negative — you can be neutral about some directions.
R ≻ 0 ("positive definite"): every push costs something — you can't get free control.
Definition The generic vector
z , matrix M , and the curly ⪰ / ≻ symbols
Let M stand for any square matrix and z for any column vector you feed it. The number z ⊤ M z (a row × matrix × column, so a single number — see §2) measures how much M "curves up" in the direction z . Then:
M ⪰ 0 means z ⊤ M z ≥ 0 for every choice of z — a bowl that never dips below the floor.
M ≻ 0 is the strict version: z ⊤ M z > 0 for every nonzero z — it curves up in every direction, no flat valleys.
These four are outputs — you don't choose them, you solve for them.
Definition The value function
V ( x ) and the cost-to-go matrix P
V ( x ) (read "the value function at state x ") is the cheapest total future cost J you can achieve if you start at state x right now and play optimally forever. For our linear-quadratic problem it turns out to have the shape V ( x ) = x ⊤ P x , a quadratic bowl (see §2 for x ⊤ ( ⋅ ) x ). The matrix P inside it is that bowl: its height above any point is the unavoidable future cost from there.
Σ — the uncertainty blob
Σ = E [ e e ⊤ ] is the error covariance : how fat and which-way-tilted the cloud of possible guessing-errors e is. Small Σ = confident, tight guess. The symbol E [ ⋅ ] means "average over all the random outcomes."
K — control gain, L — filter gain
K turns your guess into an action: u = − K x ^ . Bigger K = harder correction.
L turns your surprise into a nudge on the guess. Bigger L = trust the sensor more.
Both are squeezed out of Riccati equations (see Riccati Equation ) — one for the controller (P ), one dual copy for the filter (Σ ). That duality is the engine behind the separation principle .
Definition Controllability & Observability
Controllable = your pushes u can actually reach every corner of the state — nothing is stuck out of your influence.
Observable = the sensor C eventually reveals every part of the state — nothing hides forever.
Without these two, no K or L can exist. See Controllability and Observability .
Definition Eigenvectors, eigenvalues ("poles"), and stability
For a matrix M , an eigenvector is a special direction that M only stretches (never rotates); the matching eigenvalue is the number saying by how much it stretches along that direction. So: eigenvector = the direction, eigenvalue = the scaling factor. For z ˙ = M z , if every eigenvalue of M has a negative real part , all motions decay to zero — the system is stable . The separation principle is literally a statement about which eigenvalues the closed loop has.
State equation x-dot = Ax + Bu + w
Estimate x-hat and error e
Kalman gain L via Riccati
Controllability and Observability
Eigenvalues and stability
Cover the right side and answer aloud; reveal to check.
What does x ⊤ x compute, and is it a number or a matrix? The sum of squares of x 's entries — the squared length. It is a single number (scalar).
What does the overdot in x ˙ mean? The instantaneous rate of change of x (its derivative / velocity).
In x ˙ = A x + B u + w , name each of A , B , u , w . A = natural drift/dynamics, B = how the control u acts, u = the control you choose, w = random process noise.
Why can't we just steer using the measurement y directly? y = C x + v shows only part of the state (C ) and is corrupted by noise (v ); we must reconstruct x ^ first.
What is e , in one phrase? The estimation error x − x ^ — how wrong our guess is.
What do N ( 0 , W ) and N ( 0 , V ) tell you about w and v ? Both are Gaussian, unbiased (mean 0); W and V describe the spread/size of the process and measurement noise respectively.
Why is the cost quadratic (x ⊤ Q x + u ⊤ R u )? Squaring keeps badness positive and punishes large errors and efforts disproportionately, and it makes the optimal law linear.
Difference between Q ⪰ 0 and R ≻ 0 ? Q may be flat in some directions (z ⊤ Q z ≥ 0 ); R must curve up in every direction (z ⊤ R z > 0 for nonzero z ) so all control costs something.
What is the value function V ( x ) and how does P appear in it? V ( x ) is the cheapest total future cost from state x ; for LQ it equals x ⊤ P x , so P is the cost-to-go bowl.
What do the gains K and L each do? K turns the estimate into a control action u = − K x ^ ; L turns the innovation/surprise into a correction of the estimate.
Eigenvector vs eigenvalue — which is the direction and which the number? The eigenvector is the direction the matrix only stretches; the eigenvalue is the scalar telling by how much.
What must be true of a matrix's eigenvalues for stability? Every eigenvalue must have a negative real part, so all motions decay to zero.
Which two structural properties must the system have for K and L to exist? Controllability (pushes reach every state) and observability (sensor reveals every state).