Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Counting-measure integration is a nonnegative series

Statement

Let N={0,1,2,…} and let # be counting measure on (N,P(N)) (Counting measure on an arbitrary set, Counting measure is a measure). For every measurable f:N→[0,+∞], ∫Nf d#=∑n=0∞f(n), where the right side is the nonnegative extended series of Series in the nonnegative extended real line.

Facts & Assumptions

Given: A measurable function f:N→[0,+∞] and counting measure # on the power set of N.

[F1]

Counting measure on an arbitrary set and Counting measure is a measure: # is a measure on P(N) and every singleton has measure one.

[F2]

Nonnegative simple measurable functions, The integral of a nonnegative simple function, and The nonnegative integral agrees with the simple integral on simple functions: a finite-range nonnegative measurable function is simple, its simple integral is the sum of its coefficients times the measures of the level sets, and this equals its nonnegative integral.

[F3]

Monotone convergence for the integral: if nonnegative measurable functions increase pointwise to f, then their integrals increase to ∫f d#.

[F4]

Series in the nonnegative extended real line: the nonnegative series is the supremum of its finite partial sums Pr:=∑n<rf(n).

[F5]

The Cauchy-sequence reals have the least-upper-bound property, The reals form a totally ordered field, Every complete ordered field is Archimedean, and Canonical naturals are positive and strictly increasing: the real numbers are a complete ordered field, their canonical naturals are strictly increasing, and for every finite real x some canonical natural is greater than x.

Proof

Given: The function and counting measure in the Statement.

1.1F1F2F3F5givenconstruct

For each integer m≥1, define sm(n)=min⁡{f(n),m} when n<m and sm(n)=0 when n≥m. Every subset of N is measurable under [F1], so sm is measurable; its range is finite, hence it is simple by [F2]. For fixed n, the indicator 1n<m is eventually one; if f(n)<+∞, [F5] ensures the increasing canonical naturals eventually exceed f(n), while if f(n)=+∞ the capped values increase without bound. Thus sm(n)↑f(n) for every n. Monotone convergence [F3] gives ∫f d#=lim⁡m→∞∫sm d#.

2.1F1F2F4step 1.1algebra

By [F1] and [F2], for every m≥1, ∫sm d#=∑n<mmin⁡{f(n),m} #({n})=∑n<mmin⁡{f(n),m}=:Dm. For each n<m, min⁡{f(n),m}≤min⁡{f(n),m+1} and Dm+1 adds a nonnegative term, so Dm is nondecreasing. Termwise min⁡{f(n),m}≤f(n), so Dm≤Pm≤∑n=0∞f(n) by [F4].

3.1F4F5step 2.1algebrachoose

Fix r≥0. If Pr=+∞, some f(n)=+∞ with n<r, so for every m≥r with m>n, Dm≥m; the canonical naturals are unbounded by [F5], hence lim⁡mDm=+∞≥Pr. If Pr<+∞, then each f(n) for n<r is finite. Write rˉ=r⋅1R and apply [F5] to Pr+rˉ to choose an integer m with m⋅1R>Pr+rˉ. Then m≥r and m>f(n) for every n<r, since nonnegative summands give f(n)≤Pr. Thus Dm≥Pr, and monotonicity of Dm again gives lim⁡mDm≥Pr. Since this holds for every r, [F4] implies lim⁡mDm≥∑n=0∞f(n). Together with step 2.1's reverse bound, lim⁡mDm=∑n=0∞f(n).

4.1step 1.1step 2.1step 3.1∎

Steps 1.1 and 2.1 identify the integral with lim⁡mDm, and step 3.1 identifies that limit with the nonnegative extended series. This proves the stated identity, including infinite values.

Depends on

Used by

Dependency tree · two levels

44 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