Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16
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.

Translated tent functions on R converge to zero in the compact-open topology

Example

For k∈N, define

fk(x):=max⁡{1−∣x−k∣,0}(x∈R).

Then each fk is continuous and 1-Lipschitz, and fk→0 in the compact-open topology on C(R,R), but the sequence does not converge uniformly on R.

Facts & Assumptions

Given: The translated tent functions (fk) on the real line.

[L1]

The general and published metric-domain compact-open topologies agree (The general compact-open topology agrees with the published metric-domain definition).

[L2]

For metric domain and target, compact-open convergence is compact convergence (For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence).

[L4]

The Archimedean property provides a natural number larger than any prescribed real (Every complete ordered field is Archimedean).

[L5]
[L6]

General compact-open subbasic conditions test images of compact sets (The compact-open topology on C(X,Y) for arbitrary topological spaces).

Verification

technique · direct
1.1algebra

The map x↦1−∣x−k∣ is 1-Lipschitz, and taking the maximum with 0 preserves that bound. Hence every fk is continuous and 1-Lipschitz.

1.2L3L4

Let K⊆R be compact. If K=∅, convergence on K is vacuous. Otherwise [L3] gives R>0 with ∣x∣≤R for x∈K, and [L4] gives N∈N with N>R+1.

2.1step 1.2

If k≥N and x∈K, then ∣x−k∣≥k−∣x∣>1, so fk(x)=0. Thus the sequence is eventually identically zero on every compact K, and therefore converges to zero uniformly on each compact set.

3.1L1L2L6step 2.1

By [L1], [L2], and [L6], step 2.1 is convergence in the general compact-open topology.

4.1L5∎

Yet fk(k)=1 for every k, so no tail has ∣fk(x)∣<1/2 for every x∈R. By [L5], convergence is not uniform on the whole real line.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

56 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