Alphabeta Math
DefinitionDefinition: 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 double-fibration transform and canonical relation

Definition

An analytic double fibration is a diagram of real-analytic manifolds and real-analytic submersions

G← πG Z→ πX X

such that Z is embedded in G×X, both projections are submersions, and

dim⁡G+dim⁡X>dim⁡Z>dim⁡G≥dim⁡X.

Write CZ={(g,η;x,ξ):(g,x;η,−ξ)∈N∗Z∖0} for the incidence cotangent relation. Assume πG is proper on πX−1(K) for every compact K⊂X. Let ωZ be a nowhere vanishing real-analytic smooth density on Z and let κ ⁣:Z→C be real analytic and nowhere zero. For a compactly supported distribution u on X, the weighted transform is the distributional density

Ru=(πG)∗(κ ωZ πX∗u),

where pullback, multiplication by a density, proper pushforward, and CZ use the conventions of the preceding definition. In local fiber coordinates this is integration of u over the incidence fibers with weight κ and density ωZ. The hypotheses on proper support ensure this transform is defined for every compactly supported input. This is the class treated on this page; no noisy-data or stability assertion is included.

Facts & Assumptions

Given: The real-analytic double fibration, its density and nonvanishing analytic weight, and a compactly supported distribution u on X.

[F1]

Distributions, conormal kernels, and cotangent relations: submersion pullback is defined by transposed fiber integration; density multiplication turns it into a distributional density; pushforward is defined when proper on support; the canonical relation uses (η,−ξ).

[F2]

Smooth manifolds and their smooth charts: local charts define the smooth manifold structures.

[F3]

Cr and smooth maps between smooth manifolds: smooth submersions have smooth local coordinate representatives.

[F4]

Density bundle and smooth density fields: densities transform by absolute Jacobians and can be integrated without orientations.

[F5]

Real analytic germs in several variables: the analytic maps and coefficients have holomorphic local complexifications.

[F6]

Multi-indexed power series in Cm and their absolute convergence: those complexifications are represented by convergent power series on smaller polydiscs.

Proof

Given: The manifolds G,Z,X, maps πG,πX, density ωZ, weight κ, and input u.

1.1givenF2F3F5F6

The chart representatives are smooth submersions by [F2]–[F3], and their analytic representatives have local holomorphic extensions by [F5]–[F6]. Hence the fiber and incidence data in the statement are well-defined in the stated smooth and analytic categories.

1.2F1given

The pullback πX∗u exists by [F1]. Multiplying it by the nowhere vanishing analytic density ωZ gives a distributional density; multiplication by the smooth function κ preserves that type. If supp⁡u⊂K with K compact, the support of this product lies in πX−1(K), on which πG is proper by hypothesis.

2.1F1F3F4step 1.1step 1.2∎

The proper pushforward in [F1] therefore defines Ru as a distributional density on G. In coordinates, transposing fiber integration in the two submersions shows that it pairs a data test function with the integral over the corresponding incidence fiber, weighted by κωZ; the density Jacobians cancel by [F4]. The cotangent relation of the kernel is precisely CZ by the sign convention in [F1].

Depends on

Used by

Dependency tree · two levels

37 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