Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-10
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.

A nontight sequence with no probability law subsequence limit

Statement refuted

The laws μn=δn on the real line form a nontight sequence with no subsequence converging weakly to a probability law on the real line.

Facts & Assumptions

[F1]

A compact subset of a metric space is closed and bounded: Let (X,d) be a metric space (def-metric-space) and let KX be a compact subset (def-metric-compactness). Then K is closed in X (def-metric-topology) and bounded (def-metric-bounded-diameter).

No choice principle is used: both covers below are given by a rule, and the indexed form of lem-compactness-is-intrinsic returns indices rather than sets.

The converse is false in general. A closed and bounded subset of an arbitrary metric space need not be compact (fs-closed-and-bounded-implies-compact-in-every-metric-space); it is exactly in Rn that the converse holds (thm-heine-borel-rn).

[F2]

Tight family of probability measures: A family A of Borel probabilities on a metric space S is tight if, for every ε>0, there is a compact KS such that μ(SK)<ε for every μA. One K must work for the whole family. Compactness is def-metric-compactness. The empty family is tight, witnessed by the empty compact set.

[F3]

Portmanteau theorem: For Borel probabilities μn,μ on a metric space S, the following are equivalent: (i) μnμ; (ii) integrals converge for all bounded uniformly continuous real tests; (iii) lim supnμn(F)μ(F) for every closed F; (iv) lim infnμn(G)μ(G) for every open G; (v) μn(A)μ(A) for every Borel A with μ(A)=0.

[F4]

Continuity from below for measures: Let (En)nN be an increasing sequence of measurable sets for a measure μ, so EnEn+1. Then

μ(nNEn)=supnNμ(En).

No finiteness hypothesis is required.

Counterexample

Given: The objects, hypotheses and definitions in the statement. Its conclusions are to be established below.

1.1

Every compact K is bounded by F1. Thus for all sufficiently large n, n is outside K and μn(K)=0. No compact K can give all the laws outside mass below 1/2, so F2 fails.

F1F2
2.1

If δnjμ along a subsequence, nj tends to infinity. For every positive integer m, the open set (-m,m) eventually has delta_{nj} mass zero. F3 would give μ((m,m))0. These intervals increase to R, so F4 would give μ(R)=0, contradicting probability mass one.

F3F4

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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