Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section24.Sensitivity.Provider.Path.DhIdentification

DhIdentification #

Ported from scottnarmstrong/Superdiffusion at 7f20476385d4af418f110303085ad0740c9eba46. Module imports, support namespace and local option directives adapted for Lean Pool.

Identification of the linear path term with the D_h quadratic form #

The linear response term of a doubled-mu minimizer at loading (-p, q) is exactly ½ (p,-q) · D_h(U; a) (p,-q): the source display ⨍ 2(∇w + ∇w*)·h(∇w - ∇w*) = ⨍ ∇v*·h∇v = P·D_h(U;a)P.

The doubled-mu minimizer encodes both scalar maximizers. The primal one is extracted by the public CoarseGraining lemma doubledMuMinimizer_neg_left_extracts_canonicalMaximizerGradient; the adjoint one is extracted here by transporting the minimizer through the exact symmetry mu(U, (P₁,P₂); aᵗ) = mu(U, (P₁,-P₂); a) realized by the flux flip, and then applying the same public extraction lemma at the transposed field.

The flux flip and the transpose symmetry of the mu problem #

The doubled energy value is invariant under simultaneous transpose of the coefficient and flux flip of the field: pointwise exact, no null sets.

The flux flip transports mu-minimizers of the base problem to mu-minimizers of the transposed problem at the flux-flipped loading.

The adjoint extraction #

A doubled-mu minimizer at loading (-p, q) extracts the gradient of the adjoint scalar canonical response maximizer from the difference of its potential and its lower block image. Companion of the public CoarseGraining lemma doubledMuMinimizer_neg_left_extracts_canonicalMaximizerGradient, obtained by transporting the minimizer through the flux-flip/transpose symmetry.

The identification of the linear path term #

The linear path term of a mu-minimizer is the D_h quadratic form. For a doubled-mu minimizer X at loading (-p, q),

ℓ(X) = ½ (p,-q) · D_h(U; a) (p,-q),

which is exactly the response-derivative slope in the frozen target responseJ_derivative. Source: the display chain ⨍ 2(∇w + ∇w*)·h(∇w - ∇w*) = ⨍ ∇v*·h∇v = P·D_h(U;a)P combined with the characterization theorem of the coarse-matrix derivative.