Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 power series of z0z1 on a bidisc centred away from the origin

Example

Let f(z)=z0z1 on C2, and expand about the centre a=(1,1). Then

f(z)=1+(z01)+(z11)+(z01)(z11).

So the multi-indexed power series at a has coefficients c(0,0)=c(1,0)=c(0,1)=c(1,1)=1 and cα=0 for every other αN2. Being finite, the series converges absolutely on every bidisc centred at (1,1).

Facts & Assumptions

Given: The function f(z)=z0z1 on C2, the centre a=(1,1), and the bidisc notation of Balls, polydiscs and the distinguished boundary in Cm.

Verification

technique · direct
1.1

Writing zk=1+(zk1) for k=0,1 and expanding gives z0z1=(1+(z01))(1+(z11))=1+(z01)+(z11)+(z01)(z11).

givenalgebra
2.1

The right-hand side is a finite multi-indexed power series about (1,1), with exactly the four nonzero coefficients stated above, so it converges absolutely on every bidisc centred at (1,1).

step 1.1
3.1

The displayed finite series already equals f everywhere, so it is in particular the power-series expansion of f about (1,1). Also (1,0)f(1,1)=1, (0,1)f(1,1)=1, and (1,1)f(1,1)=1 by direct differentiation, while every derivative of order at least 2 in one coordinate is 0; these values match the displayed coefficients.

step 2.1algebra

Depends on

Used by

Dependency tree · two levels

47 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