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 , and is the finest locally convex topology making all inclusions continuous. A linear map to a locally convex space is continuous if and only if each restriction 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
The topology uses all seminorms continuous on each fixed-support space; locally convex spaces here have topologies generated by seminorms (Test function topology).
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 of F1.
Finite intersections of translated seminorm balls form a topology: each ball is stable under sufficiently small translates, by , and intersections refine intersections. Addition is continuous since . Joint scalar multiplication is continuous at since Near , bound by 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.
Each inclusion is continuous by the definition of . Define , with value zero on the empty domain. Compact support makes this finite and its restriction to is , so . In particular separates points: if , the disjoint balls of radius about them separate them. On the induced topology is no finer than its prescribed topology by inclusion continuity, and no coarser because all are restrictions of .
Let be linear. If is continuous, composing with each continuous inclusion proves continuity of every restriction. Conversely suppose all restrictions are continuous. For each seminorm generating the topology of , is a seminorm whose fixed-support restrictions are continuous. Thus , and inverse images of translated finite seminorm balls are open, proving continuity of . Applying this result to the identity into any other locally convex topology with continuous inclusions shows that topology is contained in the constructed one.
Let be increasing compact sets with interiors covering . Every compact is contained in some , by a finite subcover of these interiors and the maximum of its indices. The inclusion is continuous since every derivative seminorm restricts to the same seminorm. Hence a seminorm continuous on all is continuous on every , 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 at a time.
Depends on
Used by
- Bounded test function sets have common compact support Lemma
- Closed bounded test function sets are compact Theorem
- Local finite order characterization of distributions Theorem
- Sequential convergence in test function space Theorem
- Test function operations are continuous Theorem
- Translation invariant test function operators are convolutions Theorem
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
- Razvan Gelca, Functional Analysis (standard reference, not scraped)