Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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 R be an analytic double-fibration transform and u∈E′(X) with support K. Fix a nonzero data covector (z0,ζ0). Suppose there is no relation point (z0,ζ0;x,ξ)∈CZ with x∈K. Then (z0,ζ0)∉WF⁡A(Ru). More precisely, the transpose of a data Gaussian packet, localized near z0, is exponentially small with every fixed number of object derivatives on a neighborhood of K, uniformly for data centers and directions near (z0,ζ0/∣ζ0∣).

Facts & Assumptions

Given: The transform, support compact, covector and empty relation fiber in the statement.

[F1]

Analytic double-fibration transform and canonical relation gives analytic submersions and properness over compact object supports.

[F2]

Distributions, conormal kernels, and cotangent relations identifies conormals and supplies fixed-support finite derivative bounds for distributions.

[F3]

Finite-order analytic cutoff sequence gives finite-order localizers.

[F4]

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.

[F5]

Real analytic inverse and implicit functions gives analytic local fiber coordinates.

Proof

Given: The data in the statement.

1.1F1F2F5givenalgebra

If K=∅, then u=0 and the conclusion is immediate; assume K≠∅. Fix a relatively compact data chart V0 about z0 and a compact object neighborhood K2 with K⊂int⁡K2. By [F1], the incidence portion over V‾0 and K2 is compact. The portion of CZ over it with unit data covector is compact as well. Indeed, at each incidence point the projection of its conormal fiber (η,−ξ)↦η is injective: if η=0, then −ξ annihilates the image of dπX, which is all of TxX by [F1], so ξ=0. On the compact incidence portion these injective linear maps have a uniform lower bound in fixed local metrics. Thus ∣η∣=1 bounds ξ, and closedness of the normalized relation gives compactness. Write ω0=ζ0/∣ζ0∣ in the data chart. If no product neighborhood of (z0,ω0,K) were disjoint from the normalized relation, there would be relation points with data bases tending to z0, unit data covectors tending to ω0, and object bases tending to K. Compactness would give a limiting relation point over (z0,ω0) and some x∈K, contradicting the hypothesis after rescaling by ∣ζ0∣. Hence there are neighborhoods V⋐V0, Γ⊂Sdim⁡G−1 of ω0, and an open neighborhood O of K, with O‾⊂int⁡K2, such that no relation point lies over (q,ω,x) for q∈V, ω∈Γ, and x∈O. Choose a compact neighborhood K1 with K⊂int⁡K1⊂K1⊂O. The incidence portion over V‾ and K1 is compact by [F1]. Use [F5] to cover it by finitely many analytic fiber charts for the projection to X, written (t,x)↦(z(t,x),x). In these coordinates the transpose data packet has integrals of the form ∫eiλΨ(t,x;q,ω)b(t,x)χ(z(t,x)) dt,Ψ=(q−z(t,x))⋅ω+i2∣q−z(t,x)∣2, where b is analytic and χ is a data cutoff. At incidence points z(t,x)=q, ∂tΨ=−DtzTω. If this vanished in every fiber direction, then ω would annihilate the vertical tangent of πX and extend to a nonzero conormal (ω,−ξ) of Z; the submersion hypotheses ensure both components are nonzero. This would be a relation point over (q,ω,x), excluded by the neighborhoods just chosen.

2.1F1F4step 1.1choose

On the compact incidence portion over V‾ and K1, the no-relation property from step 1.1 gives a positive lower bound for max⁡j∣∂tjΨ∣ when z=q and (q,ω) ranges over smaller compactly contained neighborhoods of (z0,ω0). By continuity, shrink the data chart, direction neighborhood and fiber charts so this lower bound persists whenever ∣z−q∣ is sufficiently small. A finite refinement therefore gives the uniform alternative on each piece, for x in a neighborhood of K and (q,ω) near the supplied data point: either ∣z−q∣≥d>0, or one fiber coordinate satisfies ∣∂tjΨ∣≥d>0. The first pieces have Gaussian exponential decay in every fixed object derivative. For the second pieces shrink the analytic neighborhoods so 1/∂tjΨ 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.

3.1F3step 2.1algebraconstruct

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 χj,N are the cutoffs in [F3], take ρj,N=χj,N∏ℓ<j(1−χℓ,N). At every point of the compact at least one χj,N is identically one on a fixed neighborhood. Hence ∑jρj,N=1 there. There are a fixed finite number of factors; the product rule gives ∣∂αρj,N∣≤C(CN)∣α∣ for ∣α∣≤N. Extend the construction to a fixed slightly larger compact in the incidence charts, so all object derivatives through any fixed order m preserve the exact partition identity near K. Use the sequence indexed by N+m.

4.1F2F3F4step 3.1algebra

On a nonstationary piece use L=(iλ∂tjΨ)−1∂tj, so LeiλΨ=eiλΨ. There are no boundary terms because the localizers have compact support in the chart. After N integrations by parts the integrand is eiλΨ(L∗)N(bρj,N+m). The factorial coefficient bounds and the product rule give ∥(L∗)N(bρj,N+m)∥∞≤CN+1λ−N∑k=0NN!k!(C(N+m))k≤Cm(CmN/λ)N for N≥m+1. To obtain the first bound, expand each adjoint as a first-order derivative plus its differentiated analytic coefficient; induction distributes k derivatives to the localizer and bounds the remaining analytic derivatives by CN+1N!/k!. In the second bound use N!≤NN and ∑k≤N(C(N+m))k/k!≤eC(N+m). The bounded integration volumes and ∣eiλΨ∣≤1 leave the same bound for the integral. Applying m object derivatives first adds at most a fixed power of λ and N; the same induction with N+m gives CmλMmNMm(CmN/λ)N. Fix this m and take N=⌊ϵmλ⌋ with Cmϵm<1/2. The result is O(e−cmλ).

5.1F2step 2.1step 4.1algebra∎

The transpose packet coefficient is independent of N because the partition is exact near the support. Summing the finitely many estimates in steps 2.1 and 4.1 proves the asserted Cm estimate on a fixed neighborhood of K. Take m to be the finite distributional order in [F2] and pair with u. It follows that the data Gaussian FBI pairing of Ru 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

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