Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-27
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.

Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors

Definition

Let (ak) be a sequence of reals. Its partial products are

Πn  :=  ∏k<nak(n∈N),

the finite products of Finite sums and finite products, by recursion, so that Π0=1, the empty product, and Πn+1=Πn an. For N∈N the N-th tail products are Tn(N):=∏j<naN+j, again a sequence in n.

Convergence. The infinite product ∏ak converges when there exists N∈N such that

  1. ak≠0 for every k≥N, and
  2. the sequence (Tn(N))n of N-th tail products converges (Limits and Cauchy sequences of reals) to a limit ℓ≠0.

Its value is then

∏k=0∞ak  :=  (∏k<Nak)⋅ℓ.

If no such N exists, the product diverges.

The value does not depend on N, and that is a proof obligation, discharged here. First, if N is such an index then so is every N′≥N: condition 1 is inherited, and splitting the finite product (Laws of finite sums and finite products) gives, for n≥N′−N,

Tn(N)  =  (∏k=NN′−1ak) T n−(N′−N)(N′),

where the bracketed factor is a product of finitely many nonzero reals and so is itself nonzero. Hence (Tm(N′))m converges, to ℓ′=ℓ/∏k=NN′−1ak by the algebra of limits (Algebra of limits: sums, scalar multiples, products and quotients), and ℓ′≠0 because ℓ≠0. Second, the two candidate values agree:

(∏k<N′ak)ℓ′=(∏k<Nak)(∏k=NN′−1ak)ℓ∏k=NN′−1ak=(∏k<Nak)ℓ,

again by splitting. Finally, any two admissible indices N1,N2 are both at most max⁡{N1,N2}, which is therefore admissible and gives the same value as each. Since a convergent sequence has exactly one limit (A sequence has at most one limit), the displayed value is a single well-determined real number.

Why a zero limit is excluded. The definition demands ℓ≠0, not merely that the tail products converge. Both parts of the definition are doing work, and against different naive alternatives. Against the naive "Πn converges", with no tail clause at all: every sequence with a single zero factor has all its partial products equal to 0 from that index on, hence convergent to 0, so "the product converges" would say nothing whatever about the factors — which is what condition 1, the restriction to a tail of nonzero factors, repairs. Against the naive "some tail of the partial products converges", which keeps condition 1 and drops only ℓ≠0, condition 1 no longer helps, and a product like ∏j≥0(1−1/(j+2)), all of whose factors are nonzero, has partial products 1/(n+1) tending to 0; calling that convergent would make the value 0 without any factor being 0, and would destroy the analogy with series in which a convergent product may be divided by. That product is worked out on the companion examples page.

Remarks

Depends on

Used by

Dependency tree · two levels

33 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