Documentation

LeanPool.Superdiffusion.Algsuperdiff.Section4.Provider.Annular.TransposeError

TransposeError #

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

Transpose invariance of the (2,2) homogenization error at an isotropic comparator #

ABK26, Section 4.1: the manuscript runs the ugly estimate e.ugly.estimate.for.J a second time "for the transposed field", and asserts that the transposed estimate holds with the same right-hand side.

This module supplies the deterministic half of that argument at the ๐“”_{s,2,2} slot: the error functional is pointwise unchanged when the coefficient family is replaced by its adjoint, so nothing has to be paid for the transposed leg's error atom.

The mechanism #

๐“” is built from normalizedBlockResponseMax R a a0, the supremum of the doubled response bfJ(R, P, Q; a) over the normalized 2d-sphere. CoarseGraining's unconditional splitting identity doubledResponseJ_eq_half_responseJ_adjoint_sum

bfJ(U, (p,q), (q*,p*); a) = ยฝ J(U, pโˆ’p*, q*โˆ’q; a) + ยฝ J(U, p*+p, q*+q; aแต€)

read at aแต€ (and back at aแต€แต€ โ‰ˆ a) says exactly that transposing the field is the same as flipping the sign of the flux half of both block loads:

bfJ(U, P, Q; aแต€) = bfJ(U, ฮฆP, ฮฆQ; a) ,      ฮฆ(p,q) = (p, โˆ’q) .

At an isotropic background a0 = ฯƒ Id the constant block matrix is diag(ฯƒ Id, ฯƒโปยน Id), which commutes with ฮฆ; and ฮฆ preserves the normalization โŸจP, bfAโ‚€ PโŸฉ. So ฮฆ permutes the admissible probes and the two suprema coincide. No matrix square root is ever computed: the whole argument runs through CoarseGraining's representation-free admission gate normalizedBlockResponseValueSet_mem_of_constantBlockQuadratic_eq_one.

Composing with the proved (J3) carrier identity Cutoff.coefficientCutoff_negateCutoffSample_eq_adjoint (a_m(โˆ’ฯ‰) = a_m(ฯ‰)แต€, read at the family level by Localization.coefficientCutoffTriadicCoeffFamily_negateCutoffSample_aeEq) turns this into the sample-level statement that the ๐’ขโ‚‚ atom ๐“”_{s,2,2}(โ–ก_n; a_{nโˆ’2}, ฯƒ_{nโˆ’2}) is invariant under whole-sequence negation.

What is proved #

References #

Part A -- the flux sign flip on doubled block vectors #

The flux sign flip ฮฆ(p,q) = (p, โˆ’q) on doubled block vectors.

Equations
Instances For

    Transposing the field is flipping the flux half of both block loads.

    Read off CoarseGraining's unconditional splitting identity doubledResponseJ_eq_half_responseJ_adjoint_sum at aแต€ and at a, together with responseJ U aแต€แต€ = responseJ U a.

    Part B -- the flip is a symmetry of the isotropic normalization #

    At an isotropic background the constant block matrix diag(ฯƒ Id, ฯƒโปยน Id) commutes with the flux sign flip.

    Part C -- the one-cube block maximum is transpose invariant #

    The normalized block-response maximum is transpose invariant at an isotropic comparator. This is the inner quantity of d.mathcal.E, so it is the whole content at the (2,2) error slot.

    Part D -- the whole ๐“” chain #

    Part E -- the sample-level ๐’ขโ‚‚ atom #

    The ๐’ขโ‚‚ atom is invariant under whole-sequence negation.

    ๐“”_{s,2,2}(โ–ก_n; a_{nโˆ’2}(โˆ’ฯ‰), ฯƒ_{nโˆ’2}) = ๐“”_{s,2,2}(โ–ก_n; a_{nโˆ’2}(ฯ‰), ฯƒ_{nโˆ’2}), pointwise in ฯ‰: the (J3) carrier identity a_m(โˆ’ฯ‰) = a_m(ฯ‰)แต€ composed with homogenizationErrorOnCube_adjointFamily.

    The annulus maximum of the ๐’ขโ‚‚ atoms is invariant under whole-sequence negation. The lattice index set is deterministic and the translations commute with the negation.