Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

Finite complex circle measures are determined by Fourier coefficients and Poisson integrals

Statement

Assume countable choice. If two complex Borel circle measures μ,ν have μ^(n)=ν^(n) for every integer n, then μ=ν. Moreover P[μ]=P[ν] on the disc implies μ=ν. For every complex Borel measure, every 0<r<1 and every integer n, (P[μ])r^(n)=r∣n∣μ^(n). The zero measures are allowed.

Facts & Assumptions

Given: Countable choice and two complex Borel measures on the circle.

[F1]

Under CC their total variations, and the variation of their difference, are finite regular positive Borel measures. Integration against a complex measure satisfies ∣∫u dσ∣≤∫∣u∣ d∣σ∣. (Complex circle measures have finite regular total variation under countable choice, Integrals against signed or complex measures are bounded by total variation, The Axiom of Countable Choice (ACω))

[F2]

The trigonometric polynomials are uniformly dense in C(T,C) under CC. Their coefficients are integrals against the characters, which are orthonormal for normalized Haar measure. (Trigonometric polynomials are uniformly dense in continuous functions on the torus, Fourier coefficients and trigonometric polynomials on the torus, The trigonometric characters are orthonormal in L2 of the torus, The one-dimensional torus and its normalized Haar integral)

[F3]

The kernel is P(z,η)=(1−∣z∣2)/∣η−z∣2, and P[μ] is its integral against μ. The circle is a compact metric space. (The Poisson kernel on the unit disc, The Poisson integral of a finite complex boundary measure, The one-dimensional torus and its normalized Haar integral)

Proof

1.1F1F2givenconstructalgebra

Set σ=μ−ν, a complex measure by countable additivity. If its Fourier coefficients vanish, its integral against every trigonometric polynomial is zero. Given a continuous u, [F2] supplies polynomials arbitrarily close to u uniformly; [F1] bounds ∣∫(u−p)dσ∣ by ∥u−p∥∞∣σ∣(T). Therefore ∫u dσ=0 for every continuous u.

1.2F1F2F3algebra

For z=rζ, the geometric-series identity yields P(rζ,η)=∑k∈Zr∣k∣ζkη−k. At fixed r<1 this is uniformly absolutely convergent in both circle variables, with bound 1+2∑k≥1rk. Integrating first against μ is justified by [F1] and the uniform error bound, and produces the uniformly convergent circle series ∑kr∣k∣μ^(k)ζk, since ∣μ^(k)∣≤∣μ∣(T). Integrating this series against ζ−ndm and using [F2] gives the stated coefficient formula.

2.1F1F3step 1.1constructalgebra

Fix a Borel E and ε>0. Regularity in [F1] gives a compact K⊆E and open U⊇E with ∣σ∣(U∖K)<ε. There is a continuous 0≤u≤1 equal to one on K and zero outside U. Explicitly, if K is empty take u=0; if U is the circle take u=1; otherwise use u(x)=d(x,T∖U)d(x,T∖U)+d(x,K). The two sets are disjoint closed sets, so the denominator is positive at each x; distances are continuous because ∣d(x,A)−d(y,A)∣≤d(x,y) for a nonempty set A. Thus ∣1E−u∣≤1U∖K. Step 1.1 and [F1] give ∣σ(E)∣=∣∫(1E−u)dσ∣<ε. Hence σ(E)=0 for every E, proving Fourier uniqueness.

3.1step 2.1step 1.2algebra∎

If P[μ]=P[ν], fix r=1/2 in step 1.2. Every factor r∣n∣ is strictly positive, so all Fourier coefficients agree. Step 2.1 gives μ=ν. Zero measures and zero variation cause no division by a measure mass anywhere in the proof.

Depends on

Used by

Dependency tree · two levels

84 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