Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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 wavefront recovery under Bolker

Statement

Let R be an analytic double-fibration transform and let

(z0,ζ0;x0,ξ0)∈CZ

be a point of its incidence cotangent relation. Assume the Bolker condition holds at this point, meaning πL−1(z0,ζ0)={(z0,ζ0;x0,ξ0)} and dπL is injective at that relation point. For every compactly supported distribution f∈E′(X), if (z0,ζ0)∉WF⁡A(Rf), then (x0,ξ0)∉WF⁡A(f). This is a qualitative microlocal implication; it asserts no noisy-data stability estimate.

Facts & Assumptions

Given: The analytic transform R, the relation point with singleton full left fiber and injective left differential, and compactly supported f with the stated data analytic regularity.

[F1]

Analytic double-fibration transform and canonical relation: the transform is properly supported on compact object supports and has a nowhere vanishing analytic incidence density and weight.

[F2]

Bolker condition for a double-fibration transform: the pointwise condition gives the entire singleton left fiber and injective differential at this point.

[F3]

Analytic incidence localization away from a data cotangent fiber: input support with no incidence cotangent relation over the supplied data covector has an exponentially small data Gaussian transform, with finite-order distributional estimates.

[F4]

Local Bolker incidence packets have a positive reduced phase: for distributions supported sufficiently near the supplied object point, data Gaussian regularity implies object Gaussian regularity, by the exact packet resolution, reduced positive phase, estimated stationary phase and elliptic packet criterion.

[F5]

Analytic cutoff sequence and local FBI invariance: the Gaussian criterion is independent of local cutoff and analytic chart and applies to distributional densities as well as scalar distributions.

Proof

Given: The data in the statement.

1.1F1F2F3givenchoose

Choose a smooth compact object cutoff ρ equal to one near x0 and supported in the small object neighborhood supplied by [F4]. Write f=ρf+(1−ρ)f. The second summand is compactly supported away from x0. By [F2] its support has no relation point over (z0,ζ0), because that full fiber consists of the supplied point over x0. Hence [F3] gives (z0,ζ0)∉WF⁡A(R((1−ρ)f)). This includes all incidence points outside the local coordinate patch; it is not inferred merely from local injectivity.

2.1F2F4F5step 1.1givenalgebra

By hypothesis the Gaussian data transform of Rf is exponentially small on some data parameter neighborhood. Subtract the exponential estimate from step 1.1, using the same data chart and a common smaller cutoff neighborhood by [F5]. Linearity gives the same estimate for R(ρf) at the supplied data covector. The differential clause of [F2] supplies the local Bolker hypothesis in [F4]. Since ρf is supported in its chosen small object neighborhood, [F4] yields (x0,ξ0)∉WF⁡A(ρf).

3.1F4F5step 2.1algebra∎

The localized distributions ρf and f agree on a neighborhood of x0. Their Gaussian transforms with any common cutoff supported there agree exactly; all other cutoff choices differ only by the exponential Gaussian tails in [F5]. Thus step 2.1 gives (x0,ξ0)∉WF⁡A(f), as asserted. The two suppliers account separately for global fiber uniqueness and local differential injectivity, and all errors are controlled in the finite number of derivatives needed by the compact distribution. No stability or choice assumption has been added.

Depends on

Used by

Dependency tree · two levels

47 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