Forward maps, identifiability, and ill-posedness
Separate existence, uniqueness, and stability before choosing a reconstruction algorithm or a prior.
On this page
The question for today
What you’ll understand
- Identify which part of Hadamard well-posedness fails in an example.
- Distinguish an invisible nullspace from a weakly observed direction.
- State the domain, data norm, and noise assumption of an inverse problem.
A forward model predicts data from an unknown object; inversion asks which objects could have produced the observations. That reversal can fail through nonexistent solutions, indistinguishable objects, or extreme sensitivity. These failures require different remedies. We use real Hilbert spaces X and Y, a stated admissible domain D inside X, and observations yδ satisfying a deterministic bound on their distance from exact data. Statistical noise will receive a separate formulation later in the module.
A problem includes its spaces and admissible objects
Write F:D→Y and y=F(x†). The object x† may be a coefficient field, image, source term, or finite parameter vector. The data space and its norm specify what small observational error means. Choosing a stronger object norm can make inversion unstable even when a weaker norm would permit continuity. Constraints such as positivity or compact support are part of the admissible class, rather than conclusions established by a reconstruction program. They can alter both uniqueness and stability.
Hadamard well-posedness asks for existence, uniqueness, and continuous dependence of the solution on the data in the specified topologies. A noisy datum need not lie in the exact range, so even a uniquely solvable noiseless equation can become inconsistent. Least squares changes the question to approximation of the observed data; it does not automatically make the minimizer unique or stable. A small residual only says that the chosen forward model reproduces the measurements closely, not that the object is close to truth.
Uniqueness and sensitivity are different questions
For a bounded linear map A, injectivity means its nullspace is zero. If h lies in the nullspace, x and x+h give exactly the same data whenever both are admissible. No reduction of measurement noise can separate that pair using A alone. A penalty can select one representative, but that selection uses an additional convention or prior. Adding an independent measurement may remove the nullspace; merely running the same algorithm longer cannot create the missing observation.
A small but nonzero singular value gives a different situation. The corresponding object direction is theoretically identifiable, but its effect on the data is tiny. Dividing by that singular value amplifies noise. An invertible finite matrix has a continuous inverse, so its problem is formally well posed, yet the stability constant can be impractically large. For compact operators with infinite-dimensional range, singular values may tend to zero and the inverse on the range is unbounded. Finite discretizations then reveal worsening conditioning as the resolution increases.
Model error and experimental design belong in the analysis
The noise bound should account for errors in the measurements and, when appropriate, discrepancy between the assumed forward model and the physical process. If the actual data are produced by a different operator, forcing the residual below the measurement noise alone can fit model error. Calibration errors, omitted physics, and discretization error can dominate at precisely the level where an inversion appears most precise. A guarantee conditional on a correct forward map should be reported with that condition attached.
Experimental design changes what information the map carries. A second viewing angle, a different excitation, or an additional sensor can rotate or shrink its nullspace and improve its weakest singular directions. This is a different intervention from regularization, which changes how existing information is interpreted. Constraints can also restore identifiability on a restricted class without making the unrestricted map injective. A sound result therefore states both the observation scheme and the class on which uniqueness or a stability estimate has actually been proved.
Work it through
Amplification without a nullspace
Take A=diag(1,0.01), x†=(1,1), and exact data y=(1,0.01). Perturb the data by e=(0,0.01). Compute the exact inverse reconstruction and distinguish this failure from nonuniqueness.
The observed data are yδ=(1,0.02) and the Euclidean noise norm is 0.01. Both diagonal entries are nonzero, so A is injective and the inverse solution is unique.
Inverting gives xδ=(1,2). Its error from x† is (0,1), with norm one: the second component amplifies the data perturbation by a factor of 100.
The matrix has singular values 1 and 0.01, so its two-norm condition number is 100. Its inverse remains continuous in finite dimension; the example demonstrates severe conditioning rather than an exact nullspace.
A perfectly fitted datum can yield a large object error. The issue is weak observation, and a uniqueness claim alone does not control it.
The living notebook
Explore the model
Interactive lab · matrix
Compare visible compression with conditioning
Reset, set a=0.25 and b=0. Predict singular values 1 and 0.25 and condition number 4. Compare a fresh Reset, a=1 and b=0, with both singular values 1. The supported family stays invertible; it cannot display a true nullspace or the worked example's 0.01 scale. Its compression shows why inversion magnifies perturbations along a weak direction.
- Area scale · det A
- 1.4
- Singular values · σmax, σmin
- 1.597, 0.876
- Condition number · κ₂(A)
- 1.823
The selected matrix is A = [[a,b],[0,1]]. Playback interpolates geometry between the identity and A; readouts always describe A. Its determinant is a and its singular values come from AᵀA. Positive a makes every supported matrix invertible. This two-dimensional family is not a general eigensolver or a learned network. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forAn invertible map can retain uniqueness while weakening stability.
Pause & reason
Check your understanding
Your turn
Try it yourself
An unknown pair satisfies x₁+x₂=3. Describe the ambiguity. Then add the measurement x₁−x₂=1 and recover the pair.
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
The first equation has null direction (1,−1). Add and subtract the two measurements after the second is available.
Compare with the solution
The first measurement allows every pair (t,3−t), and changes along (1,−1) are invisible. The second measurement supplies an independent row, giving matrix [[1,1],[1,−1]] with determinant −2. Adding the equations gives 2x₁=4, so x₁=2; subtraction gives 2x₂=2, so x₂=1. The ambiguity is removed by changing the observation map, not by selecting a preferred point on the original line.
Keep the idea
Take it with you
- Existence, identifiability, and stability are separate requirements.
- Weak singular directions amplify errors; null directions erase information.
- Guarantees depend on the admissible class, norms, and forward-model accuracy.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.