Skip to content

Analytic Continuation

Analytic continuation connects an equilibrium Green function known on imaginary time or Matsubara frequency to the boundary value of a causal real-frequency function.

For a spectral convention in which

G(z)=∫−∞∞dE ρ(E)z−E,\mathcal G(z) = \int_{-\infty}^{\infty} dE\, \frac{\rho(E)}{z-E},

the exact bridge is

G(iζℓ)⟶GR(E)=lim⁡ϵ→0+G(E+iϵ).\mathcal G(i\zeta_\ell) \longrightarrow \mathcal G^{\mathrm R}(E) = \lim_{\epsilon\to0^+} \mathcal G(E+i\epsilon).

This arrow hides two different problems.

  1. Exact continuation: identify the unique analytic function in the correct physical class when exact information is sufficient.
  2. Numerical continuation: infer real-frequency information from finitely many uncertain imaginary-axis data.

The first is a statement about complex analysis and the spectral class. The second is an inverse problem. A continuation method can produce a stable curve only by combining the data with constraints, regularization, a prior, a restricted model, or some mixture of them. The resulting resolution is part of the answer.

This page is the canonical home for:

  • the distinction among uniqueness, stability, and feature identifiability;
  • the finite-data continuation problem in imaginary time and Matsubara frequency;
  • covariance-aware discretization and whitening;
  • singular-value diagnostics and resolution kernels;
  • physically valid constraints on scalar, signed, and matrix-valued spectra;
  • rational, maximum-entropy, stochastic, sparse, parametric, and Nevanlinna approaches;
  • synthetic-data, holdout, and perturbation tests;
  • reporting standards for inferred real-frequency structure;
  • common numerical and interpretive mistakes.

Neighboring pages retain separate ownership:

  • Spectral Representation owns the exact thermal Lehmann measure, Euclidean kernels, Matsubara Cauchy transform, retarded boundary value, high-frequency moments, and static bosonic term.
  • Thermal Green Functions owns ordering signs, equal-time jumps, contact terms, and free thermal benchmarks.
  • Green Functions in Many-Body QM owns particle addition and removal, the single-particle Lehmann interpretation, Dyson equations, and quasiparticle poles.
  • Retarded and Advanced Response owns causality, dispersion relations, response signs, and the analytic half-plane.
  • Real-Time Thermal Dynamics Preview owns initial-state evolution, closed time paths, and the boundary between equilibrium continuation and a driven initial-value problem.
  • Spectral Functions owns line shapes, linewidths, experimental forward models, and the physical evidence needed to interpret spectral features.
  • Lifetime and Spectral Weight owns the physical pole-width, decay-rate, and propagation tests that a continued feature must satisfy.
  • Sum Rules owns the derivation of exact moment constraints.
  • Fluctuation–Dissipation Theorem owns KMS conversion among ordered, symmetrized, and absorptive observable spectra.
  • Maximum Entropy Principle owns entropy maximization over density operators. Maximum-entropy spectral continuation below is a different inverse-problem construction.

Imaginary-time methods are exceptionally effective for equilibrium quantities. Quantum Monte Carlo, finite-temperature tensor networks, perturbative Matsubara calculations, and impurity solvers can all produce precise Euclidean correlators. Experiments and dynamical interpretation, however, often concern:

  • excitation energies and continua;
  • retarded susceptibilities;
  • optical conductivity;
  • spectral gaps and threshold exponents;
  • damping rates and linewidths;
  • quasiparticle residues;
  • transport peaks.

These are real-frequency quantities. The Euclidean calculation is therefore sometimes an intermediate representation rather than the endpoint.

The danger is subtle. A reconstructed spectrum may:

  • reproduce every plotted input point;
  • obey positivity and normalization;
  • look smooth and physically plausible;
  • agree across two implementations of the same regularizer;

yet contain peak splitting, linewidths, or fine structure that the data do not identify. Trustworthy continuation asks not only “what curve was returned?” but also “which statements survive the ambiguity allowed by the data and assumptions?”

The spectral variable on this page is an energy EE. Matsubara energies are

ζℓ=ℏωℓ.\zeta_\ell = \hbar\omega_\ell.

Thus the analytic argument zz, the spectral variable EE, and the retarded boundary argument all have units of energy. If angular frequency is used instead, replace EE by ℏω\hbar\omega and transform the spectral density consistently.

Equilibrium evolution is generated by

K=H−μN^\mathcal K = H-\mu\hat N

when a chemical potential is included. Spectral energies are then differences of eigenvalues of K\mathcal K. Translating to laboratory energies requires the charge of the operator and the chemical-potential convention.

For the Cauchy-transform convention

G(z)=∫dE′ ρ(E′)z−E′,\mathcal G(z) = \int dE'\, \frac{\rho(E')}{z-E'},

the upper boundary is retarded:

GR(E)=G(E+i0+).\mathcal G^{\mathrm R}(E) = \mathcal G(E+i0^+).

The Sokhotski–Plemelj relation gives

GR(E)=PV⁡∫dE′ ρ(E′)E−E′−iπρ(E).\mathcal G^{\mathrm R}(E) = \operatorname{PV} \int dE'\, \frac{\rho(E')}{E-E'} -i\pi\rho(E).

Therefore

ρ(E)=−1πIm⁡GR(E)\rho(E) = -\frac{1}{\pi} \operatorname{Im} \mathcal G^{\mathrm R}(E)

in this convention. Susceptibilities, conductivities, and ordered observable spectra can carry other overall signs or thermal factors. The target must be named before continuation begins.

Two common inputs are:

gi=G(τi),0<τi<βℏ,g_i = \mathcal G(\tau_i), \qquad 0<\tau_i<\beta\hbar,

and

gi=G(iζi).g_i = \mathcal G(i\zeta_i).

They encode the same analytic object only when their transforms, endpoint conventions, contact terms, and frequency parity are mutually consistent.

Suppose the physical Green function belongs to a declared class of functions analytic away from the real axis and has a spectral representation

G(z)=∫−∞∞dE ρ(E)z−E.\mathcal G(z) = \int_{-\infty}^{\infty} dE\, \frac{\rho(E)}{z-E}.

If ρ\rho is known, evaluating G(z)\mathcal G(z) anywhere off the support is a forward problem. If the analytic function itself is known on an open set, the identity theorem fixes its continuation throughout each connected analytic domain.

Matsubara values require an additional observation: the points iζℓi\zeta_\ell are discrete, and their only accumulation point is at infinity. The elementary identity theorem therefore does not by itself say that an arbitrary analytic function is fixed by those samples.

A standard result due to Baym and Mermin establishes uniqueness within the physical thermal Green-function class after the required analyticity, asymptotic, and growth conditions are imposed. Its message is bounded:

  • all exact Matsubara values are used;
  • the candidate belongs to the correct analytic class;
  • the large-∣z∣|z| behavior is controlled;
  • the continuation seeks the corresponding thermal Green function.

It does not say that a finite uncertain data vector determines a stable real-frequency curve.

Do the exact assumptions select at most one admissible spectrum or analytic function?

For infinitely many exact thermal data together with the proper analytic class, the answer can be yes. For finitely many interpolation conditions in a broad function class, infinitely many continuations generally remain.

Does a small perturbation in the input produce a small perturbation in the output under a stated norm?

Analytic continuation is unstable in the unrestricted inverse sense. Tiny imaginary-axis perturbations can correspond to large changes in rapidly varying real-axis structure.

Is a particular quantity, such as a gap, integrated weight, peak position, doublet splitting, or linewidth, fixed within useful uncertainty?

A full spectrum may be poorly identified while a low-order moment or broad integrated weight is precise. Conversely, a visually stable central curve does not prove that every feature drawn on it is identifiable.

These questions should never be collapsed into the statement that continuation “works” or “fails.”

Both imaginary-time and Matsubara formulations can be written as

gi=∫−∞∞dE Ki(E)ρ(E)+gistatic+ϵi.g_i = \int_{-\infty}^{\infty} dE\, K_i(E)\rho(E) +g_i^{\mathrm{static}} +\epsilon_i.

Here:

  • Ki(E)K_i(E) is the known kernel;
  • gistaticg_i^{\mathrm{static}} is a separately represented contact or static term when needed;
  • ϵi\epsilon_i is statistical or numerical error.

The forward map is smoothing. Oscillatory or sharply localized changes in ρ\rho can have a very small image under KK.

For a common single-particle convention,

G(τ)=−∫−∞∞dE e−Eτ/ℏ1+e−βEA(E),0<τ<βℏ,\mathcal G(\tau) = -\int_{-\infty}^{\infty} dE\, \frac{ e^{-E\tau/\hbar} }{ 1+e^{-\beta E} } A(E), \qquad 0<\tau<\beta\hbar,

where

A(E)≥0,∫dE A(E)=1A(E)\geq0, \qquad \int dE\,A(E)=1

for one normalized canonical orbital.

The kernel combines exponential damping with a thermal denominator. At low temperature, positive-energy weight mainly affects small τ\tau, negative-energy weight mainly affects βℏ−τ\beta\hbar-\tau, and fine structure is smoothed in both directions.

The same spectrum gives

G(iνn)=∫−∞∞dE A(E)iνn−E.\mathcal G(i\nu_n) = \int_{-\infty}^{\infty} dE\, \frac{A(E)}{i\nu_n-E}.

Large Matsubara energies mostly constrain moments:

G(iνn)∼M0iνn+M1(iνn)2+M2(iνn)3+⋯ .\mathcal G(i\nu_n) \sim \frac{M_0}{i\nu_n} + \frac{M_1}{(i\nu_n)^2} + \frac{M_2}{(i\nu_n)^3} +\cdots.

Adding many high-frequency points can improve moment information without creating fine low-energy resolution.

For an ordered positive spectrum S(E)S(E), a Euclidean observable correlator often has a thermal kernel of the form

C(τ)=∫0∞dE Kβ(τ,E)S(E)+Cstatic.C(\tau) = \int_0^\infty dE\, K_\beta(\tau,E)S(E) +C_{\mathrm{static}}.

The exact kernel depends on whether SS denotes an ordered, symmetrized, or commutator spectrum. A bosonic commutator density is generally signed:

Eρ(E)≥0E\rho(E)\geq0

in a conjugate Hermitian channel, rather than ρ(E)≥0\rho(E)\geq0 on the whole axis.

The static term can contribute only to the zero Matsubara component:

C(iΩℓ)⊃βCstaticδℓ0.C(i\Omega_\ell) \supset \beta C_{\mathrm{static}}\delta_{\ell0}.

Forcing this contribution into a regular dynamical spectrum can create a spurious narrow peak near zero energy.

Choose quadrature nodes EjE_j and weights wjw_j, and define spectral weights

aj=wjρ(Ej).a_j = w_j\rho(E_j).

Then

g=Ka+gstatic+ϵ,\mathbf g = K\mathbf a +\mathbf g^{\mathrm{static}} +\boldsymbol\epsilon,

with

Kij=Ki(Ej).K_{ij} = K_i(E_j).

This finite matrix is not the physics by itself. Its singular values depend on:

  • the input grid;
  • the spectral window;
  • the output parameterization;
  • quadrature weights;
  • row and column scaling;
  • the covariance metric;
  • any exact constraints already eliminated.

A grid-refinement study is therefore mandatory. If doubling the output grid creates twice as many apparent narrow features while leaving the data fit unchanged, those features are discretization degrees of freedom rather than new evidence.

Let

Cij=⟨ϵiϵj∗⟩C_{ij} = \left\langle \epsilon_i\epsilon_j^* \right\rangle

be the estimated covariance. The appropriate Gaussian misfit is

χ2(a)=(g−Ka)†C−1(g−Ka).\chi^2(\mathbf a) = \left( \mathbf g-K\mathbf a \right)^\dagger C^{-1} \left( \mathbf g-K\mathbf a \right).

Treating correlated input points as independent changes both the effective information content and the preferred reconstruction. This is common for:

  • imaginary-time Monte Carlo bins;
  • Matsubara values obtained by transforming the same time samples;
  • symmetry-averaged correlators;
  • data constrained by endpoint identities;
  • solver outputs sharing truncation errors.

The covariance estimate itself may be noisy or rank deficient. Blindly inverting small covariance eigenvalues can assign enormous weight to directions that are poorly estimated. Defensible choices include:

  • increasing independent samples;
  • blocking data until residual autocorrelation is controlled;
  • using a shrinkage covariance with documented strength;
  • projecting only demonstrably null directions;
  • formulating the likelihood from underlying independent samples.

Any covariance regularization belongs in the method report.

For a positive-definite covariance, define

g~=C−1/2(g−gstatic),\widetilde{\mathbf g} = C^{-1/2} \left( \mathbf g-\mathbf g^{\mathrm{static}} \right),

and

K~=C−1/2K.\widetilde K = C^{-1/2}K.

Then

χ2=∥g~−K~a∥22.\chi^2 = \left\| \widetilde{\mathbf g} -\widetilde K\mathbf a \right\|_2^2.

Whitening measures distinguishability in units of the stated uncertainty. Two spectra a1\mathbf a_1 and a2\mathbf a_2 are difficult to distinguish when

∥K~(a1−a2)∥2≲1,\left\| \widetilde K \left( \mathbf a_1-\mathbf a_2 \right) \right\|_2 \lesssim 1,

subject to the confidence convention and number of tested directions.

This criterion concerns the difference of forward predictions, not the visual distance between the spectra.

Take the singular-value decomposition

K~=UΣV†,\widetilde K = U\Sigma V^\dagger,

where

Σ=diag⁡(σ1,σ2,…),σ1≥σ2≥⋯≥0.\Sigma = \operatorname{diag} \left( \sigma_1,\sigma_2,\ldots \right), \qquad \sigma_1\geq\sigma_2\geq\cdots\geq0.

Expand a spectral perturbation in right singular vectors:

δa=∑kckvk.\delta\mathbf a = \sum_k c_k\mathbf v_k.

Its whitened data image is

δg~=∑kσkckuk.\delta\widetilde{\mathbf g} = \sum_k \sigma_kc_k\mathbf u_k.

Directions with small σk\sigma_k barely change the data. Formal inversion would divide by σk\sigma_k:

ck=uk†δg~σk.c_k = \frac{ \mathbf u_k^\dagger \delta\widetilde{\mathbf g} }{ \sigma_k }.

Noise is therefore amplified most strongly in the modes that encode rapid or delicate spectral structure.

Two distinct candidate spectra producing nearly indistinguishable Euclidean correlators, followed by a singular-value ladder crossing below the noise scale

Kernel smoothing can map a resolved doublet and a broad band to Euclidean data that differ by less than the stated covariance. In the whitened singular basis, only modes with sufficiently large σk\sigma_k are data informed; inversion of smaller modes amplifies uncertainty. A continuation should report the resulting ambiguity rather than selecting one detailed curve without qualification.

A truncated estimator keeps only modes above a chosen cutoff:

ar=∑k=1ruk†g~σkvk.\mathbf a_r = \sum_{k=1}^{r} \frac{ \mathbf u_k^\dagger \widetilde{\mathbf g} }{ \sigma_k } \mathbf v_k.

This is stable after truncation, but it returns a projection of the spectrum onto the retained right-singular subspace. Changing rr changes the estimator’s resolution.

For quadratic regularization,

aλ=argmin⁡a[∥g~−K~a∥22+λ∥L(a−a0)∥22].\mathbf a_\lambda = \underset{\mathbf a}{\operatorname{argmin}} \left[ \left\| \widetilde{\mathbf g} -\widetilde K\mathbf a \right\|_2^2 + \lambda \left\| L \left( \mathbf a-\mathbf a_0 \right) \right\|_2^2 \right].

When L=IL=I and a0=0\mathbf a_0=0,

aλ=∑kσkσk2+λ(uk†g~)vk.\mathbf a_\lambda = \sum_k \frac{ \sigma_k }{ \sigma_k^2+\lambda } \left( \mathbf u_k^\dagger \widetilde{\mathbf g} \right) \mathbf v_k.

The filter factor

fk(λ)=σk2σk2+λf_k(\lambda) = \frac{\sigma_k^2}{ \sigma_k^2+\lambda }

suppresses poorly constrained modes continuously. Stability is purchased by bias.

For the same quadratic case, the noise-free expectation satisfies

E[aλ]=Rλatrue,\mathbb E[ \mathbf a_\lambda ] = R_\lambda\mathbf a_{\mathrm{true}},

where

Rλ=Vdiag⁡(fk(λ))V†.R_\lambda = V \operatorname{diag} \left( f_k(\lambda) \right) V^\dagger.

A row of RλR_\lambda is a discrete resolution kernel. It shows how a nominal output energy mixes weight from neighboring energies. Reporting this kernel is more informative than quoting the spacing of the output grid.

In Hadamard’s terminology, a well-posed inverse problem has:

  1. a solution;
  2. a unique solution;
  3. continuous dependence on the data.

Finite-data analytic continuation can violate uniqueness and continuous dependence in a broad spectral class. Regularization defines a nearby, stable estimation problem. It does not convert the original unrestricted inverse into a well-posed measurement of every spectral detail.

Useful information can still be robust:

  • total spectral weight;
  • low-order moments;
  • a broad gap interval;
  • the presence of weight in a large energy window;
  • the position of an isolated dominant feature;
  • a static susceptibility;
  • a coarse transport scale.

The right question is often narrower than “reconstruct the entire spectrum.”

A broad class of estimators minimizes

Φ[ρ]=12χ2[ρ]+λR[ρ],\Phi[\rho] = \frac12\chi^2[\rho] +\lambda\mathcal R[\rho],

subject to physical constraints. The regularizer R\mathcal R may encode:

  • smoothness;
  • proximity to a default model;
  • sparsity in a chosen basis;
  • few poles or bands;
  • bounded variation;
  • positivity;
  • known support.

In Bayesian language,

p(ρ∣g)∝p(g∣ρ)p(ρ),p(\rho|\mathbf g) \propto p(\mathbf g|\rho) p(\rho),

where the likelihood contains the covariance and the prior contains assumptions about admissible spectra. Penalized optimization and Bayesian inference need not be identical, but both make the same conceptual point: finite data alone do not select a detailed spectrum.

Regularization is not an embarrassment to conceal. It is information to declare and test.

Constraints can remove unphysical candidates and improve precision. They cannot generate data resolution that is absent.

For a normalized diagonal fermionic spectral function,

A(E)≥0.A(E)\geq0.

For a dynamic structure factor in a conjugate channel,

S(E)≥0.S(E)\geq0.

But ordinary positivity is not universal:

  • a bosonic commutator spectrum changes sign across E=0E=0;
  • off-diagonal spectral components can be signed or complex;
  • anomalous Green functions are not positive scalar measures;
  • self-energy spectra require their own convention and analytic conditions.

Applying a positive-spectrum algorithm to a signed channel silently changes the inference problem.

Exact equal-time algebra can determine

Mn=∫dE Enρ(E).M_n = \int dE\,E^n\rho(E).

Moments can be imposed as exact constraints only when they are genuinely exact in the same convention and numerical representation. If a moment comes from another uncertain calculation, it belongs in the likelihood with its covariance.

High-order moments emphasize spectral tails and can be numerically fragile. An inaccurate “exact” moment can force compensating artifacts elsewhere.

Known lower or upper spectral bounds can be powerful. A guessed plotting window is not a physical support theorem. If appreciable weight lies outside the chosen window, normalization and moments can push that missing weight into false edge peaks.

Hermiticity, particle–hole symmetry, and KMS detailed balance can relate positive and negative energies. They should be enforced only when the operator, state, and convention possess the claimed symmetry.

For an ordered equilibrium spectrum,

SBA(−E)=e−βESAB(E).S_{BA}(-E) = e^{-\beta E} S_{AB}(E).

This reduces redundant degrees of freedom, but it does not fix the line shape on the independent half-axis.

A physical retarded Green function is analytic in the upper half-plane. Its real and imaginary parts obey dispersion relations after any required subtractions. For positive scalar spectral measures, the corresponding Cauchy transform also has a definite half-plane sign.

Causality constraints reject some spurious rational functions and matrix continuations. They still leave a family of functions consistent with finite data.

For a matrix-valued fermionic spectrum,

A(E)=A†(E),A(E) = A^\dagger(E),

and

x†A(E)x≥0\mathbf x^\dagger A(E) \mathbf x \geq0

for every vector x\mathbf x in a positive spectral channel.

Continuing each matrix element independently can violate Hermiticity or positive semidefiniteness even when every diagonal entry looks reasonable. Matrix-aware parameterizations preserve the joint constraint.

Separate any known:

  • equal-time discontinuity;
  • delta function in time;
  • frequency-independent offset;
  • conserved bosonic zero mode;
  • diamagnetic or contact contribution.

The dynamic spectral kernel should not be asked to mimic algebraic pieces it does not represent.

Before selecting an algorithm, write down:

  1. the operator pair and ordering;
  2. the thermal generator;
  3. the imaginary-time or Matsubara transform;
  4. the spectral density being inferred;
  5. the relation between that density and the retarded observable;
  6. all static and contact terms;
  7. valid positivity, symmetry, support, and moment constraints.

For conductivity, for example, continuing a paramagnetic current correlator is not yet the full optical response. Diamagnetic terms, zero-frequency distributions, volume normalization, and limiting prescriptions must be handled through the Kubo Formula and the relevant transport convention.

No continuation family is uniformly best. Each selects or averages over the admissible set differently.

  • Rational or Padé: adds a low-order rational form and can excel for high-precision meromorphic data, but is vulnerable to noise-sensitive pole–zero artifacts.
  • Maximum entropy: favors a positive spectrum near a default model and stably recovers broad structure, but smooths and biases according to the prior.
  • Stochastic continuation: samples or optimizes constrained spectra and can expose nonparametric ambiguity, but its ensemble depends on the parameterization and sampling rule.
  • Sparse or parametric: assumes few components in a chosen representation and can be highly interpretable when the model is valid, but can become overconfident under model mismatch.
  • Nevanlinna or related interpolation: enforces half-plane analytic structure and preserves causality or positivity in the applicable class, but finite uncertain data still leave nonuniqueness.
  • Direct real-axis or real-time methods: avoid Euclidean inversion for a target observable, while introducing separate finite-time, broadening, truncation, or solver errors.

A rational approximant writes

G(z)≈PL(z)QM(z),\mathcal G(z) \approx \frac{ P_L(z) }{ Q_M(z) },

where PLP_L and QMQ_M are polynomials chosen to interpolate or fit the imaginary-axis data. Continued fractions are a common numerical representation.

This approach can be effective when:

  • the input has very high precision;
  • the analytic function is well represented by a modest number of poles;
  • the frequency range is controlled;
  • large-zz asymptotics are built in;
  • the result is stable under precision, order, and point-selection changes.

It is fragile because nearby poles and zeros can cancel on the imaginary axis while producing large real-axis excursions. Noise may split one physical feature into several pole–zero pairs or place poles in the wrong half-plane.

A rational continuation should report:

  • numerator and denominator orders;
  • arithmetic precision;
  • input points and weighting;
  • pole locations and residues;
  • near-canceling pole–zero pairs;
  • stability across admissible orders;
  • causality and sum-rule checks.

Smoothing the returned curve after a noisy Padé fit can hide unstable poles without repairing the inference.

For a positive scalar spectrum A(E)A(E) and positive default model m(E)m(E), a common entropy is

S[A∣m]=∫dE [A(E)−m(E)−A(E)ln⁡A(E)m(E)].S[A|m] = \int dE\, \left[ A(E)-m(E) -A(E) \ln \frac{A(E)}{m(E)} \right].

It satisfies

S[A∣m]≤0,S[A|m]\leq0,

with equality at A=mA=m. A maximum-entropy estimator balances fit and relative entropy:

Q[A]=αS[A∣m]−12χ2[A].Q[A] = \alpha S[A|m] -\frac12\chi^2[A].

The default model can encode known support, normalization scale, and coarse prior shape. The hyperparameter α\alpha controls how strongly departures from it are penalized.

There are several nonequivalent prescriptions for handling α\alpha:

  • maximize or average over an evidence approximation;
  • use a discrepancy criterion for χ2\chi^2;
  • cross-validate held-out input modes;
  • average over a declared hyperprior.

The output is conditional on this choice. A responsible analysis varies:

  • the default-model shape;
  • its normalization when not fixed;
  • the frequency window;
  • the output grid;
  • the α\alpha prescription;
  • the covariance treatment.

Maximum entropy is naturally formulated for positive measures. Signed spectra can sometimes be decomposed or reparameterized, but the result is a different prior problem and should not be presented as ordinary positive MaxEnt.

This spectral entropy is a regularizer over candidate functions. It is not the von Neumann entropy of a quantum state and does not follow directly from thermodynamic entropy maximization.

Stochastic methods represent the spectrum by movable peaks, bins, rectangles, basis coefficients, or other positive components and then sample or optimize configurations according to a data-fit and regularization rule.

A schematic sampling weight is

P[A]∝exp⁡[−χ2[A]2Θ]P0[A],\mathcal P[A] \propto \exp \left[ -\frac{ \chi^2[A] }{ 2\Theta } \right] \mathcal P_0[A],

where Θ\Theta is an algorithmic sampling temperature or regularization control and P0\mathcal P_0 represents the measure over parameterized spectra.

Advantages include:

  • nonparametric movement of spectral weight;
  • straightforward positivity and normalization constraints;
  • access to distributions of coarse features;
  • less commitment to one smooth central solution.

Important limitations remain:

  • a “uniform” measure depends on the parameterization;
  • the sampling temperature is not automatically a physical temperature;
  • the spread of sampled curves is not automatically a calibrated posterior interval;
  • averaging can broaden peaks even when each sampled spectrum is sharp;
  • optimization can lock onto spurious structure as the fit is tightened.

Report distributions of feature functionals, such as peak weight or gap edge, rather than using only the pointwise mean spectrum.

Suppose

ρ(E)=∑r=1pθrϕr(E),\rho(E) = \sum_{r=1}^{p} \theta_r\phi_r(E),

where ϕr\phi_r are chosen basis functions. Sparsity penalties, low-rank models, a few Lorentzians, pole expansions, known thresholds, and self-energy ansätze all restrict the candidate class.

Such models can give excellent resolution when the restriction is physically correct. They also make the conclusion conditional:

  • a two-peak fit can resolve a doublet because it assumes a two-component family;
  • a sparse pole basis favors isolated lines over continua;
  • a smooth spline basis disfavors sharp thresholds;
  • a Lorentzian model encodes a specific line shape and tail.

Model checks should include:

  • comparison with less restrictive alternatives;
  • residual structure in the whitened basis;
  • parameter identifiability and correlations;
  • synthetic tests with model mismatch;
  • evidence or predictive performance where meaningful.

Machine-learned continuation belongs in the same category unless the training distribution is broad enough to define a defensible prior for the physical problem. A network cannot infer features absent from both the input information and its training assumptions.

Nevanlinna and causality-preserving interpolation

Section titled “Nevanlinna and causality-preserving interpolation”

For a positive scalar spectral measure, the Cauchy transform belongs, up to convention-dependent signs, to a Herglotz–Nevanlinna class: it maps one half-plane into a definite half-plane and obeys strong analytic constraints.

Nevanlinna continuation uses this structure to parameterize all analytic interpolants consistent with exact input values and positivity. Continued-fraction or Schur-type constructions can preserve:

  • analyticity;
  • the correct half-plane sign;
  • nonnegative normalized spectral weight in the applicable channel.

This is a major advantage over unconstrained rational interpolation. Its scope is still bounded:

  • noisy data may need projection onto a feasible interpolation set;
  • finite data leave a family of admissible analytic functions;
  • a selection or averaging rule within that family adds assumptions;
  • signed, anomalous, or matrix channels require appropriate generalizations;
  • positivity and causality do not guarantee fine-feature identifiability.

Use the exact analytic class as a constraint, not as a promise of unlimited resolution.

For orbital, spin, Nambu, or cluster Green functions, the target is a matrix function. Continuing matrix elements separately neglects their shared spectral geometry.

Safer approaches parameterize:

A(E)=B(E)B†(E)A(E) = B(E)B^\dagger(E)

in positive matrix channels, or continue quadratic forms

Ax(E)=x†A(E)xA_{\mathbf x}(E) = \mathbf x^\dagger A(E)\mathbf x

with consistency across a spanning set of vectors. Matrix maximum-entropy, Carathéodory, and related constructions are designed to preserve joint positivity and analyticity.

Basis covariance also matters. A method should transform consistently under a unitary change of orbital basis. Elementwise priors often do not.

When the scientific target is real frequency, it may be better to avoid Euclidean inversion:

  • real-time tensor-network evolution;
  • correction-vector or resolvent solvers;
  • real-axis diagrammatic equations;
  • Chebyshev or kernel-polynomial expansions;
  • exact diagonalization with controlled finite-size broadening;
  • nonequilibrium contour methods;
  • experimentally forward-modeled response.

These methods have their own limits. A finite time TT gives a characteristic energy resolution

ΔE∼2πℏT,\Delta E \sim \frac{2\pi\hbar}{T},

and a resolvent evaluated at E+iηE+i\eta returns an η\eta-broadened spectrum. Avoiding analytic continuation exchanges one error structure for another; it does not remove the need for resolution analysis.

Often the desired quantity is a linear spectral functional

Q[ρ]=∫dE q(E)ρ(E),Q[\rho] = \int dE\, q(E)\rho(E),

rather than every value of ρ(E)\rho(E). Seek coefficients wiw_i such that

q(E)≈∑iwiKi(E).q(E) \approx \sum_i w_iK_i(E).

Then

Q^=∑iwigi\widehat Q = \sum_iw_ig_i

estimates the functional directly. Its variance is

Var⁡(Q^)=w†Cw,\operatorname{Var}(\widehat Q) = \mathbf w^\dagger C\mathbf w,

and its bias is controlled by the kernel mismatch

r(E)=q(E)−∑iwiKi(E).r(E) = q(E) -\sum_iw_iK_i(E).

This route can estimate a broad integrated weight or moment much more reliably than reconstructing a fine spectrum first and integrating the reconstruction afterward.

Examples of comparatively well-posed questions include:

  • total weight in a wide energy interval;
  • a low-order moment;
  • a broad centroid;
  • whether weight below a coarse threshold exceeds a bound;
  • a smooth transport integral.

A narrow linewidth or sub-resolution doublet is usually a harder functional.

Consider

A(E)=Zδ(E−E0),Z>0.A(E) = Z\delta(E-E_0), \qquad Z>0.

Its Matsubara Green function is

G(iνn)=Ziνn−E0.\mathcal G(i\nu_n) = \frac{Z}{i\nu_n-E_0}.

If this one-pole form is known exactly, two generic exact complex data values can determine ZZ and E0E_0. For example,

1G(iνn)=iνnZ−E0Z.\frac{1}{ \mathcal G(i\nu_n) } = \frac{i\nu_n}{Z} -\frac{E_0}{Z}.

The reciprocal data lie on an affine function of iνni\nu_n.

This is not unrestricted analytic continuation. It is parameter estimation inside a two-parameter model. The apparent high resolution comes from the correct pole assumption.

If the true spectrum contains a continuum,

A(E)=Zδ(E−E0)+Ainc(E),A(E) = Z\delta(E-E_0) +A_{\mathrm{inc}}(E),

the same fit can absorb continuum effects into biased ZZ and E0E_0. Residuals, model expansion, and synthetic mismatch tests are therefore essential.

Take two equal lines centered at E0E_0:

AΔ(E)=Z2[δ(E−E0−Δ2)+δ(E−E0+Δ2)].A_\Delta(E) = \frac{Z}{2} \left[ \delta \left( E-E_0-\frac{\Delta}{2} \right) + \delta \left( E-E_0+\frac{\Delta}{2} \right) \right].

For a smooth kernel,

GΔ=Z2[K(E0+Δ2)+K(E0−Δ2)].G_\Delta = \frac{Z}{2} \left[ K \left( E_0+\frac{\Delta}{2} \right) + K \left( E_0-\frac{\Delta}{2} \right) \right].

Expanding around E0E_0 gives

GΔ=ZK(E0)+ZΔ28K′′(E0)+O(Δ4).G_\Delta = ZK(E_0) + \frac{ Z\Delta^2 }{8} K''(E_0) +O(\Delta^4).

The linear term cancels. Sensitivity to a small symmetric splitting begins at order Δ2\Delta^2. If

∥ZΔ28C−1/2K′′(E0)∥2≲1,\left\| \frac{ Z\Delta^2 }{8} C^{-1/2} K''(E_0) \right\|_2 \lesssim1,

the doublet is not distinguished from a single line at the covariance scale. A method may still draw two peaks because its model or prior prefers them, but the input has not independently resolved the splitting.

Let QQ be conserved:

[Q,K]=0.[Q,\mathcal K]=0.

For δQ=Q−⟨Q⟩\delta Q=Q-\langle Q\rangle,

CQQ(τ)=⟨(δQ)2⟩C_{QQ}(\tau) = \left\langle (\delta Q)^2 \right\rangle

is constant, and

CQQ(iΩℓ)=βVar⁡(Q)δℓ0.C_{QQ}(i\Omega_\ell) = \beta \operatorname{Var}(Q) \delta_{\ell0}.

The commutator spectrum vanishes because [Q(t),Q]=0[Q(t),Q]=0. A continuation of only the regular commutator kernel cannot recover this constant term. If the zero-frequency datum is included without a separate static component, the optimizer may invent arbitrarily narrow low-energy weight.

This is a representation error, not merely poor regularization.

The continuation endpoint should be a causal quantity with a declared prescription:

GR(E)=∫dE′ ρ(E′)E−E′+i0+.\mathcal G^{\mathrm R}(E) = \int dE'\, \frac{\rho(E')}{E-E'+i0^+}.

In numerical plots, one often uses

GηR(E)=∫dE′ ρ(E′)E−E′+iη,η>0.\mathcal G_\eta^{\mathrm R}(E) = \int dE'\, \frac{\rho(E')}{E-E'+i\eta}, \qquad \eta>0.

Its imaginary part is a Lorentzian convolution:

−1πIm⁡GηR(E)=∫dE′ 1πη(E−E′)2+η2ρ(E′).-\frac1\pi \operatorname{Im} \mathcal G_\eta^{\mathrm R}(E) = \int dE'\, \frac1\pi \frac{\eta}{ (E-E')^2+\eta^2 } \rho(E').

The display broadening η\eta must not be confused with:

  • intrinsic decay width;
  • continuation resolution;
  • finite-size level spacing;
  • experimental energy resolution.

All four can broaden a plotted feature, but they have different meanings.

Continuation cannot repair an inconsistent input correlator.

For Monte Carlo data, verify equilibration, block beyond the integrated autocorrelation scale, and propagate the same blocked samples into means and covariance. An underestimated covariance invites overfitting.

Check:

  • endpoint and parity relations;
  • equal-time discontinuities;
  • complex-conjugation symmetry;
  • Matsubara positive-negative frequency pairing;
  • known asymptotic tails;
  • exact normalization;
  • static zero-mode contributions.

If an identity is imposed by symmetrization, recompute the covariance after that linear transformation.

Imaginary-time data and Matsubara data obtained from the same samples are not independent. Fitting both with separate diagonal error bars double counts information unless their joint covariance is included.

If

G(iν)=∑r=0RMr(iν)r+1+Grem(iν),\mathcal G(i\nu) = \sum_{r=0}^{R} \frac{M_r}{(i\nu)^{r+1}} +\mathcal G_{\mathrm{rem}}(i\nu),

subtract the known asymptotic part and continue the better-conditioned remainder. Restore the tail afterward. This reduces dynamic range but does not remove the inverse problem.

Rescale energy and amplitudes so the numerical problem has moderate magnitudes. Record the transformation so normalization, moments, and covariance are restored correctly.

State whether the target is:

  • a full spectral density;
  • a broad gap;
  • one peak position;
  • an integrated weight;
  • a linewidth;
  • a transport coefficient;
  • a causal self-energy.

The harder the functional, the stronger the required resolution evidence.

Derive the kernel from the declared correlator. Verify a free mode or exact finite-system benchmark, including signs, ℏ\hbar, temperature, and contact terms.

Carry the covariance, sample count, blocking procedure, and systematic solver errors. Whiten residuals and inspect them for structure.

List:

  • positivity or sign constraints;
  • normalization and moments;
  • support;
  • symmetry and detailed balance;
  • causality;
  • static components;
  • smoothness, sparsity, or parametric assumptions.

Separate exact constraints from modeling choices.

Generate spectra spanning plausible alternatives, apply the same grid and kernel, and add noise with the measured covariance:

gsyn=Kasyn+ϵ,ϵ∼N(0,C).\mathbf g_{\mathrm{syn}} = K\mathbf a_{\mathrm{syn}} +\boldsymbol\epsilon, \qquad \boldsymbol\epsilon \sim \mathcal N(0,C).

Then run the complete analysis without using the known answer. Include adversarial cases:

  • one peak versus a close doublet;
  • sharp threshold versus rounded onset;
  • narrow peak plus broad background;
  • missing support outside the fit window;
  • a spectrum violating the chosen model family.

Synthetic success on only the same shapes favored by the prior is not a resolution test.

Repeat under:

  • bootstrap or jackknife resamples;
  • removal of selected input points;
  • modest covariance regularization changes;
  • plausible default models;
  • output-grid and window changes;
  • regularization strengths;
  • alternative algorithmic parameterizations.

Record which functionals remain stable.

Hold out selected imaginary-time points or whitened singular components, fit the remainder, and predict the held-out data. This tests interpolation in the data domain. It does not by itself prove real-axis uniqueness, because several spectra may share the same predictions.

Agreement between methods is useful only when their assumptions differ meaningfully. Two codes using positive smoothness priors can agree because they encode similar bias.

Compare:

  • forward residuals;
  • exact constraints;
  • broad integrated features;
  • ambiguity under each method;
  • synthetic resolution.

Do not demand pointwise agreement where the data do not support it.

When possible, identify spectra satisfying

χ2[ρ]≤χacceptable2\chi^2[\rho] \leq \chi^2_{\mathrm{acceptable}}

and all exact constraints. Extremize the scientific functional over this set:

Qmin⁡=inf⁡ρ∈AQ[ρ],Qmax⁡=sup⁡ρ∈AQ[ρ].Q_{\min} = \underset{\rho\in\mathcal A}{\inf} Q[\rho], \qquad Q_{\max} = \underset{\rho\in\mathcal A}{\sup} Q[\rho].

This turns “many spectra fit” into a quantitative interval for the claim of interest.

10. Separate resolution from visualization

Section titled “10. Separate resolution from visualization”

Choose plotting broadening and interpolation only after the inferential resolution has been assessed. A dense, smooth frequency grid is a display choice.

A reproducible continuation result should state:

  1. the operator and Green-function convention;
  2. β\beta, chemical potential, units, and kernel;
  3. the input grid and number of independent samples;
  4. the full covariance treatment;
  5. contact, tail, and static-term preprocessing;
  6. spectral window and discretization;
  7. exact constraints and uncertain auxiliary constraints;
  8. method, prior or regularizer, and hyperparameter rule;
  9. arithmetic precision and convergence criteria;
  10. synthetic-data resolution tests;
  11. sensitivity to priors, points, grid, and window;
  12. uncertainty on physically interpreted functionals;
  13. any additional display broadening.

For a claimed doublet or linewidth, include the closest unresolved alternative that still fits the data. For a claimed gap, report the operational threshold and the smallest detectable in-gap weight.

Several uncertainties coexist:

  • sampling uncertainty: finite stochastic or experimental samples;
  • solver uncertainty: truncation, convergence, discretization, and finite size;
  • kernel uncertainty: temperature, calibration, or forward-model parameters;
  • regularization uncertainty: hyperparameter and prior choice;
  • model uncertainty: whether the admissible spectral family is appropriate;
  • non-identifiability: multiple admissible spectra predict indistinguishable data.

A narrow bootstrap band from one fixed regularizer captures only part of this list. In strongly ill-posed settings, model and non-identifiability uncertainty can dominate pointwise sampling uncertainty.

Writing

iζℓ↦E+i0+i\zeta_\ell \mapsto E+i0^+

is valid after the analytic function has been identified. It does not specify how to reconstruct that function from a finite table.

Invoking the identity theorem on Matsubara points

Section titled “Invoking the identity theorem on Matsubara points”

The Matsubara grid has no finite accumulation point. Uniqueness requires the physical analytic and asymptotic class, not merely the statement that the function is analytic.

Diagonal error bars can overcount heavily correlated time points and drive the reconstruction toward noise.

Bosonic commutator spectra, off-diagonal matrix elements, anomalous functions, and many self-energy conventions are not ordinary nonnegative scalar measures.

A very small χ2\chi^2 may indicate overfitting. It does not prove that narrow structures are physical.

An output grid spacing of 10−310^{-3} does not imply that features separated by 10−310^{-3} are identifiable. Resolution follows from the kernel, covariance, and assumptions.

One smooth reconstruction conceals prior dependence. Vary the default over physically plausible alternatives while preserving exact constraints.

Treating stochastic spread as automatic error bars

Section titled “Treating stochastic spread as automatic error bars”

The sampled ensemble depends on its measure, parameterization, and algorithmic temperature. Calibration requires synthetic and coverage tests.

Elementwise fits can violate Hermiticity, positive semidefiniteness, basis covariance, and common pole structure.

A conserved bosonic contribution belongs to a separate zero Matsubara term. Represent it explicitly.

Methods with similar positivity and smoothness assumptions can return similar curves from the same underdetermined data.

Continuation regularization, finite-time windows, resolvent η\eta, and plotting convolution can all broaden structure. Track each operation separately.

Smoothness, sparsity, few-pole structure, and default models can be physically motivated. They remain assumptions unless derived for the system and observable.

Before accepting a real-frequency claim, ask:

  1. Is the exact forward kernel correct for the channel?
  2. Are contact and static terms separate?
  3. Is the covariance propagated and numerically credible?
  4. Which constraints are exact, and which are priors?
  5. Does the output obey causality, symmetry, normalization, and moments?
  6. What singular or resolution modes are data informed?
  7. Which alternative spectra fit within the same uncertainty?
  8. Has the full workflow passed synthetic model-mismatch tests?
  9. Is the interpreted feature stable under point, prior, grid, and window changes?
  10. Would a direct spectral functional answer the scientific question more robustly?
  11. Is display broadening reported separately?
  12. Are conclusions phrased at the demonstrated resolution?

Let z1,…,zNz_1,\ldots,z_N be distinct points in the upper half-plane, and suppose F(z)F(z) is analytic there. Construct a nonzero analytic perturbation h(z)h(z) that vanishes at every zjz_j and decays as 1/z1/z for large zz within the upper half-plane. What does this prove, and what does it not prove, about thermal Green functions?

Solution

Choose Λ>0\Lambda>0 and define

h(z)=ϵ∏j=1N(z−zj)(z+iΛ)N+1.h(z) = \epsilon \frac{ \displaystyle \prod_{j=1}^{N} (z-z_j) }{ (z+i\Lambda)^{N+1} }.

The only pole is at z=−iΛz=-i\Lambda, which lies in the lower half-plane. Thus hh is analytic in the upper half-plane. At every input point,

h(zj)=0.h(z_j)=0.

For large zz in the upper half-plane,

h(z)∼ϵz.h(z) \sim \frac{\epsilon}{z}.

Therefore F(z)F(z) and F(z)+h(z)F(z)+h(z) agree at all NN sampled points but differ elsewhere.

This proves that finitely many interpolation conditions do not determine an arbitrary upper-half-plane analytic function. It does not prove that both candidates are physical Green functions. The perturbation may violate positivity, reflection properties, moments, or the joint upper- and lower-half-plane spectral representation. Baym–Mermin uniqueness concerns infinitely many exact thermal samples inside the proper physical class.

2. Quantify singular-mode noise amplification

Section titled “2. Quantify singular-mode noise amplification”

A whitened kernel has two singular values

σ1=1,σ2=10−4.\sigma_1=1, \qquad \sigma_2=10^{-4}.

Suppose the whitened data error has magnitude 10−210^{-2} along each left singular vector.

  1. Find the formal inverse error along each right singular vector.
  2. For Tikhonov regularization with L=IL=I and λ=10−4\lambda=10^{-4}, find the resolution filter factors fkf_k.
Solution

Formal inversion divides a data-mode error by the corresponding singular value:

δck=δg~kσk.\delta c_k = \frac{ \delta\widetilde g_k }{ \sigma_k }.

Thus

δc1=10−2,\delta c_1 = 10^{-2},

while

δc2=10−210−4=102.\delta c_2 = \frac{10^{-2}}{10^{-4}} = 10^2.

The second spectral component is effectively unconstrained by a unit-scale prior.

The Tikhonov resolution factors are

fk=σk2σk2+λ.f_k = \frac{ \sigma_k^2 }{ \sigma_k^2+\lambda }.

Therefore

f1=11+10−4≈0.9999,f_1 = \frac{1}{1+10^{-4}} \approx 0.9999,

and

f2=10−810−8+10−4≈10−4.f_2 = \frac{10^{-8}}{10^{-8}+10^{-4}} \approx 10^{-4}.

The well-measured mode is nearly retained, whereas the unstable mode is almost completely suppressed. The stable output is correspondingly biased toward the retained subspace.

Two estimates g1g_1 and g2g_2 have equal variance σ2\sigma^2 and correlation coefficient rr:

C=σ2(1rr1).C = \sigma^2 \begin{pmatrix} 1&r\\ r&1 \end{pmatrix}.

For the average

gˉ=g1+g22,\bar g = \frac{g_1+g_2}{2},

find its variance. Compare it with the variance inferred by incorrectly treating the points as independent. Evaluate the ratio for r=0.9r=0.9.

Solution

Write

w=12(11).\mathbf w = \frac12 \begin{pmatrix} 1\\ 1 \end{pmatrix}.

Then

Var⁡(gˉ)=wTCw=σ22(1+r).\begin{aligned} \operatorname{Var}(\bar g) &= \mathbf w^{\mathsf T} C \mathbf w \\ &= \frac{\sigma^2}{2} (1+r). \end{aligned}

If the points were independent, one would report

Var⁡diag(gˉ)=σ22.\operatorname{Var}_{\mathrm{diag}}(\bar g) = \frac{\sigma^2}{2}.

The true variance is larger by the factor

Var⁡(gˉ)Var⁡diag(gˉ)=1+r.\frac{ \operatorname{Var}(\bar g) }{ \operatorname{Var}_{\mathrm{diag}}(\bar g) } = 1+r.

For r=0.9r=0.9, the factor is 1.91.9. Two strongly correlated points contain much less than twice the information of one point.

For

AΔ(E)=Z2[δ(E−E0−Δ2)+δ(E−E0+Δ2)],A_\Delta(E) = \frac{Z}{2} \left[ \delta \left( E-E_0-\frac{\Delta}{2} \right) + \delta \left( E-E_0+\frac{\Delta}{2} \right) \right],

show that the difference from a single line Zδ(E−E0)Z\delta(E-E_0) begins at order Δ2\Delta^2 for any smooth forward kernel K(E)K(E).

Solution

The doublet prediction is

GΔ=Z2[K(E0+Δ2)+K(E0−Δ2)].G_\Delta = \frac{Z}{2} \left[ K \left( E_0+\frac{\Delta}{2} \right) + K \left( E_0-\frac{\Delta}{2} \right) \right].

Taylor expansion gives

K(E0±Δ2)=K(E0)±Δ2K′(E0)+Δ28K′′(E0)+O(Δ3).\begin{aligned} K \left( E_0\pm\frac{\Delta}{2} \right) ={}& K(E_0) \pm \frac{\Delta}{2} K'(E_0) \\ &+ \frac{\Delta^2}{8} K''(E_0) +O(\Delta^3). \end{aligned}

Adding the two expansions cancels all odd terms:

GΔ=ZK(E0)+ZΔ28K′′(E0)+O(Δ4).G_\Delta = ZK(E_0) + \frac{ Z\Delta^2 }{8} K''(E_0) +O(\Delta^4).

The single-line prediction is G0=ZK(E0)G_0=ZK(E_0). Hence

GΔ−G0=ZΔ28K′′(E0)+O(Δ4).G_\Delta-G_0 = \frac{ Z\Delta^2 }{8} K''(E_0) +O(\Delta^4).

This quadratic suppression explains why close symmetric doublets are difficult to resolve.

A Hermitian bosonic operator in a two-level system has commutator spectral density

ρ(E)=w[δ(E−Δ)−δ(E+Δ)],w>0,Δ>0.\rho(E) = w \left[ \delta(E-\Delta) -\delta(E+\Delta) \right], \qquad w>0, \quad \Delta>0.

Is ρ(E)\rho(E) a nonnegative measure? Verify the correct sign condition and explain why ordinary positive MaxEnt is inappropriate without reparameterization.

Solution

At positive energy the line has weight +w+w, whereas at negative energy it has weight −w-w. Thus ρ\rho is not a nonnegative measure.

Multiplication by EE gives positive weight at both lines:

Eρ(E)=wΔδ(E−Δ)+wΔδ(E+Δ).\begin{aligned} E\rho(E) ={}& w\Delta\delta(E-\Delta) \\ &+ w\Delta\delta(E+\Delta). \end{aligned}

Therefore

Eρ(E)≥0E\rho(E)\geq0

as a distribution. A positive-spectrum entropy applied directly to ρ\rho would forbid the required negative-energy line and change the physical channel. One may instead infer a positive ordered spectrum on an independent half-axis and impose detailed balance, or use a signed-spectrum formulation derived for the chosen convention.

Discretize a positive spectrum as components aj>0a_j>0 with default components mj>0m_j>0. Let

S(a∣m)=∑j[aj−mj−ajln⁡ajmj],S(\mathbf a|\mathbf m) = \sum_j \left[ a_j-m_j -a_j\ln \frac{a_j}{m_j} \right],

and

Q(a)=αS−12∥g~−K~a∥22.Q(\mathbf a) = \alpha S -\frac12 \left\| \widetilde{\mathbf g} -\widetilde K\mathbf a \right\|_2^2.

Find the stationarity equation for an interior maximum.

Solution

The entropy derivative is

∂S∂aj=−ln⁡ajmj.\frac{\partial S}{\partial a_j} = -\ln \frac{a_j}{m_j}.

The misfit derivative is

∂∂a[−12∥g~−K~a∥22]=K~†(g~−K~a).\frac{\partial}{\partial\mathbf a} \left[ -\frac12 \left\| \widetilde{\mathbf g} -\widetilde K\mathbf a \right\|_2^2 \right] = \widetilde K^\dagger \left( \widetilde{\mathbf g} -\widetilde K\mathbf a \right).

Setting the total derivative to zero gives

αln⁡ajmj=[K~†(g~−K~a)]j.\alpha \ln \frac{a_j}{m_j} = \left[ \widetilde K^\dagger \left( \widetilde{\mathbf g} -\widetilde K\mathbf a \right) \right]_j.

Equivalently,

aj=mjexp⁡{1α[K~†(g~−K~a)]j}.a_j = m_j \exp \left\{ \frac1\alpha \left[ \widetilde K^\dagger \left( \widetilde{\mathbf g} -\widetilde K\mathbf a \right) \right]_j \right\}.

The equation is nonlinear because a\mathbf a appears in the residual. It also makes the default-model role explicit: when the data gradient is weak relative to α\alpha, aja_j remains near mjm_j.

7. Estimate a spectral functional directly

Section titled “7. Estimate a spectral functional directly”

In a discretized problem,

g=Ka+ϵ,E[ϵ]=0,E[ϵϵ†]=C.\mathbf g = K\mathbf a +\boldsymbol\epsilon, \qquad \mathbb E[ \boldsymbol\epsilon ]=0, \qquad \mathbb E[ \boldsymbol\epsilon \boldsymbol\epsilon^\dagger ]=C.

The target is

Q=q†a.Q = \mathbf q^\dagger\mathbf a.

Among linear estimators Q^=w†g\widehat Q=\mathbf w^\dagger\mathbf g that are unbiased for every a\mathbf a, derive the minimum-variance weights. Assume the required inverses exist.

Solution

Unbiasedness for every a\mathbf a requires

K†w=q.K^\dagger\mathbf w = \mathbf q.

The variance is

Var⁡(Q^)=w†Cw.\operatorname{Var}(\widehat Q) = \mathbf w^\dagger C\mathbf w.

Introduce a multiplier vector λ\boldsymbol\lambda and minimize

L=w†Cw−2Re⁡[λ†(K†w−q)].\mathcal L = \mathbf w^\dagger C\mathbf w -2\operatorname{Re} \left[ \boldsymbol\lambda^\dagger \left( K^\dagger\mathbf w-\mathbf q \right) \right].

Stationarity with respect to w†\mathbf w^\dagger gives

Cw=Kλ.C\mathbf w = K\boldsymbol\lambda.

Thus

w=C−1Kλ.\mathbf w = C^{-1}K\boldsymbol\lambda.

Imposing unbiasedness yields

K†C−1Kλ=q.K^\dagger C^{-1} K \boldsymbol\lambda = \mathbf q.

Therefore

w=C−1K(K†C−1K)−1q.\mathbf w = C^{-1} K \left( K^\dagger C^{-1} K \right)^{-1} \mathbf q.

The minimum variance is

Var⁡(Q^)=q†(K†C−1K)−1q.\operatorname{Var}(\widehat Q) = \mathbf q^\dagger \left( K^\dagger C^{-1} K \right)^{-1} \mathbf q.

If the inverse does not exist or the variance is enormous, exact unbiased estimation of that functional is unavailable. One can then trade controlled bias for lower variance by approximating q\mathbf q in the row space of KK.

Suppose the measured bosonic correlator is

C(iΩℓ)=βVδℓ0+∫dE ρ(E)iΩℓ−E,C(i\Omega_\ell) = \beta V\delta_{\ell0} + \int dE\, \frac{ \rho(E) }{ i\Omega_\ell-E },

with V≥0V\geq0. Explain how you would prepare these data for continuation and give two failures caused by omitting the first term.

Solution

Represent VV as a separate static parameter. If it is known independently, subtract

βVδℓ0\beta V\delta_{\ell0}

before fitting the dynamical kernel. If it is uncertain, fit it jointly with ρ\rho using its prior information or covariance, while keeping it algebraically distinct.

Omitting the static term can cause:

  1. a spurious very narrow peak near E=0E=0 as the dynamical spectrum attempts to reproduce the excess zero-frequency datum;
  2. distortion of broad low-energy weight or the inferred gap because normalization and regularization redistribute the unmatched static contribution.

Dropping the ℓ=0\ell=0 datum without explanation avoids one mismatch but discards information about VV and may conceal a physically important conserved fluctuation.