Coarse-graining support: Support.CoarseGraining.BlockResponse.Equalities.LowerImageNamespace #
Imported from the Apache-2.0 CoarseGraining development at commit
c7ddd76c08ade64fed1b8d2ca51be14dfee8deb4.
BlockResponse Equalities -- BlockResponseLowerImageMemVectorL2Data namespace #
blockJ le / eq half responseJ adjoint sum in the BlockResponseLowerImageMemVectorL2Data namespace (with and without hodgeConverseCriterion / IsOpenBoundedConvexDomain), the blockJ eq half scalarResponse sum for scalarCanonicalMaximizers, plus the trailing blockResponse integrand_add / blockJValueSet membership and blockJ_nonneg lemmas.
Lower-level Hodge-packaged upper bound for the doubled response functional.
For note-facing Chapter 2 statements on bounded open convex domains, prefer
blockJ_le_half_responseJ_adjoint_sum_of_isEllipticFieldOn_of_isOpenBoundedConvexDomain.
Preferred note-facing lower-image-packaged upper bound for the doubled response functional on bounded open convex domains.
Lower-level Hodge-packaged equality
BlockJ = (1/2)(ResponseJ + ResponseJ^*). For note-facing Chapter 2
statements on bounded open convex domains, prefer
blockJ_eq_half_responseJ_adjoint_sum_of_isEllipticFieldOn_of_isOpenBoundedConvexDomain.
Preferred note-facing lower-image-packaged equality
BlockJ = (1/2)(ResponseJ + ResponseJ^*) on bounded open convex domains.
Preferred note-facing scalar-canonical lower-image-packaged equality on bounded open convex domains.
Witness-free convex-domain scalar-response equality: the maximizing scalar states are chosen internally from the direct-method existence theorem. This is the preferred Chapter-2-facing surface when one wants the scalar-response decomposition without threading explicit maximizer data through the statement.
Explicitly named existential version of the previous theorem.
Preferred note-facing scalar-canonical lower-image-packaged equality in the note form on bounded open convex domains.
Witness-free convex-domain note-form scalar-response equality. The scalar canonical maximizers are obtained internally, so downstream arguments can consume the decomposition without packaging explicit maximizer witnesses.
Explicitly named existential version of the previous theorem.