TLDR
- Estimate a state, not a history.The state-transition description turns a lengthening record into a fixed-size recursive problem.
- New information is an innovation.Only the component of a measurement not predictable from earlier measurements can improve the estimate.
- Uncertainty moves with the estimate.A nonlinear covariance recursion determines how strongly each new observation should count.
- Filtering has conditions.Gaussianity or a linear-estimator restriction and quadratic loss carry the optimality claim.
- Estimation mirrors regulation.Kalman’s duality swaps observations for controls and estimation error for controlled state.
Stop solving the entire past again
Kalman’s new approach is not merely a smoother formula for the old Wiener calculation. It changes the object presented to the calculator: from an impulse response obtained through a global equation to a state that can be carried forward one observation at a time.
The paper opens with three practical tasks. Prediction asks for a future random signal. Separation tries to recover signal from random noise. Detection asks whether a known form is present in noise. Classical Wiener theory had connected the first two to a Wiener–Hopf integral equation and solved an important stationary, rational-spectrum case by spectral factorisation. Extensions existed, but Kalman lists the costs: the answer arrived as an impulse response that still had to be synthesised; numerical determination was awkward; growing memory and nonstationarity demanded new derivations; and the assumptions could disappear inside difficult mathematics.
The state-transition formulation changes the computational rhythm. Instead of recomputing a coefficient for every old observation whenever a new datum appears, it preserves a finite-dimensional estimate and an error covariance. The new observation changes those two summaries; the next prediction begins from them. This does not abolish history. It states a model under which the relevant influence of history is compressed without loss for the declared estimation problem.
That compression is why “recursive” matters. It describes a dependency: today’s answer is calculated from yesterday’s answer and today’s observation. It also describes an engineering fit. A machine can update fixed-size matrices as data arrive. Kalman explicitly points to machine computation for complex numerical instances, while keeping the derivation general enough for stationary or nonstationary statistics and finite, growing or infinite observation memory.
Worked example · a temperature stream
A laboratory thermometer reports 20.4, 19.7, 20.1 and 20.0 degrees. A batch least-squares calculation can retain all four numbers and refit. A recursive estimator instead carries yesterday’s temperature estimate and its uncertainty. On receiving 20.0, it predicts, compares 20.0 with that prediction, applies a weight determined by uncertainty and stores the corrected pair. The compression is valid only because the temperature dynamics and observation model declare what the pair must summarise.
Causal probe · make the omitted past matter
Suppose the thermometer acquires a slowly drifting bias but the state includes temperature alone. Two histories with the same current estimate and variance can imply different future errors because their bias histories differ. The recursion now loses relevant information. Add bias as a state component and the compression can become valid again. The test is not whether a vector is short; it is whether equal states imply the same future estimation problem.
Smoothing, filtering and prediction are one estimation problem
The target time, not the machinery, separates three familiar tasks. Kalman writes them together so that a single projection and state-transition argument can cover the past, present and future.
Let observations be available from time t₀ through t, and let the quantity of interest belong to time t₁. If t₁ is earlier than t, later observations help reconstruct the past: data smoothing or interpolation. If t₁ equals t, the task is filtering: infer the current hidden quantity from observations available now. If t₁ lies after t, the task is prediction. The paper uses estimation as the collective name. This timeline matters because casual descriptions often call every operation “prediction”, hiding which information was legally available.
The observation is itself a random variable. In Kalman’s motivating signal-and-noise formulation, only their sum is visible. A realised list of observations does not reveal the corresponding hidden signal values; it changes the conditional distribution over them. A decision rule chooses an estimate to minimise average loss under that conditional distribution. For quadratic loss, the conditional mean is the minimiser under the paper’s conditions. The state-space method then supplies a recursive way to compute the relevant linear conditional estimate.
This is an information discipline. A smoothed estimate may use observations that occurred after the state being estimated, whereas an online filter may not. A one-step-ahead prediction can use the corrected state through the present, but not tomorrow’s measurement. Reported accuracy becomes misleading if these lanes are mixed. Kalman’s notation x*(t₁|t) keeps the target time and the last observation time visible at once.
Worked example · locating a vehicle at noon
Estimate the vehicle’s 12:00 position. A real-time answer issued at 12:00 is filtering. A reconstruction produced at 12:10 using ten later measurements is smoothing. An answer produced at 11:55 is prediction. All three may use the same motion model and least-squares geometry, yet they answer different evidential questions. Comparing their error without recording the information cut-off rewards the smoother for seeing the future.
Causal probe · move only the information boundary
Keep the motion, noise and target time fixed, then allow one extra measurement after the target. If the estimate changes, the method was smoothing rather than filtering. Conversely, remove the most recent measurement from a forecast and its uncertainty should generally increase. The intervention changes no physical state; it changes only which observations belong to the conditioning set.
The best linear estimate is a shadow on the observation space
Kalman brings a geometric fact from probability theory into control engineering: with quadratic loss, estimating from observations is an orthogonal-projection problem.
Form the linear manifold Y(t) from all linear combinations of observations y(t₀), …, y(t). Think of each zero-mean finite-variance random variable as a vector, with inner product E(uv). Two variables are orthogonal when their expected product is zero. Any target x can then be decomposed uniquely into a component x* inside Y(t) and a residual x̃ orthogonal to every vector in Y(t). Pythagorean geometry applies in mean square: the error to any other candidate w in the observation space equals the irreducible orthogonal error plus the squared distance from x* to w.
That identity makes x* the unique minimum-mean-square member of the linear observation space. Kalman’s Theorem 2 adds the statistical bridge. If target and observations are jointly Gaussian, conditional expectation is linear, so the projection is the unrestricted quadratic-loss conditional mean. Alternatively, without Gaussianity, one may explicitly restrict the admissible estimate to a linear function and retain quadratic loss. These routes are not interchangeable: Gaussianity supports the stronger claim; the linear restriction defines a narrower optimisation problem.
The residual’s orthogonality is more than a proof device. It becomes a diagnostic. If an estimation error remains correlated with an available linear combination of observations, then that direction could still reduce mean-square error. At the optimum, no such linear correction remains. But zero correlation is not general independence. In the Gaussian case it becomes independence; outside it, higher-order dependence may remain invisible to this geometry.
Worked example · two noisy readings
Let two centred readings have equal variance and let the target correlate twice as strongly with the first as with the second. The projection solves normal equations that choose two coefficients. The resulting residual has zero expected product with each reading. A simple average need not have that property. The projection is “best” because any coefficient change adds a component inside the observation plane and therefore adds non-negative squared length to the error.
Causal probe · preserve covariance, change tails
Replace a Gaussian signal-and-noise pair with a non-Gaussian pair having the same means and covariances. The best linear estimator and its mean-square error stay the same because projection uses second-order structure. The unrestricted conditional mean can change because higher-order distributional information changed. This intervention locates precisely where a claim of overall optimality requires Gaussianity.
An observation matters only through its innovation
A new measurement contains a predictable part and an orthogonal remainder. The filter need process only that remainder because the predictable part is already represented by previous observations.
Let Y(t−1) be the space generated by earlier observations. Project the new y(t) onto that space. The residual ỹ(t|t−1)=y(t)−y*(t|t−1) is the innovation. By construction it is orthogonal to every earlier-observation direction. If the innovation is identically zero, the new measurement adds no linear information and Y(t) equals Y(t−1). In a physically meaningful noisy measurement process, Kalman expects a non-degenerate innovation that contributes a new direction.
The innovation provides a recursive orthogonal basis. Past measurements have already been absorbed; the new estimate is the old prediction plus a linear transformation of the new orthogonal component. In modern explicit-noise notation this becomes corrected estimate = predicted estimate + gain × (measurement − predicted measurement). The parenthesis is not the raw measurement. It is the surprise relative to what the model and past data already predicted.
Calling innovation “surprise” can mislead if it suggests a psychological quantity. It is a model-relative residual. A large innovation may indicate an unusual random draw, a changing hidden state, a failed sensor, a wrong transition matrix or a missing bias variable. The update formula decides how far to move only after comparing predicted uncertainty with observation uncertainty. Innovation supplies direction; uncertainty supplies trust.
Worked example · a redundant sensor message
A controller has already inferred that a duplicated digital channel will repeat the first channel bit for bit. When the duplicate arrives, its predicted value equals its value and its innovation is zero. Counting it as an independent second observation would falsely halve uncertainty. The projection view refuses the duplicate a new basis direction. If the channels instead have independent measurement errors, their innovations are not identical and the second can add information.
Causal probe · keep the value, change predictability
Present the same numerical reading, 42, under two histories. In one, the filter predicted 41.9 with low uncertainty; in the other it predicted 30 with high uncertainty. The raw datum is unchanged, but the innovations are 0.1 and 12. The correction must differ. This intervention shows why a filter cannot assign evidential weight from measurement magnitude alone.
Dynamics propagate both the hidden state and its uncertainty
The filter needs a causal model of how a state advances and how it becomes observable. Kalman’s 1960 notation deliberately places those relations before the recursion.
For the discrete problem, the hidden state follows x(t+1)=Φ(t+1;t)x(t)+u(t). The transition matrix Φ carries the old state forward. The random excitation u has zero mean, is Gaussian in the stated model and is uncorrelated across distinct times; its covariance is Q(t). The observation is y(t)=M(t)x(t). Unlike the modern classroom form y=Mx+v, the paper does not require a separate discrete-time measurement-error term: measurement noise can be represented by additional state variables. Kalman expressly notes this modelling choice.
State is causal bookkeeping. Its components need not be directly observed, but once x(t) is given, Φ specifies how the model transports it. The observation matrix M selects or mixes state components into measured quantities. Q describes uncertainty injected between samples. A time-varying Φ, M or Q is allowed. That feature is central to the paper’s contrast with stationary Wiener methods.
The matrices are not learned by the filter. Kalman says the practical situation is often reversed: one may know a covariance from experimental data and have to estimate a model. He recommends optimising model fit and state estimation jointly where possible, while acknowledging no general study of that joint problem. The filtering theorem begins after the modeller supplies Φ, M, Q and the initial covariance. An elegant recursion cannot repair an omitted force or a mislabelled sensor.
Worked example · position and velocity
Let x=[position, velocity]′ and choose Φ=[[1,1],[0,1]] for unit sampling time. Position advances by one velocity interval; velocity persists. A process covariance Q admits unmodelled acceleration. If M=[1,0], the sensor observes position alone. Velocity is nevertheless estimable because transition couples it to later positions. If that coupling is removed, repeated position readings cannot reveal a separate hidden velocity component.
Causal probe · remove observability
Keep every measurement value and noise covariance fixed, but change M so the measured channel no longer depends on one state direction, while Φ never rotates that direction into view. Corrections along it disappear and its uncertainty cannot be reduced by data. This is a structural loss of observability, not an unlucky noise sequence. More measurements of the same blind projection do not solve it.
Before seeing the datum, widen the error covariance
Prediction transports the estimated state through the dynamics. Its covariance must also travel: and must admit the uncertainty injected by the process.
Suppose the estimate available after the preceding observation has mean m⁺ and covariance P⁺. In explicit modern notation, the one-step prediction is m⁻=Φm⁺ and P⁻=ΦP⁺Φ′+Q. The superscripts are pedagogical labels rather than Kalman’s original stars and time bars. The first equation propagates a centre. The second propagates a shape: uncertainty is stretched and rotated by Φ, while Q adds the dispersion of new unobserved excitation.
Even when the mean dynamics are deterministic, uncertainty need not shrink. If Φ amplifies a poorly known direction, predicted covariance expands along it. If Q is positive, time without observation generally adds uncertainty. Cross-covariances matter: a position observation can correct velocity only when the covariance couples them. Reading each diagonal variance in isolation hides how information travels through the state.
Covariance is not an error bar painted after the fact. It determines the future update weight. Understate P⁻ and the filter discounts a useful measurement; overstate it and the estimate chases noise. Positive semidefiniteness is therefore both mathematical structure and a software invariant. Round-off, an inconsistent covariance update or an invalid Q can create negative variances even when a formula looks plausible.
Worked example · a drifting scalar
Start with mean 10 and variance 1. Let the transition be identity and process variance Q=0.5. Before any new reading, the predicted mean remains 10 but predicted variance becomes 1.5. Time conveyed no directional evidence about the mean, yet it weakened confidence because an unseen disturbance may have occurred. With Q=0, the same prediction would preserve variance 1.
Causal probe · rotate uncertainty without changing its total
Choose a two-dimensional Φ that rotates the state and Q=0. The covariance eigenvalues and total trace remain unchanged, but their directions rotate. A sensor that observes only the first coordinate can now reduce a different combination of hidden directions. The intervention alters neither overall uncertainty nor measurement noise; it changes alignment between uncertainty and observability.
The gain is a covariance-made compromise
Correction compares the measured value with its prediction, then moves the state estimate by a gain chosen to minimise the next quadratic error.
In the paper’s notation, the observation weighting matrix Δ*(t) is obtained from the transition, predicted error covariance and observation matrix. Substitution eliminates the weighting matrix and yields the nonlinear covariance difference equation: the discrete Riccati recursion. In the familiar explicit-noise scalar specialisation, K=P⁻/(P⁻+R), m⁺=m⁻+K(z−m⁻), and P⁺=(1−K)P⁻. This form places measurement variance R outside the state for teaching; Kalman’s discrete model can instead absorb measurement noise into an augmented state.
Gain is neither a generic learning rate nor a fixed sensor-trust score. It changes with the ratio of predicted state uncertainty to predicted measurement uncertainty. If P⁻ is large compared with R, K approaches one and the measurement moves the estimate strongly. If R dominates, K approaches zero. The same sensor reading can therefore have a different effect after a long unobserved interval than immediately after a precise correction.
Covariance correction is the quiet half of the measurement update. A zero innovation leaves the mean unchanged, but a finite-noise observation still reduces variance: the datum confirmed the prediction and thereby supplied evidence. Conversely, a large innovation can produce only a modest mean move when the observation is noisy. The numerical residual and the weight must always be reported together.
Worked example · one exact update
Let m⁻=8, P⁻=4, measurement z=10 and R=1. The innovation is 2 and K=4/5. The corrected mean is 9.6; the corrected variance is 0.8. Direct Gaussian conditioning gives the same mean: (R·8+P⁻·10)/(P⁻+R)=48/5. If R were 16 instead, K would be 0.2, the mean would move only to 8.4 and variance would remain 3.2.
Causal probe · equal innovation, unequal trust
Hold the predicted mean and innovation fixed at 8 and 2. First set P⁻=4,R=1; then swap them to P⁻=1,R=4. The innovation direction is identical, but gains are 0.8 and 0.2. The correction reverses which source is treated as more precise. A system that moves the same amount in both cases is not using the covariance logic it claims.
Watch prediction and correction alternate
Set an initial belief, process variance, measurement variance and four readings. The laboratory runs a scalar random-walk filter, exposes every intermediate quantity and checks the update against direct Gaussian conditioning.
- waiting
- waiting
- waiting
The laboratory uses a scalar random walk: the predicted mean equals the previous corrected mean and predicted variance adds Q. Each measurement then contributes innovation z−m⁻, gain P⁻/(P⁻+R), corrected mean m⁺ and corrected variance P⁻R/(P⁻+R). This is an explicit-measurement-noise teaching form. Kalman’s primary discrete model incorporates observation noise through the state description, so the notation is modern but the projection-and-covariance logic is the same.
Read the display as two simultaneous stories. The dots show what happened to the estimated value. The bands show what happened to uncertainty. With Q high, each prediction becomes less certain between readings. With R high, measurements receive less weight. Put a measurement exactly on the predicted mean: innovation becomes zero, the mean stays still, yet the band narrows.
Worked example · process noise prevents frozen confidence
Set all four readings near three and R low. With Q=0, repeated consistent readings steadily reduce variance and later gains shrink. Raise Q to two: each prediction reintroduces uncertainty, gains remain larger and the estimate stays responsive. The filter has not “forgotten” arbitrarily; the process model declares that the hidden state can move between observations.
Causal probe · confirmation without displacement
After any step, replace the next measurement with the predicted mean. The innovation and mean correction become exactly zero. Leave R finite. Posterior variance must still fall below predicted variance. If an implementation reduces uncertainty only when the mean moves, it has confused agreement with absence of information.
Filtering and regulation exchange inputs and outputs
Kalman’s Theorem 4 makes a structural claim: the optimal-estimation recursion and the noise-free optimal-regulator recursion are dual after transposition and reversal of the appropriate time indices.
Problem I estimates an unobservable state from observed outputs. Its covariance measures estimation error; its weighting matrix tells how observations correct the estimate. Problem II begins with an observable state and chooses control inputs to minimise a quadratic performance index. Its Riccati matrix weights future state cost; its control law feeds the state back through an optimal gain. Kalman’s comparison table matches these objects row by row.
The algebraic correspondence exchanges observation constraints at the output with control constraints at the input. State transition matrices appear transposed; the estimation covariance corresponds to the regulator’s quadratic-value matrix; the observation weighting corresponds to control weighting. The paper calls the physical significance intriguing and does not pretend that sensing and acting are the same physical process. Duality is a translation between mathematical structures.
This bridge mattered because it let results and intuitions move between estimation and control. But the 1960 paper also states what it does not yet resolve: stability and convergence of the online Riccati difference equation and optimal filter require separate treatment. The duality theorem is the principal guide, not a substitute for those proofs.
Worked example · camera versus steering
A camera estimator asks which hidden position best explains pixels; a regulator asks which steering command best reduces future deviation. In a linear-quadratic model, both solve Riccati recursions. Yet swapping a camera matrix for a steering matrix in software without transposition, dimensions and time direction would be nonsense. The value of duality is that it specifies the exact transformation, not that it licenses a verbal analogy.
Causal probe · break only actuation
Keep a system fully observable but remove control authority over one unstable direction. Filtering may still estimate that direction accurately, while regulation cannot stabilise it. Reverse the intervention: retain actuation but make the direction unobservable. A regulator with complete state information remains mathematically controllable, while an output-feedback implementation loses the needed estimate. Duality maps conditions; it does not make them automatically hold together.
The theorem is powerful because its boundary is visible
Kalman’s contribution becomes clearer, not weaker, when the conditions, examples and unfinished questions are kept separate from later folklore about “the Kalman filter”.
The paper’s general result is about linear dynamics, second-order statistics and a quadratic estimation criterion. Theorem 2 either invokes joint Gaussian processes or restricts attention to linear estimates. The random excitation is Gaussian and uncorrelated across time in Problem I. The discrete observation equation omits an external additive white-noise term because such noise can be represented within the state. The initial covariance and all model matrices must be specified.
Kalman gives two nonstationary examples. The first combines a scalar signal with independent additive noise and derives a closed covariance sequence; depending on parameter ratios, the estimate can rely chiefly on prediction or give measurement appreciable weight. The second estimates position and constant unknown velocity from position observations contaminated by stationary correlated noise. The resulting estimator is a second-order dynamic system, and its large-sample behaviour recovers a straight-line least-squares intuition. These are demonstrations within constructed models, not a survey of every application later associated with the name.
The conclusion says the state viewpoint closely connects Wiener’s problem to control theory and makes a broad class of calculations tractable in one formulation. It also leaves much to be explored. The paper flags stability of the optimal filter and convergence of the Riccati equation for later work. Continuous-time complications are not solved here; Kalman and Bucy’s 1961 paper is the next canon entry precisely because it develops that lane.
For contemporary use, add numerical and modelling audits. Preserve covariance symmetry and positive semidefiniteness. Whiten and inspect innovations rather than trusting a low residual alone. Test sensitivity to Q, measurement uncertainty and unmodelled bias. Separate epistemic uncertainty about the model from the conditional covariance produced inside it. A filter can be internally exact and externally wrong.
Worked example · a confident wrong model
A tracker assumes constant velocity with tiny Q while the target manoeuvres. Repeated measurements may eventually pull the estimate, but the declared covariance can remain too narrow and innovations become serially structured. The recursion is correctly executing the wrong stochastic model. Raising Q may improve responsiveness, but the deeper remedy can be adding acceleration or switching dynamics rather than treating Q as a universal tuning knob.
Causal probe · randomise measurement order
In a time-varying dynamical model, shuffle the same numerical measurements while leaving timestamps falsely unchanged. A batch average is invariant to order; a recursive filter generally is not, because each correction changes the state from which the next prediction begins. If an implementation gives the same trace after such a shuffle, it may be ignoring dynamics or processing all readings as exchangeable.
Claims, conditions and audit handles
| Claim | Required condition | Observable check |
|---|---|---|
| The projection minimises mean-square error among linear estimates. | Finite second moments; candidate belongs to the observation manifold. | Residual is orthogonal to every included observation direction. |
| The conditional mean is represented by that linear projection. | Joint Gaussianity, or an explicit restriction to linear estimators with quadratic loss. | State which route supports the optimality statement. |
| The innovation adds a new observation direction. | It is not identically zero and is formed against all prior observations. | Innovation is uncorrelated with earlier observation combinations. |
| The covariance recursion determines the filter coefficients. | Specified Φ, M, Q and initial covariance; relevant inverses exist. | Dimensions, symmetry, positive semidefiniteness and innovation covariance pass. |
| A recursive implementation agrees with direct conditioning. | The same linear-Gaussian scalar or matrix model is used. | Compare mean and covariance at each step on small exact cases. |
| Filtering is dual to noise-free regulation. | Apply Kalman’s exact variable replacement, transposition and time reversal. | Matched Riccati recursions and compatible dimensions. |
Twelve cards for reconstructing the argument
From optimal plans to uncertain states
Paper 0063 made optimisation recursive: Bellman valued a whole plan by combining one operation with the optimal value of the transformed remainder. Paper 0064 makes estimation recursive: Kalman combines one state prediction with the orthogonal information in one new observation, while a covariance recursion carries the uncertainty needed to weight that correction. Both replace an expanding global object with a state that is sufficient for the next step, but their objectives differ. Bellman chooses an action to maximise or minimise return; Kalman estimates an unobserved random state under quadratic error.
The next paper, canon 0065, is Kalman and Bucy’s 1961 “New Results in Linear Filtering and Prediction Theory”. It develops the continuous-time theory that the 1960 paper approaches but does not complete. Keeping the two papers separate prevents the later continuous-time Kalman–Bucy equations from being read backwards into the scope of this discrete-time primary.
What this companion contributes
This companion reads Kalman’s 1960 paper as an argument about sufficient recursive information rather than as a memorised pair of textbook equations. It keeps smoothing, filtering and prediction distinct; reconstructs the Hilbert-space projection behind the least-squares estimate; shows how innovation prevents old information from being counted twice; separates state propagation from covariance propagation; and labels the familiar explicit-measurement-noise equations as a modern teaching specialisation rather than the paper’s literal observation notation.
The ten diagrams are explanatory reconstructions, not reproduced journal figures. The executable scalar laboratory exposes prediction, innovation, gain, correction and variance at every step, then verifies 256 parameter states against exact Gaussian conditioning. The evidence boundary preserves Kalman’s Gaussian or linear-estimator conditions, his supplied-model premise, his discrete-time scope and his stated open questions about stability and convergence. No inference from recursive estimation to agency, understanding or consciousness is made.
Primary and comparative sources
- R. E. Kalman, “A New Approach to Linear Filtering and Prediction Problems”, Journal of Basic Engineering 82(1), 35–45 (1960). DOI record.
- Authorised reprint in Tamer Başar (ed.), Control Theory: Twenty-Five Seminal Papers (1932–1981), IEEE Press, pp. 169–179. Readable scan with editorial commentary.
- CiNii Research, bibliographic record and publisher-PDF linkage for Kalman’s 1960 article. Record.
- R. E. Kalman and R. S. Bucy, “New Results in Linear Filtering and Prediction Theory”, Journal of Basic Engineering 83(1), 95–108 (1961). DOI record.
- N. Wiener, Extrapolation, Interpolation, and Smoothing of Stationary Time Series, MIT Press/Wiley (1949).
- G. Welch and G. Bishop, “An Introduction to the Kalman Filter”, UNC Chapel Hill, TR 95-041, revised 2006. Accessible tutorial mirror.