Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Uniform finite order bounds for pointwise bounded distributions

Statement

Assume Dependent Choice. If UD(Ω) is pointwise bounded, meaning supuUu(φ)< for every test φ, then for each compact KΩ there are m0,C0 with u(φ)Cpm(φ)(uU, φDK). Every pointwise limit of a net drawn from this family is a distribution. In particular the pointwise limit of any pointwise convergent sequence of distributions is a distribution. The pointwise-bounded-family hypothesis is not silently discarded for arbitrary nets.

Facts & Assumptions

[F1]

A linear functional with compactwise finite-order bounds is a distribution (Local finite order characterization of distributions).

[F2]

Each DK is complete metrizable with its increasing derivative seminorms (Fixed support test function spaces are complete).

[F3]

Under Dependent Choice, a nonempty complete metric space covered by countably many closed sets has one such set with nonempty interior (Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior).

Proof

Given: Dependent Choice and a pointwise bounded family U.

1.1

Fix compact K. For integers j1 put Ej={φDK:u(φ)j for every uU}. It is closed as an intersection of inverse images of closed disks under continuous restrictions. Pointwise boundedness implies DK=j1Ej. The space contains zero, so it is nonempty, and F2–F4 give an Ej with nonempty interior.

givenF2F3F4
2.1

Take φ0 and a neighborhood φ0+{h:pm(h)<ε}Ej for some m0,ε>0. Then φ0Ej and for pm(h)<ε, linearity gives u(h)u(φ0+h)+u(φ0)2j for all u. For pm(h)>0, scale h by ε/(2pm(h)) to obtain u(h)(4j/ε)pm(h). If pm(h)=0, every positive multiple is in the neighborhood, forcing u(h)=0 by the same uniform bound. This gives the claimed estimate for the fixed K.

step 1.1algebra
3.1

Let a net from U converge pointwise to a scalar-valued map v on tests. Passing to limits in addition and scalar multiplication shows v is complex-linear. Passing to the limit in the bound from step 2.1 gives v(φ)Cpm(φ) on each DK. F1 proves v is a distribution. The witnesses are obtained for one compact at a time, with no additional choice principle.

step 2.1F1
4.1

For a pointwise convergent sequence, every scalar sequence of evaluations is bounded: its convergent tail is bounded and its remaining finite set has a finite maximum. Thus its range is a pointwise bounded family, and step 3.1 applies. A general convergent scalar net need not be bounded over all its indices, so that reasoning is used only for sequences. For empty U take C=m=0; empty K has zero test space and the same choice works. Dependent Choice was used precisely in F3 for the Baire step.

step 3.1step 2.1F3F4

Depends on

Used by

Dependency tree · two levels

15 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