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.
Bounded test function sets have common compact support
Statement
A set is bounded (absorbed by every zero-neighborhood) if and only if there is compact containing every support of its members and for each . A convergent sequence together with its limit is bounded. These assertions hold in ZF; no sequence of witnesses escaping compact sets is selected.
Facts & Assumptions
The LF topology is generated by all seminorms continuous on each fixed-support stage. Its global derivative suprema restrict to , and stage inclusions are continuous (Test function lf topology universal property).
Proof
Given: .
In a seminorm-generated topology, boundedness is equivalent to for every defining seminorm . Indeed absorption by bounds on . Conversely, for finitely many constraints , choose , with if there are no constraints, to absorb in their intersection. By F1, a bounded therefore satisfies for every .
Assume bounded and take the explicit compact exhaustion for , with distance to the empty set infinity and . These closed bounded sets are compactly inside , satisfy , and their interiors cover . Put . The disjoint sets cover , and each compact subset meets only finitely many of them, by a finite subcover from the interiors. Define , with empty supremum zero. Step 1.1 bounds every by the finite number .
Set for when , and zero on shells with . This finite nonnegative function is bounded on every compact subset, since only finitely many shells meet that subset. Continuity of is unnecessary. The seminorm is finite for each test and restricts to a seminorm bounded by on each , hence belongs to the defining family of F1. For any occupied shell (), by the supremum definition. If no contains all supports, for every some member has a nonzero value outside (otherwise its support, the closure of nonzero values, would lie in the closed set ). Thus occupied indices are unbounded, forcing , contrary to step 1.1. A common compact must exist, and its derivative bounds are the bounds already obtained.
Conversely suppose the stated common support and derivative bounds hold. On , any defining seminorm is continuous. Its unit ball contains for some ; scaling as in step 1.1 gives , with the zero-seminorm case handled by arbitrarily large scaling. Hence is bounded on , and step 1.1 proves LF boundedness. Finally, if , continuity of each seminorm gives , so is bounded by a finite initial maximum and a bounded tail. Step 1.1 proves boundedness of the sequence and its limit. Empty uses and zero suprema; empty has only the zero test. The weights in step 3.1 are defined from suprema, without any countable choice.
Depends on
Used by
Dependency tree · two levels
3 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)