Alphabeta Math
Pipeline-generated
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.

✓ 8 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Infinite Products and the Weierstrass Factorisation Theorem — Examples

1 · Prerequisites

2 · Summary

The examples page shows what the abstract factorization machinery actually does. There is one explicit normally convergent product whose zeros can be read off directly, one canonical product with sparse zeros, and a direct Jensen computation for a polynomial. The sine product example then extracts the Basel sum by matching the quadratic term in the product with the quadratic term in the Taylor expansion.

Its negative examples separate the necessary hypotheses that the main page keeps track of: conditional convergence of the linear series does not force product convergence, uniqueness of Weierstrass factorization fails because an exponential factor remains free, genus zero is not always enough, and the order of an entire function need not equal the canonical genus of its zero sequence.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

The product ∏n≥0(1+z/2n) defines an entire zero-free tail limit after the first factor

Example

The product

∏n≥1(1+z2n)

converges normally on C, hence defines an entire function. On every compact set, all but finitely many factors are zero-free, so the tail limit is zero-free there.

Facts & Assumptions

Given: The factors fn(z)=1+z/2n for n≥1.

[F1]

A normally convergent holomorphic product defines a holomorphic function, and after finitely many factors the tail contributes no zeros on a fixed compact set (Normally convergent products define holomorphic functions with the expected zeros).

Verification

1.1F1givenalgebra

On a compact disc ∣z∣≤R one has ∑n≥1sup⁡∣fn(z)−1∣=∑n≥1R/2n<∞, so the product is normally convergent.

2.1F1step 1.1algebra∎

Therefore [F1] makes the product entire, and on each compact disc only finitely many factors can vanish because −2n eventually lies outside the disc.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

The sine product recovers the Basel sum

Example

The sine product implies the Basel identity

∑n≥11n2=π26.

Facts & Assumptions

Given: The product formula for sin⁡(πz).

[F1]

The Weierstrass product for sine is sin⁡(πz)πz=∏n≥1(1−z2n2) (The Weierstrass product for sine).

[F2]

The complex sine power series gives sin⁡(πz)πz=1−π2z26+O(z4) near z=0 (The exponential definitions of complex sine, cosine, hyperbolic sine, and hyperbolic cosine equal their entire power series).

Verification

1.1givenalgebra

For each N≥1, the partial product PN(z):=∏n=1N(1−z2/n2) has quadratic expansion PN(z)=1−(∑n=1N1/n2)z2+z4RN(z), because every term beyond the linear choice from a single factor contains at least two copies of z2.

2.1F1step 1.1algebra

The series ∑1/n2 converges, so on a fixed neighbourhood of 0 the functions RN stay bounded and the quadratic coefficients converge. Passing to the locally uniform limit supplied by [F1] gives ∏n≥1(1−z2/n2)=1−(∑n≥11/n2)z2+O(z4).

3.1F2step 2.1algebra∎

Comparing the quadratic terms in step 2.1 with the expansion from [F2] yields ∑n≥11/n2=π2/6.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

Jensen's formula for a polynomial

Example

For f(z)=1−z, Jensen's formula on any disc ∣z∣≤R with R>1 reads

0=12π∫02πlog⁡∣1−Reit∣ dt−log⁡R,

because f(0)=1 and the only zero inside the disc is a1=1.

Facts & Assumptions

Given: The polynomial f(z)=1−z and a radius R>1.

[F1]

Jensen's formula expresses the boundary mean of log⁡∣f∣ in terms of f(0) and the interior zeros (Jensen's formula on a disc).

Verification

1.1givenalgebra

The function satisfies f(0)=1≠0, and its unique zero is a1=1, which lies in ∣z∣<R because R>1.

2.1F1step 1.1algebra∎

Applying [F1] with this single zero gives 0=12π∫02πlog⁡∣1−Reit∣ dt−log⁡R, equivalently 12π∫02πlog⁡∣1−Reit∣ dt=log⁡R.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

A genus-zero canonical product for the zero set {n2:n≥1}

Example

The genus-zero canonical product

∏n≥1(1−zn2)

converges normally on C and has zeros exactly at the squares n2, each with multiplicity 1.

Facts & Assumptions

Given: The zero sequence an=n2.

[F1]

If ∑∣an∣−1 converges, then the genus-zero canonical product ∏E0(z/an) converges normally and has exactly the prescribed zeros (A canonical product converges when the (p+1)-power reciprocal sum converges).

Verification

1.1F1givenalgebra

Here ∑n≥1∣an∣−1=∑n≥11/n2 converges, and E0(w)=1−w, so [F1] applies with p=0.

2.1F1step 1.1∎

Therefore ∏n≥1(1−z/n2) converges normally on C and has zeros exactly at the points n2.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

Conditional convergence of ∑an does not force convergence of ∏(1+an)

Statement refuted

If the series ∑an converges, then the product ∏(1+an) converges.

Counterexample

1.1givenalgebra

The paired partial sums satisfy a2m−1+a2m=1/m2, so the series ∑an converges because ∑m≥11/m2 converges; it is not absolutely convergent because ∑a2m−1=∑1/m diverges.

2.1step 1.1algebra

The paired product is (1+a2m−1)(1+a2m)=(1+1m)(1−1m+1m2)=1−1m+1m2+1m5/2. For all large m this is at most 1−12m.

3.1F1step 2.1algebra∎

Since ∑m≥11/(2m) diverges, [F1] makes ∏m≥M(1−12m) tend to 0 for every large M; step 2.1 therefore forces the product of the paired factors, and hence ∏(1+an) itself, to tend to 0 rather than to a nonzero limit. This refutes the statement.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

FALSE: Weierstrass factorization is unique

Statement

Weierstrass factorization is unique.

Facts & Assumptions

Given: The constant entire function 1.

[F1]

Weierstrass factorization writes an entire function as an exponential factor times a product carrying the zeros (Weierstrass factorization for entire functions).

Refutation

1.1F1given

The function 1 has no zeros, so [F1] allows the trivial product part and gives the factorization 1=e0⋅1.

2.1step 1.1algebra∎

But also 1=e2πi⋅1, and the exponential factors e0 and e2πi come from different entire logarithms. Therefore the factorization is not unique.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

FALSE: every zero sequence admits a genus-zero canonical product

Statement

Every discrete zero sequence in C admits a genus-zero canonical product.

Facts & Assumptions

Refutation

1.1given

The sequence an=n has no finite accumulation point, so it is a legitimate zero sequence.

2.1F1step 1.1algebra

For this sequence the genus-zero canonical product is ∏n≥1E0(z/n)=∏n≥1(1−zn) by [F1]. Evaluating at z=−1 gives the positive-factor product ∏n≥1(1+1n).

3.1F2F3step 2.1algebra∎

The series ∑n≥11/n diverges by [F2], so [F3] implies that the product in step 2.1 does not converge. Therefore the genus-zero canonical product for an=n fails even pointwise at z=−1, and the statement is false.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-08-29Open item page →

FALSE: the order of an entire function always equals its canonical genus

Statement

The order of an entire function always equals its canonical genus.

Facts & Assumptions

Given: The zero-free entire function f(z)=ez.

[F1]

Weierstrass factorization represents a zero-free entire function as a pure exponential factor, so its canonical product part has genus 0 (Weierstrass factorization for entire functions).

[F2]

The order of an entire function is defined from the growth of Mf(r) (The order of an entire function).

Refutation

1.1F1given

The function ez has no zeros, so [F1] makes its canonical-product part genus 0.

2.1F2step 1.1algebra∎

On the positive real axis one has Mez(r)≥er, while everywhere on ∣z∣=r one has ∣ez∣=eRe⁡z≤er; therefore Mez(r)=er, and [F2] gives ρ(ez)=lim sup⁡r→∞log⁡r/log⁡r=1. Hence the order is 1 while the canonical genus is 0.

Sources