How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Besov smoothness gives the exact collared Sobolev penalty a cutoff source bound
Statement
Assume Countable Choice. Put , fix , and let and . Use the following precise intrinsic Hilbert norm on . If with integer and , set For integer use just the derivative sum with . Denote the corresponding real inner product by . On use the unitary Fourier transform and . Let have norm , where and for ; the restriction space on consists of restrictions of members of this whole-space Besov space.
Let be real and equal to almost everywhere on . Then there is , depending on , such that for every real also equal to there and every integer , Consequently, suppose on a specified admissible sublevel a forward map satisfies with and . For the exact regularizer , its exact Bregman distance is , and In particular, an stability modulus of order yields a VSC source term of order with . The conditional stability estimate is a hypothesis here, not a conclusion.
Statement references
Facts & Assumptions
Given: Countable Choice and the intrinsic penalty, exponents, collar and truth in the Statement.
Plancherel supplies the unitary transform. Its extension to tempered distributions, agreement with the transform, and derivative rule are supplied separately by Fourier transform is a topological automorphism of tempered distributions, Fourier transform agrees with l one and plancherel transforms, and Fourier differentiation and multiplication identities on tempered distributions. Plancherel theorem
Smooth dyadic Fourier blocks characterize the Bessel Hilbert Sobolev norms. Littlewood-Paley characterisation of the Hilbert-Sobolev spaces
Young's convolution inequality in the case bounds convolution by an kernel on . Young's convolution inequality under Countable Choice
Tonelli's theorem permits interchanging nonnegative measurable integrals on the sigma-finite Lebesgue product used below. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Countable Choice is used at the Fourier and Hilbert-Sobolev interfaces. The Axiom of Countable Choice ()
Proof
Use the angular-frequency convention . The -frequency results in [F1] transfer by , with the same change of variables on distributional tests; hence and the transform remains unitary. The fixed frequency dilation changes only equivalence constants in the dyadic norms of [F2]. We record explicitly the smooth-multiplication bound for the stated Besov convention. Write . For , has Fourier kernel . If , Young's convolution inequality [F3] bounds its operator norm by a constant times . If , then on these supports. Repeated integration by parts in the Fourier integral of gives . Cauchy–Schwarz in the two frequency variables therefore bounds the operator norm by . For any real , multiply these bounds by and sum over . Choosing makes both off-diagonal geometric sums uniformly bounded in , while the near-diagonal sum has at most five terms. Hence . These calculations first apply to finite block sums; the same estimates give their convergence in distributions, since a Schwartz test has faster-than-polynomial Fourier decay.
The sharp annular definition agrees, up to constants, with any usual smooth inhomogeneous dyadic definition at . Indeed a sharp annulus meets at most a fixed number of the smooth supports at neighboring scales. On that annulus, the identity and Cauchy–Schwarz give its norm at most the sum of those finitely many smooth-block norms; conversely each smooth symbol has magnitude at most one and support in finitely many sharp annuli. The weights differ by only a constant at neighboring scales. The low blocks also meet only finitely many supports. This proves both Besov norm comparisons. For Hilbert Sobolev norms, [F1] gives directly , consistently with [F2].
Choose equal to one near , and choose equal to one near . Let be one whole-space extension, whose existence is part of the restriction-space hypothesis. The compactly supported distribution is in by step 1.1 (the constant term multiplied by is smooth). It equals on and vanishes outside , since the conductivity equals one in the collar. Thus is a compactly supported extension of . In particular : the squared block sum is bounded by a constant times .
For , let be its zero extension. Its support lies in . Zero extension creates no boundary derivatives because vanishes on an open collar: local distributional tests near see zero, and interior tests give exactly the zero extensions of the weak derivatives. For noninteger, the whole-space top-order difference integral equals the integral over plus . Where can be nonzero, the inner integral is bounded by . The whole-space difference norm is therefore bounded by , and the integer case is immediate. The translation identity follows by substitution for Schwartz functions and then by density and unitarity for every . Thus [F1] and Tonelli [F4] give . The inner integral equals by rotation and dilation; follows by the bounds . Summing derivative multipliers shows that this whole-space difference norm is equivalent to . Thus , while exactly .
Let be the whole-space intrinsic bilinear form associated with the derivative and difference norm in step 3.2. Its Fourier multiplier equals in the noninteger case, and just the first polynomial in the integer case. Thus , and belongs to by the annular multiplier bound and step 3.1. Its distributional pairing with is . The pairing is defined by convergent Fourier blocks: high blocks have the product bound , a summable sequence. This also justifies the bilinear identity by truncation and limits, without assuming classical derivatives of order .
In the integer case the whole-space and domain pairings are identical, since every derivative of is supported in ; take . For noninteger , their difference is where and . To obtain the formula, split each whole-space double integral into , and its transpose; is zero outside and there. On any fixed neighborhood of compact in , every derivative of is bounded, by differentiating the separated kernel and using its integrable tail. Choose equal to one on that neighborhood. The domain pairing is therefore the pairing of with By step 1.1, its correction terms lie in : differentiation lowers the block regularity by the derivative order, multiplication by the smooth compact coefficient preserves it, and is smooth and compactly supported. Since , they also lie in . Hence in every case, and . This treats the exact domain penalty pairing rather than replacing its norm by an equivalent one.
Put and . Let . By step 5.1 and the Hilbert block norm formula, . Similarly . Weighted Fourier Cauchy–Schwarz and step 3.2 now give , the first claimed estimate.
Expansion of the quadratic form gives exactly . Set . The conditional stability hypothesis and applied to the high-frequency term in step 6.1 yield . If , stability gives . For , take the integer with . Then and . Since , this proves the asserted source inequality with coefficient on the exact Bregman distance. Substitution of the stated logarithmic stability exponent gives by multiplying exponents.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Plancherel theorem
- Fourier transform is a topological automorphism of tempered distributions
- Fourier transform agrees with l one and plancherel transforms
- Fourier differentiation and multiplication identities on tempered distributions
- Littlewood-Paley characterisation of the Hilbert-Sobolev spaces
- Young's convolution inequality under Countable Choice
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Used by
Dependency tree · two levels
55 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Frederic Weidling, Variational Source Conditions and Conditional Stability Estimates for Inverse Problems in PDEs (standard reference, not scraped)