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.
Analytic incidence localization away from a data cotangent fiber
Statement
Let be an analytic double-fibration transform and with support . Fix a nonzero data covector . Suppose there is no relation point with . Then . More precisely, the transpose of a data Gaussian packet, localized near , is exponentially small with every fixed number of object derivatives on a neighborhood of , uniformly for data centers and directions near .
Statement references
Facts & Assumptions
Given: The transform, support compact, covector and empty relation fiber in the statement.
Analytic double-fibration transform and canonical relation gives analytic submersions and properness over compact object supports.
Distributions, conormal kernels, and cotangent relations identifies conormals and supplies fixed-support finite derivative bounds for distributions.
Finite-order analytic cutoff sequence gives finite-order localizers.
Cauchy's inequalities bound every derivative by a boundary bound on a compactly contained circle gives factorial bounds for all derivatives of the analytic fiber maps, density coefficients and reciprocals of nonzero analytic phase derivatives on smaller neighborhoods.
Real analytic inverse and implicit functions gives analytic local fiber coordinates.
Proof
Given: The data in the statement.
If , then and the conclusion is immediate; assume . Fix a relatively compact data chart about and a compact object neighborhood with . By [F1], the incidence portion over and is compact. The portion of over it with unit data covector is compact as well. Indeed, at each incidence point the projection of its conormal fiber is injective: if , then annihilates the image of , which is all of by [F1], so . On the compact incidence portion these injective linear maps have a uniform lower bound in fixed local metrics. Thus bounds , and closedness of the normalized relation gives compactness. Write in the data chart. If no product neighborhood of were disjoint from the normalized relation, there would be relation points with data bases tending to , unit data covectors tending to , and object bases tending to . Compactness would give a limiting relation point over and some , contradicting the hypothesis after rescaling by . Hence there are neighborhoods , of , and an open neighborhood of , with , such that no relation point lies over for , , and . Choose a compact neighborhood with . The incidence portion over and is compact by [F1]. Use [F5] to cover it by finitely many analytic fiber charts for the projection to , written . In these coordinates the transpose data packet has integrals of the form where is analytic and is a data cutoff. At incidence points , . If this vanished in every fiber direction, then would annihilate the vertical tangent of and extend to a nonzero conormal of ; the submersion hypotheses ensure both components are nonzero. This would be a relation point over , excluded by the neighborhoods just chosen.
On the compact incidence portion over and , the no-relation property from step 1.1 gives a positive lower bound for when and ranges over smaller compactly contained neighborhoods of . By continuity, shrink the data chart, direction neighborhood and fiber charts so this lower bound persists whenever is sufficiently small. A finite refinement therefore gives the uniform alternative on each piece, for in a neighborhood of and near the supplied data point: either , or one fiber coordinate satisfies . The first pieces have Gaussian exponential decay in every fixed object derivative. For the second pieces shrink the analytic neighborhoods so is holomorphic and has uniform factorial derivative bounds by [F4]. The data cutoff can be chosen equal to one on the central data neighborhood. Its transition contributes only pieces of the first type, so it is never differentiated to an order growing with in the second estimate.
For integration by parts choose finite-order localizers in the finitely many refined fiber charts. They can form an exact partition near the incidence compact without reciprocal derivatives: if are the cutoffs in [F3], take . At every point of the compact at least one is identically one on a fixed neighborhood. Hence there. There are a fixed finite number of factors; the product rule gives for . Extend the construction to a fixed slightly larger compact in the incidence charts, so all object derivatives through any fixed order preserve the exact partition identity near . Use the sequence indexed by .
On a nonstationary piece use , so . There are no boundary terms because the localizers have compact support in the chart. After integrations by parts the integrand is . The factorial coefficient bounds and the product rule give for . To obtain the first bound, expand each adjoint as a first-order derivative plus its differentiated analytic coefficient; induction distributes derivatives to the localizer and bounds the remaining analytic derivatives by . In the second bound use and . The bounded integration volumes and leave the same bound for the integral. Applying object derivatives first adds at most a fixed power of and ; the same induction with gives . Fix this and take with . The result is .
The transpose packet coefficient is independent of because the partition is exact near the support. Summing the finitely many estimates in steps 2.1 and 4.1 proves the asserted estimate on a fixed neighborhood of . Take to be the finite distributional order in [F2] and pair with . It follows that the data Gaussian FBI pairing of is uniformly exponentially small. The definition of analytic wavefront gives the conclusion. This proof uses neither an unproved wavefront pushforward theorem nor a compact analytic bump.
Depends on
- Analytic double-fibration transform and canonical relation
- Distributions, conormal kernels, and cotangent relations
- Analytic wavefront set by Gaussian FBI packets
- Finite-order analytic cutoff sequence
- Cauchy's inequalities bound every derivative by a boundary bound on a compactly contained circle
- Real analytic inverse and implicit functions
Used by
Dependency tree · two levels
32 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
- Marco Mazzucchelli, Mikko Salo, and Leo Tzou, A general support theorem for analytic double fibration transforms (standard reference, not scraped)
- Johannes Sjöstrand, Singularités analytiques microlocales (standard reference, not scraped)