Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Test function topology

Definition

Let ΩRn be open. For the fixed-support spaces of Fixed support test function frechet space, let P be the set of all seminorms q:D(Ω)[0,) such that qDK is continuous for every compact KΩ. A seminorm means q(av)=aq(v) and q(v+w)q(v)+q(w).

The test-function topology is the topology generated by translated finite intersections of sets {φ:q(φ)<ε}, where qP and ε>0. Equivalently it is the finest locally convex topology making every inclusion DKD(Ω) continuous; the universal-property lemma below proves this equivalence and the topology assertions. This is the locally convex inductive-limit or LF topology, not the unrestricted final topology of arbitrary spaces.

For precision, a locally convex topology here is a vector topology generated by a family of seminorms, and boundedness means absorption by every zero-neighborhood: for each such neighborhood U there is t>0 with BtU. Finite intersections may be empty, giving the whole space. When Ω is empty there is only the zero vector and its unique topology. No convergence criterion for sequences is used in the definition; that criterion will be a theorem.

Depends on

Used by

Dependency tree · two levels

2 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