Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-08
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 upper half-plane Bergman kernel by biholomorphic transport

Example

Let H={z∈C:Im⁡z>0} and let φ:H→D, φ(z)=z−iz+i, be the Möbius biholomorphism. Then

KH(z,w)=−1π(z−w‾)2,

and in particular KH(z,z)=14π(Im⁡z)2; the reproducing property and the diagonal positivity are transported from the disc.

Facts & Assumptions

[A1]

The only choice assumption is ACω (The Axiom of Countable Choice (ACω)), inherited through the Bergman Hilbert/kernel and transformation suppliers; no full Axiom of Choice is used.

[F1]

For complex a,b,c,d with ad−bc≠0, the associated Möbius transformation z↦az+bcz+d is defined on the finite plane away from its pole and is a biholomorphism of the Riemann sphere whose inverse is again a Möbius transformation (Möbius transformations of the Riemann sphere, Every Möbius transformation is a biholomorphism of the Riemann sphere).

[F2]

The unit disc and the upper half-plane are D={∣z∣<1} and H={Im⁡z>0} (The unit disc, the upper half-plane, and Blaschke factors).

[F4]

A biholomorphism F:Ω→Ω′ of domains satisfies KΩ(z,w)=JF(z)KΩ′(F(z),F(w))JF(w)‾ with JF=det⁡CDF≠0, and pullback along F is a unitary isomorphism of the Bergman spaces (Transformation law of the Bergman kernel under a biholomorphism).

[F5]

The disc Bergman kernel is KD(ζ,η)=1π(1−ζη‾)2, it reproduces the corresponding A2 space, and it is the unique such kernel (Bergman kernels of the disc, ball and polydisc, and Szegő kernels of the disc and ball).

[F6]

A biholomorphism is a bijective holomorphic map whose inverse is holomorphic (Biholomorphic maps between open sets in Cm).

Verification

technique · direct, transporting the disc kernel along an explicit Möbius map

Given: ACω, the unit disc D, the upper half-plane H, and φ(z)=z−iz+i.

1.1A1F1F3givenalgebra

The map φ has the Möbius form 1z−i1z+i with ad−bc=1⋅i−(−i)⋅1=2i≠0, so by [F1] it is holomorphic away from its pole z=−i and is a bijection of the sphere with Möbius inverse. Its inverse is ψ(u)=i(1+u)1−u: indeed ψ(u)+i=2i1−u and ψ(u)−i=2iu1−u, so φ(ψ(u))=u, and 1+φ(z)=2zz+i, 1−φ(z)=2iz+i give ψ(φ(z))=z.

2.1F1F2F3F6step 1.1

For z≠−i, [F3] gives ∣φ(z)∣<1  ⟺  ∣z−i∣2<∣z+i∣2  ⟺  −2Im⁡z<2Im⁡z  ⟺  Im⁡z>0; thus φ(H)⊆D. Likewise, for ∣u∣<1 the real part (1−∣u∣2)/∣1−u∣2 of 1+u1−u is positive, so Im⁡ψ(u)=1−∣u∣2∣1−u∣2>0 and ψ(D)⊆H. Since the two maps are inverse bijections by step 1.1 and both are holomorphic on these domains, [F6] makes φ:H→D a biholomorphism with Jφ(z)=φ′(z)=2i(z+i)2.

3.1F3F4F5step 2.1algebra

By [F4] applied to φ, KH(z,w)=KD(φ(z),φ(w))φ′(z)φ′(w)‾. By [F5] and [F3], 1−φ(z)φ(w)‾=1−(z−i)(w‾+i)(z+i)(w‾−i)=(z+i)(w‾−i)−(z−i)(w‾+i)(z+i)(w‾−i)=−2i(z−w‾)(z+i)(w‾−i). Substituting this and φ′(z)=2i(z+i)2, φ′(w)‾=−2i(w‾−i)2 into the transformation law gives KH(z,w)=(z+i)2(w‾−i)2π(−2i(z−w‾))2⋅2i(z+i)2⋅−2i(w‾−i)2=−1π(z−w‾)2, since (2i)(−2i)=4 and (−2i)2=−4.

4.1F4F5step 3.1∎

Setting w=z in step 3.1 and using z−z‾=2iIm⁡z gives (z−z‾)2=−4(Im⁡z)2, hence KH(z,z)=14π(Im⁡z)2>0 for z∈H. This is transport of the disc's diagonal: KH(z,z)=∣φ′(z)∣2KD(φ(z),φ(z)) by [F4], and by [F4] the pullback along the biholomorphism φ carries the disc reproducing property to the reproducing property of KH on A2(H).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

70 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