Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Banach-valued power series are determined by their real values

Statement

Let Y be a complex normed vector space (Real and complex scalar conventions for normed spaces), let z0∈R, r>0, and let (an)n≥0,(bn)n≥0⊆Y be such that both series ∑n≥0an(z−z0)n and ∑n≥0bn(z−z0)n converge in Y for every complex z with ∣z−z0∣<r (Series and absolute convergence in a normed space). If ∑n≥0an(t−z0)n=∑n≥0bn(t−z0)n for every real t with ∣t−z0∣<r, then an=bn for every n, and consequently the two sums agree on the whole disc ∣z−z0∣<r. No choice principle is used.

Facts & Assumptions

Given: A complex normed vector space Y, a real centre z0, a radius r>0, sequences (an)n≥0 and (bn)n≥0 in Y whose series converge on the disc ∣z−z0∣<r, the equality of the two sums at every real point t of that disc, and the coefficient differences dn:=an−bn; powers are read with the convention h0=1.

[L1]

A series ∑n=0∞xn in a normed space V converges exactly when its partial sums sm=∑n<mxn converge, and its sum is then lim⁡msm; if ∑nxn and ∑nyn converge, then ∑n(xn−yn) converges to the difference of their sums, because its partial sums are the differences of the two partial sums (Series and absolute convergence in a normed space).

[L2]

In a normed space ∥u+v∥≤∥u∥+∥v∥ and ∥λv∥=∣λ∣ ∥v∥, and ∥w∥≥0 with ∥w∥=0 only for w=0; consequently ∣∥u∥−∥v∥∣≤∥u−v∥ (A norm on a real vector space, the induced metric, and the dictionary with the metric axioms).

[L3]

A complex normed space is a complex vector space with a norm satisfying the same separation and triangle clauses, absolute homogeneity being read with the complex modulus; every estimate that uses only these clauses is valid over either scalar field (Real and complex scalar conventions for normed spaces).

Proof

technique · direct
1.1L1givenalgebra

For every real h with ∣h∣<r the series ∑n≥0dnhn converges in Y and has sum 0: at the point z=z0+h both given series converge, and the partial sums of the difference series are the differences of the corresponding partial sums of the two given series, so they converge to the difference of the two sums, which the hypothesis makes 0.

1.2L1L2L3algebra

Continuity at the centre. Let (cj)j≥0⊆Y and ρ>0 be such that ∑j≥0cjhj converges for every real h with ∣h∣<ρ. Then its sum S(h) satisfies S(h)→c0 as h→0. Indeed, put q:=ρ/2. Convergence at h=q makes the partial sums Cauchy, so their successive differences cjqj tend to 0; a sequence in a normed space that tends to 0 is bounded, so there is M<∞ with ∥cj∥qj≤M for all j. For ∣h∣≤q/2 and every N the tail bound ∥∑j>Ncjhj∥≤∑j>N∥cj∥ ∣h∣j≤M∑j>N2−j holds: the tail is the limit of its partial sums, the norm is continuous by [L2], and each partial sum is estimated by the triangle inequality. The finite part ∑j≤Ncjhj tends to c0 as h→0, and S(0)=c0. Hence for ε>0 one chooses N with M∑j>N2−j<ε/2 and then h so small that ∥∑j≤Ncjhj−c0∥<ε/2, giving ∥S(h)−c0∥<ε.

2.1step 1.1step 1.2L1algebra

For every n≥0: if d0=⋯=dn−1=0, then dn=0. Indeed, the series Tn(h):=∑j≥0dn+jhj converges at h=0 with sum dn, and for 0<∣h∣<r the vanishing of the initial coefficients makes the partial sums of ∑k≥0dkhk equal to hn times the partial sums of Tn(h), so that ∑k≥0dkhk=hnTn(h); by [step 1.1] the left side converges to 0, hence Tn(h)=0 for 0<∣h∣<r and the series Tn(h) converges for every real ∣h∣<r. Applying [step 1.2] with cj:=dn+j and any ρ∈(0,r) gives dn=Tn(0)=lim⁡h→0Tn(h)=0.

3.1step 2.1given

Induction on n: [step 2.1] says that the vanishing of d0,…,dn−1 forces the vanishing of dn for every n, so the set of indices with dn=0 contains 0 and is closed under successors; it is therefore all of N. Hence an=bn for every n.

4.1step 3.1given∎

For every complex z with ∣z−z0∣<r the two series are termwise identical, hence, both being convergent there, they have the same sum; this proves the agreement on the whole disc, and the argument used only limits, norm estimates and induction, so no choice principle was used.

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