Alphabeta Math
LemmaStatement: 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.

Test function lf topology universal property

Statement

The test-function topology exists as a Hausdorff locally convex vector topology, induces the prescribed topology on each DK, and is the finest locally convex topology making all inclusions DKD(Ω) continuous. A linear map L:D(Ω)E to a locally convex space is continuous if and only if each restriction LDK is continuous. An increasing compact exhaustion whose interiors cover Ω gives the same topology, independently of the exhaustion. Thus this is an LF topology of the complete metrizable fixed-support spaces. All these claims hold in ZF.

Facts & Assumptions

[F1]

The topology uses all seminorms continuous on each fixed-support space; locally convex spaces here have topologies generated by seminorms (Test function topology).

[F2]

Each fixed-support space has its derivative-seminorm topology and is complete metrizable (Fixed support test function spaces are complete).

Proof

Given: Ω, its fixed-support spaces and the family P of F1.

1.1

Finite intersections of translated seminorm balls form a topology: each ball is stable under sufficiently small translates, by q(f)q(g)q(fg), and intersections refine intersections. Addition is continuous since q(h+k)q(h)+q(k). Joint scalar multiplication is continuous at (a,f) since q(bgaf)bq(gf)+baq(f). Near a, bound b by a+1 and make the two terms small for each of finitely many seminorms. Balls at zero are convex and balanced by the seminorm inequalities. Thus the construction is a locally convex vector topology.

givenF1algebra
2.1

Each inclusion is continuous by the definition of P. Define Qm(f)=maxαmsupxΩαf(x), with value zero on the empty domain. Compact support makes this finite and its restriction to DK is pm, so QmP. In particular Q0 separates points: if fg, the disjoint balls of radius Q0(fg)/3 about them separate them. On DK the induced topology is no finer than its prescribed topology by inclusion continuity, and no coarser because all pm are restrictions of Qm.

step 1.1F1F2
3.1

Let L be linear. If L is continuous, composing with each continuous inclusion proves continuity of every restriction. Conversely suppose all restrictions are continuous. For each seminorm r generating the topology of E, rL is a seminorm whose fixed-support restrictions are continuous. Thus rLP, and inverse images of translated finite seminorm balls are open, proving continuity of L. Applying this result to the identity into any other locally convex topology with continuous inclusions shows that topology is contained in the constructed one.

step 2.1F1
4.1

Let (Kj) be increasing compact sets with interiors covering Ω. Every compact KΩ is contained in some KN, by a finite subcover of these interiors and the maximum of its indices. The inclusion DKDKN is continuous since every derivative seminorm restricts to the same seminorm. Hence a seminorm continuous on all DKj is continuous on every DK, and the converse is immediate. The defining family of seminorms is therefore identical for any such exhaustion; step 3.1 also gives the stated map criterion using only exhaustion stages. By F2 these stages are Fréchet spaces. For Ω= they and the limit are zero, and the same statements hold. No witnesses are selected for infinitely many compact sets: the containment argument is for one fixed K at a time.

step 3.1F1F2

Depends on

Used by

Dependency tree · two levels

4 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