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.
Circle-averaged negative Bourgain estimate for rough vector fields
Statement
Assume Countable Choice. Let , , and fix an oriented two-plane . For a unit vector , let be its positive quarter turn. For , put and These phases are null, have length , and sum to . Use the unitary angular Fourier convention and the norms with inhomogeneous weight , where . For a fixed , define Here is arclength, either sign can be used, and the derivative is distributional. For and , where depends only on . If , also Let be nonnegative with integral , put , and define . For one consequently has
Statement references
Facts & Assumptions
Given: Countable Choice and the parameters, phases and vector field in the statement.
For any null phase of length , multiplication by a fixed smooth compactly supported function maps to with norm independent of and the phase directions. (Uniform cutoff estimates at the CGO characteristic sphere)
The angular Fourier transform preserves norms and sends the divergence to multiplication by . Nonnegative frequency and parameter integrals can be interchanged. (Plancherel theorem, Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)
Convolution with an kernel is bounded on by its norm. (Young's convolution inequality under Countable Choice)
Countable Choice is assumed through [F1]–[F3]. (The Axiom of Countable Choice ())
Proof
Given: The data in the statement.
Direct expansion gives , , and . For either sign, writing , , the symbol satisfies , with absolute constants. Put , , and . We prove the uniform kernel bound . If , the pointwise bound proves it. Otherwise . If , then and the real part has absolute value at least , giving . Thus only the case remains; here .
In this last case, on the imaginary part gives . On the remaining angular set, partition into shells , , ignoring the measure-zero set . Each shell has arclength at most , since and there. On each shell, and the denominator is bounded below, up to an absolute constant, by , where is independent of . Since and the -interval is contained in , integration in is bounded by integration in over this latter interval. For any interval of length at most and , splitting at the zero of the affine function gives . Therefore . Multiplying by the shell measure and summing proves the kernel bound of step 1.1. This proof treats all , including via its earlier case, and its constants are independent of .
Initially let be Schwartz. By [F1], . Interchange the nonnegative integrals using [F2] and apply step 2.1 and Plancherel. This proves the first estimate. For , the simpler denominator bound gives ; averaging over the parameter interval of length and circle length proves the second estimate. The same estimates hold for general and fields by Fourier truncation and smooth approximation. The limits match the distribution : convergence in the weighted negative space implies distributional convergence when tested against Schwartz functions, by reciprocal-weight Cauchy–Schwarz, and convergence of already implies distributional convergence of its derivative.
Write with . Differentiation under the convolution, first for smooth fields and then by approximation, gives by [F3]. Also : at each apply the integral Cauchy–Schwarz inequality to the probability density , then integrate in and interchange nonnegative integrals to bound the squared norm by . The support of is inside . Since , apply the estimate of step 3.1 to and its estimate to . This yields the claimed mollified estimate after enlarging the constant.
Depends on
Used by
Dependency tree · two levels
35 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
- Haberman and Tataru, Uniqueness in Calderón's problem with Lipschitz conductivities (standard reference, not scraped)
- Caro, García and Reyes, Stability of the Calderón problem for less regular conductivities (standard reference, not scraped)