Hadamard Well-Posedness

Why Well-Posedness Matters for Imaging

Every imaging system can be abstractly described by a forward model

y=Ax,y = \mathcal{A} x,

where xx is the unknown scene (reflectivity, permittivity, etc.) and yy is the measured data (scattered field, projections, etc.). The inverse problem is to recover xx from yy.

In practice, we never observe yy exactly — we have noisy data yδ=y+ηy^\delta = y + \eta with ηδ\|\eta\| \leq \delta. The central question of this chapter is: does a small perturbation in the data lead to a small perturbation in the reconstruction? If not, the problem is ill-posed, and naive inversion will catastrophically amplify noise.

Hadamard formalised these ideas in 1902, establishing three conditions that a well-posed problem must satisfy. Most imaging inverse problems fail at least one of these conditions, motivating the entire theory of regularization developed in this chapter.

Historical Note: Jacques Hadamard and the Origins of Well-Posedness

1902–1963

Jacques Hadamard (1865–1963) introduced the concept of well-posedness in his 1902 paper Sur les problèmes aux dérivées partielles et leur signification physique, in the context of partial differential equations. He observed that physically reasonable problems should have solutions that exist, are unique, and depend continuously on the data — otherwise the model fails to capture reality.

For nearly half a century, ill-posed problems were considered pathological and unworthy of study. It was only with Tikhonov's work in the 1940s–1960s that a systematic theory for solving ill-posed problems was developed, transforming them from curiosities into the central challenge of inverse problems — and of computational imaging.

Definition:

Hadamard Well-Posedness

Let A ⁣:XY\mathcal{A} \colon \mathcal{X} \to \mathcal{Y} be an operator between normed spaces. The equation Ax=y\mathcal{A} x = y is well-posed in the sense of Hadamard if all three of the following conditions hold:

  1. Existence: For every yYy \in \mathcal{Y}, there exists at least one xXx \in \mathcal{X} such that Ax=y\mathcal{A} x = y (equivalently, A\mathcal{A} is surjective).

  2. Uniqueness: For every yYy \in \mathcal{Y}, there is at most one xXx \in \mathcal{X} such that Ax=y\mathcal{A} x = y (equivalently, A\mathcal{A} is injective).

  3. Stability (continuous dependence on data): The inverse mapping A1\mathcal{A}^{-1} is continuous: if ynyy_n \to y in Y\mathcal{Y}, then A1ynA1y\mathcal{A}^{-1} y_n \to \mathcal{A}^{-1} y in X\mathcal{X}.

A problem that fails any of these conditions is called ill-posed.

In finite dimensions, if A\mathcal{A} is a square invertible matrix, all three conditions hold automatically — the inverse is a matrix, hence continuous. Ill-posedness is fundamentally an infinite-dimensional phenomenon, though discrete approximations inherit it through large condition numbers.

,

Well-Posed Problem

A problem Ax=y\mathcal{A}x = y is well-posed (in the sense of Hadamard) if a solution exists for every datum yy, the solution is unique, and it depends continuously on the data. A problem failing any condition is ill-posed.

Related: Compact operator, Degree of Ill-Posedness

Degree of Ill-Posedness

The degree of ill-posedness of a linear inverse problem is characterised by the decay rate of the singular values σk\sigma_k of the forward operator A\mathcal{A}: polynomial decay σkkp\sigma_k \sim k^{-p} gives mildly ill-posed problems; exponential decay σkeckβ\sigma_k \sim e^{-ck^\beta} gives severely ill-posed problems.

Related: Well-Posed Problem

Example: Failure of Existence: Limited-Angle Tomography

In X-ray computed tomography, the forward operator is the Radon transform R\mathcal{R}, which maps a 2D density function f(x,y)f(x,y) to its line integrals. In limited-angle tomography, measurements are available only for projection angles θ[θ0,θ1]\theta \in [\theta_0, \theta_1] with θ1θ0<π\theta_1 - \theta_0 < \pi.

Explain why the limited-angle Radon transform is not surjective onto L2L^2, so the existence condition fails for generic data.

Example: Failure of Uniqueness: Null Space of the Forward Operator

Consider 1D deconvolution where the forward operator is convolution with a band-limited kernel hh satisfying h^(ω)=0\hat{h}(\omega) = 0 for ω>ωc|\omega| > \omega_c. Show that uniqueness fails.

Example: Failure of Stability: Compact Operators

Let A ⁣:XY\mathcal{A} \colon \mathcal{X} \to \mathcal{Y} be an injective compact operator between infinite-dimensional Hilbert spaces. Show that A1 ⁣:R(A)X\mathcal{A}^{-1} \colon \mathcal{R}(\mathcal{A}) \to \mathcal{X} is unbounded, so stability fails.

Theorem: Compact Operators Yield Ill-Posed Problems

Let A ⁣:XY\mathcal{A} \colon \mathcal{X} \to \mathcal{Y} be a compact linear operator between infinite-dimensional Hilbert spaces with N(A)={0}\mathcal{N}(\mathcal{A}) = \{0\}. Then the equation Ax=y\mathcal{A} x = y is ill-posed: the inverse A1 ⁣:R(A)X\mathcal{A}^{-1} \colon \mathcal{R}(\mathcal{A}) \to \mathcal{X} is discontinuous.

Compact operators compress infinite-dimensional information into a rapidly decaying sequence of singular values. Inverting this compression requires dividing by these vanishing singular values, which amplifies any perturbation without bound.

,

Ill-Posedness in Standard Imaging Operators

ModalityForward OperatorFailing ConditionSingular Value DecayDegree
SAR / Stripmap RadarBand-limited Fourier restrictionUniqueness (null space of high frequencies)σkk1/2\sigma_k \sim k^{-1/2} (mild)Mildly ill-posed
X-ray CT (full angle)Radon transformStabilityσkk1/2\sigma_k \sim k^{-1/2}Mildly ill-posed
Limited-angle CTTruncated Radon transformExistence + StabilityExponential in angular gapSeverely ill-posed
Gaussian DeblurringConvolution with eσ2ω2/2e^{-\sigma^2\omega^2/2}Stabilityσkeck2\sigma_k \sim e^{-ck^2}Severely ill-posed
Microwave TomographyVolume integral equation (Born)Stabilityσkk1\sigma_k \sim k^{-1}Mildly ill-posed

Why This Matters: Ill-Posedness in RF Imaging Systems

Virtually all RF imaging modalities involve compact forward operators, making them ill-posed:

  • Synthetic Aperture Radar (SAR): The scattering operator maps the scene reflectivity to the received signal. The finite aperture and bandwidth limit the observable spatial frequencies, creating a band-limited (hence compact) forward operator.

  • Ground-Penetrating Radar (GPR): Subsurface permittivity profiles are mapped to surface measurements through a Green's function integral operator, which is compact due to the smoothing effect of wave propagation.

  • Microwave Tomography: The scattered field is related to the contrast function through a volume integral equation. The integral operator is compact, and the nonlinear dependence of the scattered field on the contrast makes the problem doubly challenging.

  • Near-Field to Far-Field Transformation: The near-to-far-field operator is compact, and exponential decay of evanescent modes means that near-field details are severely attenuated in far-field data.

In every case, the singular values of the discretized forward operator exhibit rapid decay, and the condition number grows with the problem size — a hallmark of ill-posedness.

See full treatment in Kronecker Product Structure of the Sensing Matrix

Common Mistake: Discrete Systems Can Be Invertible Yet Severely Ill-Conditioned

Mistake:

Believing that because a discretized imaging system Ax=y\mathbf{A}\mathbf{x} = \mathbf{y} has a unique solution (when A\mathbf{A} is square and invertible), the problem is well-posed and can be solved by direct inversion.

Correction:

A finite-dimensional system is always well-posed in Hadamard's sense if A\mathbf{A} is invertible — the inverse is automatically continuous in finite dimensions. However, the condition number κ(A)=σ1/σn\kappa(\mathbf{A}) = \sigma_1/\sigma_n can be astronomically large, making the problem effectively ill-posed for any practical noise level.

As the discretization is refined (nn \to \infty), κ(An)\kappa(\mathbf{A}_n) \to \infty, reflecting the unboundedness of A1\mathcal{A}^{-1}. Regularization is necessary for the discrete problem just as for the continuous one.

Quick Check

For the integral operator (Ax)(t)=01e(ts)2x(s)ds(\mathcal{A}x)(t) = \int_0^1 e^{-(t-s)^2} x(s)\,ds on L2([0,1])L^2([0,1]), which Hadamard condition fails first?

Existence

Uniqueness

Stability

All three conditions fail

⚠️Engineering Note

Condition Number as a Practical Ill-Posedness Metric

In software-defined radar and microwave imaging systems, the condition number κ(A)=σ1/σn\kappa(\mathbf{A}) = \sigma_1/\sigma_n of the discretized sensing matrix is routinely computed before choosing a reconstruction strategy:

  • κ<100\kappa < 100: Standard least-squares or CGLS without regularization.
  • κ[100,106]\kappa \in [100, 10^6]: Tikhonov regularization with the L-curve or discrepancy principle for parameter selection.
  • κ>106\kappa > 10^6: Truncated SVD or sparsity-promoting regularization required; standard Tikhonov may over-smooth.

For SAR systems, the condition number grows with the scene size NN as κN0.5\kappa \sim N^{0.5} (mildly ill-posed), while microwave tomography in strongly scattering media can reach κN1.5\kappa \sim N^{1.5} due to the multiple-scattering contribution.

Key Takeaway

Hadamard's three conditions — existence, uniqueness, stability — define well-posedness. Most RF imaging inverse problems fail the stability condition because their forward operators are compact with decaying singular values. The degree of ill-posedness is quantified by the decay rate of σk\sigma_k: polynomial decay gives mild ill-posedness; exponential decay gives severe ill-posedness. Discrete ill-posedness manifests as large condition numbers — regularization is needed regardless of whether one works in the continuous or discrete setting.