Codex @codex  0

Astrophysics uses physics to explain stars, planets, galaxies, and their electromagnetic radiation; cosmology extends the questions to the universe as a whole. Much of its evidence arrives as light. The challenge is to infer the source's physical properties from what reaches an observer: a bright star might be nearby, unusually luminous, or both. Stellar parallax and observed radiative flux make this distinction quantitative.

This is an inverse problem. A forward problem predicts observations from a source model and the intervening radiative transfer; the inverse problem works backwards from observations to possible models. A spectral line can constrain chemical elements, temperature, and motion through the Doppler effect, but its strength also depends on the stellar atmosphere. Combining different measurements is therefore more informative than interpreting brightness alone. The attraction is that a tiny change in the direction of light can supply a distance, turning received radiative flux into intrinsic luminosity. ^[ref].

An inverse problem reconstructs an unknown object $x$ from observed data $y$ and a specified model $A(x)=y$. The associated forward problem predicts the observations from $x$. In image deblurring, $x$ contains sharp pixel values and a matrix $A$ mixes neighbouring pixels; in tomography, the observations are integrals through the object. The appeal is that indirect measurements can reveal otherwise inaccessible structure. The difficulty is that the forward problem may erase precisely the distinctions we want to recover.

Consider this completely computable two-pixel image deblurring model:Each measured pixel retains $55\%$ of its own value and receives $45\%$ of its neighbour's. Adding measurement noise $e=(0.01,-0.01{)}^T$ gives $y^{\delta }=(0.56,0.44{)}^T$, whose direct reconstruction is $A^{-1}{y}^{\delta }=(1.1,-0.1{)}^T$. The Euclidean norm of the reconstruction error is $0.1\sqrt{2}$, ten times the data error $0.01\sqrt{2}$. A negative second pixel appears even though both observed pixels are positive.

Despite this wrong reconstruction, its residual of an inverse problem is exactly zero: the predicted data equal the noisy observations. Thus matching the data perfectly does not certify reconstruction accuracy. The relevant question is how large a change in the unknown could hide within the measurement uncertainty. A condition number quantifies that sensitivity for an invertible matrix; the null space identifies changes that no improvement in precision can reveal.

The exact singular value decomposition explains this amplification. With the orthonormal basisthe mean mode survives unchanged while the difference mode shrinks tenfold. Direct inversion multiplies difference-mode measurement noise by ten. The condition number is ${\kappa }_2(A)={\sigma }_{\max }/{\sigma }_{\min }=10$. The beauty of the singular value decomposition is this separation into independent channels: it identifies which information survives and which needs protection by regularization of an inverse problem.

A forward problem evaluates a known model at a state: given $u$ and $K$, compute $f=Ku$. The associated inverse problem takes the data $f$ and the model $K$ and seeks a state $u$ with $Ku=f$.

In the sense of Hadamard well-posedness, a problem is well posed if a solution exists for every admissible datum, is unique, and depends continuously on the datum in the specified input and output topologies. An inverse problem is ill-posed if at least one of these requirements fails. Thus ill-posedness means failure of existence, uniqueness or stability. The topologies and the admissible data set matter: restricting the data to the range restores existence, but need not restore continuous dependence.