Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Continuous maps preserve convergence in probability

Statement

Let f:RdRk be continuous, and suppose that, for every ε>0, P(ZnZ>ε)0. Then, for every ε>0, P(f(Zn)f(Z)>ε)0. In particular, coordinate pairing gives stability under sums and products; it gives quotients whenever the limiting denominator is nonzero almost surely, defining the quotient arbitrarily where the approximating denominator is zero.

Facts & Assumptions

Given: A continuous f:RdRk and the displayed norm-tail convergence of Zn to Z.

[L1]

The displayed hypothesis directly says that every fixed-distance bad event for ZnZ has probability tending to zero.

[L2]

Coordinatewise probability convergence gives probability convergence of pairs (Pairing preserves convergence in probability).

Proof

technique · direct
1.1

Fix ε,η>0. Choose a compact cube K with P(ZK)<η and a compact cube K containing every point within distance 1 of K. Uniform continuity of f on K gives δ(0,1) such that points of K within δ have f-images within ε.

choose
2.1

If ZK and ZnZ<δ, then ZnK and f(Zn)f(Z)<ε. Thus the image bad-event probability is at most η+P(ZnZδ), which is at most η+P(ZnZ>δ/2). Its limsup is at most η by [L1]. Letting η0 proves the claim.

step 1.1L1
3.1

Apply [L2] and the claim to (x,y)x+y and (x,y)xy. For division, first restrict to yr and then let r0; the limiting denominator is nonzero almost surely, and the zero-denominator convention for the approximating pair is contained in the remaining event.

step 2.1L2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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