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.

Bounded test function sets have common compact support

Statement

A set B⊆D(Ω) is bounded (absorbed by every zero-neighborhood) if and only if there is compact K⊆Ω containing every support of its members and sup⁡f∈Bpm(f)<∞ for each m≥0. 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

[F1]

The LF topology is generated by all seminorms continuous on each fixed-support stage. Its global derivative suprema Qm restrict to pm, and stage inclusions are continuous (Test function lf topology universal property).

Proof

Given: B⊆D(Ω).

1.1givenF1algebra

In a seminorm-generated topology, boundedness is equivalent to sup⁡Bq<∞ for every defining seminorm q. Indeed absorption by q<1 bounds q on B. Conversely, for finitely many constraints qi<εi, choose t>max⁡i(sup⁡Bqi/εi), with t=1 if there are no constraints, to absorb B in their intersection. By F1, a bounded B therefore satisfies sup⁡BQm<∞ for every m.

2.1step 1.1F1

Assume B bounded and take the explicit compact exhaustion Kj={x:∣x∣≤j, dist⁡(x,Rn∖Ω)≥1/j} for j≥1, with distance to the empty set infinity and K0=∅. These closed bounded sets are compactly inside Ω, satisfy Kj⊆int⁡Kj+1, and their interiors cover Ω. Put Aj=Kj∖Kj−1. The disjoint sets Aj cover Ω, and each compact subset meets only finitely many of them, by a finite subcover from the interiors. Define aj=sup⁡{∣f(x)∣:f∈B,x∈Aj}, with empty supremum zero. Step 1.1 bounds every aj by the finite number sup⁡BQ0.

3.1step 2.1step 1.1F1

Set w(x)=j/aj for x∈Aj when aj>0, and zero on shells with aj=0. This finite nonnegative function is bounded on every compact subset, since only finitely many shells meet that subset. Continuity of w is unnecessary. The seminorm q(f)=sup⁡x∈Ωw(x)∣f(x)∣ is finite for each test and restricts to a seminorm bounded by sup⁡Kw p0 on each DK, hence belongs to the defining family of F1. For any occupied shell (aj>0), sup⁡f∈Bq(f)≥(j/aj)aj=j by the supremum definition. If no KN contains all supports, for every N some member has a nonzero value outside KN (otherwise its support, the closure of nonzero values, would lie in the closed set KN). Thus occupied indices are unbounded, forcing sup⁡Bq=∞, contrary to step 1.1. A common compact KN must exist, and its derivative bounds are the Qm bounds already obtained.

4.1step 3.1step 1.1F1

Conversely suppose the stated common support and derivative bounds hold. On DK, any defining seminorm q is continuous. Its unit ball contains pm<ε for some m,ε>0; scaling as in step 1.1 gives q(f)≤(2/ε)pm(f), with the zero-seminorm case handled by arbitrarily large scaling. Hence q is bounded on B, and step 1.1 proves LF boundedness. Finally, if fj→f, continuity of each seminorm gives q(fj−f)→0, so {q(f),q(fj):j≥1} is bounded by a finite initial maximum and a bounded tail. Step 1.1 proves boundedness of the sequence and its limit. Empty B uses K=∅ 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

Dependency tree · 2 levels

Sources