Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-08-29
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.

Complex infinite-product convention extending the published real definition

Remark

The published definition Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors is stated for real factors. This page extends its tail convention explicitly to complex factors: for a complex sequence (bn), the product ∏n≥0bn converges when there is an index N such that bn≠0 for every n≥N and the complex partial products ∏n=Nmbn converge as m→∞ to a nonzero complex limit.

For a complex sequence (an), the phrase

∏n≥0(1+an) converges absolutely

means exactly that the real product

∏n≥0(1+∣an∣)

converges in the sense of Infinite products: partial products, and convergence to a nonzero limit after finitely many vanishing factors. By For pk≥0 the product ∏(1+pk) converges iff ∑pk converges, with 1+∑k<npk≤∏k<n(1+pk)≤1/(1−∑k<npk) when ∑k<npk<1; for 0≤pk<1 the product ∏(1−pk) converges iff ∑pk converges and its partial products tend to 0 otherwise; and ∑∣pk∣ convergent implies ∏(1+pk) convergent, this is equivalent to the numerical series ∑n≥0∣an∣ converging.

The zero-factor convention is also unchanged. A finite number of zero factors is harmless because convergence is tail-based, but infinitely many zero factors prevent any admissible nonzero tail limit. Later theorems will therefore isolate finite zero sets first and then work on zero-free tails.

Depends on

Used by

Dependency tree · two levels

21 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