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.
Collared Sobolev conductivities have regular Liouville potentials and H1 recovery
Statement
Assume Countable Choice. Fix , , and . Suppose on , where is real, supported in , , and , for . Then and belong to , with supported in and uniformly bounded in and . The real Liouville potentials belong to , have support in , and have norms bounded in terms of . Moreover, with the same dependence. In particular the right side may be replaced by when that stronger norm is used. The Fourier and intrinsic norms for collared variations are those of the collared Sobolev source-functional lemma.
Statement references
Facts & Assumptions
Given: The choice assumption and collared positive conductivities, Sobolev exponent, and uniform norm bounds in the Statement.
Whole-space Fourier transformation is unitary on . Plancherel theorem Its distributional extension, agreement with Plancherel and derivative rule are given 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. We use their angular-frequency form: , so . Weighted Sobolev pairings then follow by Fourier Cauchy–Schwarz.
The intrinsic and Fourier norm conventions are specified in Besov smoothness gives the exact collared Sobolev penalty a cutoff source bound. The fractional norm identity needed here is proved in step 2.1 below, rather than imported as a conclusion of that lemma.
A Sobolev function supported in a compact subset of an open set extends by zero with all weak derivatives through the stated integer order. Compactly supported Sobolev functions extend by zero in every integer order
A nonnegative unit-mass smooth bump generates a compactly supported approximate identity. The mollifier family generated by a unit-mass smooth bump, An approximate identity on
Mollification commutes with weak derivatives on the whole space, and approximate identities converge in finite . Interior mollification commutes with weak derivatives, Every approximate identity converges to the identity in for
Tonelli's theorem interchanges the nonnegative measurable fractional-difference integrals below. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Countable Choice is used at the Fourier interfaces. The Axiom of Countable Choice ()
Proof
Weighted Fourier Cauchy–Schwarz gives because for . The Fourier integrals for and its first derivatives converge absolutely and are continuous by dominated convergence, so these bounds hold for a representative. We shall also use when and . Here is a direct justification: split Fourier space into dyadic annuli, use for low-high products, and when comparable high shells produce a shell . The low-high sum is bounded by since . For high-low products, sum the low blocks with bound if , a square-root logarithmic factor if , or if ; the excess makes the resulting geometric sum converge. For high-high products, weighted summation over has geometric kernel and excess factor ; Cauchy–Schwarz for the input shell sequences completes the bound. The estimates are first proved for Fourier truncations and then passed to their norm limits.
For and , Plancherel and [F6] give . The translation formula follows by substitution on Schwartz functions and then density. Rotation and dilation make the inner integral , where because . Adding proves equivalence with the Fourier norm. Applying this identity to the weak derivatives of order and using [F1] proves the analogous whole-space intrinsic/Fourier comparison at order ; at integer orders use the derivative rule alone. For , multiplication by a bounded function is bounded on . Indeed . In the last term use ; integrating the kernel near and far from the diagonal gives a finite constant times . Apply the identity just proved to get the Fourier Sobolev bound. For this is just the multiplier bound.
If is any smooth scalar function on a neighborhood of , then belongs to with a uniform bound over this class. To verify the fractional highest derivative directly, write with or and . For , the chain rule gives terms and . The first term is in by step 2.1, since is bounded uniformly; for the second, with , so the algebra bound in step 1.1 and then step 2.1 apply. For , the terms are , , and . Here is a multiplier on by step 1.1, so ; the remaining products follow from the same algebra and step 2.1. Lower derivatives have the corresponding easier estimates; the function itself has an bound by the mean value theorem and vanishes wherever . These calculations may first be made for smooth approximations: convolve with a nonnegative mollifier, which preserves and uniform and bounds, and then use convergence in lower Sobolev orders and weak compactness in the Hilbert space to identify the asserted weak derivatives and bound. A bounded sequence in this separable Fourier Hilbert space has a weakly convergent subsequence by diagonal convergence of its countable Fourier coordinates and the norm bound; hence only Countable Choice is used.
Apply step 3.1 to , , and to obtain the stated regularity and support of , , and . To bound in , for use step 2.1 with and the uniform norm of ; for use the multiplier bound in step 1.1 with and . Split for that whole-space bound. The support statement follows from outside the collar ball and from the local definition of weak derivatives.
Put , and . Since , distributional differentiation gives . The equality follows first for smooth positive approximations and then in distributions using step 4.1 and the Sobolev products from steps 1.1–2.1; all terms also have their ordinary weak-product interpretation because are and . The functions and its gradient vanish outside . By [F3], extend by zero to . Choose a nonnegative unit-mass smooth mollifier from [F4]. For small , its convolution with the zero extension is supported in ; by [F5], the mollifications converge to in . Thus the distributional identity may be tested against : and multiplication by the bounded function is bounded on . It gives .
A compactly supported function in obeys : for a smooth approximation supported in the same larger cube, write , apply Cauchy–Schwarz, and integrate in ; passing to limits gives the inequality. Since , step 5.1 and the Fourier dual bound yield . Poincaré in the first sentence then implies , dividing by its norm if nonzero. Finally ; the uniform bounds for , and , the mean value theorem, and the ordinary weak product rule give . Also by the Fourier weights. This proves all recovery claims.
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
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Besov smoothness gives the exact collared Sobolev penalty a cutoff source bound
- Compactly supported Sobolev functions extend by zero in every integer order
- The mollifier family generated by a unit-mass smooth bump
- An $L^1$ approximate identity on $\mathbb{R}^n$
- Interior mollification commutes with weak derivatives
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
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)