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.

The Lindeberg condition implies Feller negligibility

Statement

For a centered triangular array with kEXn,k2=1, the Lindeberg condition implies Feller negligibility: maxkVar(Xn,k)0. Independence is not needed.

Facts & Assumptions

[F1]

In normalized rows the Lindeberg quantity is the sum of the truncated second moments. Total row variance and the Lindeberg condition.

[F2]

An integrable function splits into its two complementary restrictions. The Lebesgue integral is linear on L1(μ).

[F3]

Nonnegative integrals preserve pointwise inequalities. Monotonicity and nonnegative homogeneity of the nonnegative integral.

Proof

Given: For a centered triangular array with kEXn,k2=1, the Lindeberg condition implies Feller negligibility: maxkVar(Xn,k)0. Independence is not needed.

1.1

Fix ε>0. For each entry split its square on Xn,kε and its complement. The first integral is at most ε2P(Xn,kε)ε2. The second is one nonnegative term of Ln(ε). Centering identifies variance with second moment, hence 0maxkVar(Xn,k)ε2+Ln(ε). The maximum exists because the row is finite and nonempty.

F1F2F3
2.1

For any η>0, take 0<ε<η/2. Lindeberg gives an index after which Ln(ε)<η/2. The preceding bound is then less than eta, proving convergence to zero. Values at the cutoff stay in the small part, zero entries satisfy the bound, and a single variance-one summand in every row would contradict this conclusion and hence could not satisfy Lindeberg. The proof uses only given finite rows and explicit inequalities, not independence or choice.

step 1.1F1

Depends on

Used by

Dependency tree · two levels

12 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