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.
Pointwise boundedness without a uniform bound on an incomplete domain
Statement refuted
Pointwise bounded sequences of bounded scalar-linear maps on an arbitrary normed domain have uniformly bounded norms. Completeness cannot be omitted, even when the sequence is pointwise eventually zero.
Facts & Assumptions
Operator norm is the unit-ball supremum (The operator norm as the least bound and as the unit-sphere or unit-ball supremum).
Weak-star convergence in a dual means convergence on each fixed primal vector, with a limit in that dual (Weak star convergence).
Counterexample
Given: , the real or complex finitely supported sequences indexed by , with norm . Put and for .
For , the map is scalar-linear and , with equality at the unit vector . Thus for , while . For any fixed finitely supported , past its last nonzero index; hence the sequence is pointwise bounded and even converges weak-star to the zero functional in .
To check incompleteness, let for and zero otherwise. For , , so these form a Cauchy sequence. A norm limit would have coordinate for each fixed , since coordinate evaluation has norm at most one. That sequence is not finitely supported, so no limit exists in . The pointwise convergence in step 1.1 therefore gives no uniform norm bound on this incomplete domain.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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
- Bühler–Salamon, Functional Analysis (2017); exact harvest in batch coverage (standard reference, not scraped)
- Teschl, Topics in Real and Functional Analysis (2017); exact harvest in batch coverage (standard reference, not scraped)