Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

Every cycle in a round annulus has one period, that of the central circle

Example

Let 0<r1<r2, let A={z:r1<z<r2}, and let C(t)=ρexp(it) on [0,2π] for a fixed ρ with r1<ρ<r2. Let Γ be any complex chain which is a cycle with trace in A, and put k=n(Γ,0), an integer. Then Γ and the chain kC, consisting of C with coefficient k, are homologous in A, and consequently

Γf(z)dz=kCf(z)dz

for every holomorphic f on A. For f(z)=1/z the right-hand factor is Cdz/z=2πi, so Γdz/z=2πik.

Facts & Assumptions

Given: Radii 0<r1<ρ<r2, the annulus A, the circle C, and a cycle Γ with trace in A.

[L1]

If f is holomorphic on an open Ω and two cycles with traces in Ω are homologous in Ω, their integrals of f agree (Holomorphic integrals agree on homologous cycles).

[L2]

Two cycles with traces in Ω are homologous in Ω exactly when their indices agree at every point of CΩ (Null-homologous cycles and homologous cycles in an open set).

[L3]

For aC, r>0 and kZ, the contour a+rexp(ikt) on [0,2π] has index k for za<r and 0 for za>r, with trace {za=r} when k0 (A circle traversed k times has winding number k inside and 0 outside).

[L5]

For a cycle Γ the trace is compact, the index is constant on every connected component of CΓ, each such component is open, and there is R>0 with n(Γ,p)=0 whenever p>R (The index of a cycle is locally constant off its trace and vanishes far from it).

[L6]

For aC, r>0 and every integer m, the positively oriented circle a+rexp(it) on [0,2π] satisfies γ(za)mdz=2πi when m=1 and 0 otherwise (On a positively oriented circle about a, the integral of (z-a)^m is zero for every integer m except -1, and is 2 pi i for m=-1).

[L7]

Γfdz=k<r,mk0mkγkfdz and n(Γ,p)=(2πi)1Γdz/(zp) (Integration over a complex chain and the index of a chain), a chain being a finite list of integer-weighted contours, and a one-term chain carried by a closed contour being a cycle (Complex chains, their traces, and cycles).

[L8]

For cC and every real R>0, the set {z:zcR} is path-connected and connected (The exterior of a closed disc in the plane is path-connected).

[L9]

The connected component of a point is the union of all connected subsets containing it (Connected components, quasicomponents, and totally disconnected spaces) and contains every connected subset containing that point (The components of a space are its maximal connected subsets, they partition it, and each of them is closed).

[L10]

A set is convex when it contains the segment between any two of its points (A convex subset of Rm contains every line segment between two of its points); a subset joined by paths inside it is path-connected (Paths, path-connected spaces and path components) and hence connected (Every path-connected space is connected, and every path component lies inside a component).

[L11]

zw=zw and z+wz+w (Conjugation is an involutive real-field automorphism, zz=z2, and modulus is definite, multiplicative, and subadditive); a subset is bounded when it is empty or lies inside some ball (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

[L12]

The index of a cycle about a point off its trace is an integer (The index of a cycle about a point off its trace is an integer).

[L13]

Constants and the identity are holomorphic, and nonvanishing quotients of holomorphic functions are holomorphic (Linearity, product, reciprocal, and quotient rules for complex derivatives).

Verification

technique · direct
1.1

The trace of Γ lies in A, so it misses the closed disc D={zr1} and the closed exterior E={zr2}, whose union is CA. The number k=n(Γ,0) is defined because 0A, and it is an integer by [L12].

givenL7L12
1.2

By [L3] the contour C is closed, with index 1 on D and 0 on E. Since kC is the one-term chain carrying C with coefficient k, [L7] gives n(kC,p)=kn(C,p) at every p off {z=ρ}, so it is k on D, since pr1<ρ there, and 0 on E, since pr2>ρ there; its trace is contained in {z=ρ}A, and it is a cycle by [L7].

givenL3L7
2.1

D is convex by [L10] and [L11], hence connected, and E is connected by [L8]; both are subsets of CΓ by step 1.1.

step 1.1L8L10L11
3.1

By [L9] the connected set D lies inside a single component of CΓ, on which the index is constant by [L5]; since 0D, this gives n(Γ,p)=k for every pD.

step 2.1L5L9
3.2

By [L9] the connected set E lies inside a single component of CΓ; by [L5] there is R>0 with n(Γ,q)=0 whenever q>R, and E contains the point max(r2,R)+1 of modulus greater than R, so the constant value of the index on that component is 0: thus n(Γ,p)=0 for every pE.

step 2.1L5L9L11
4.1

Steps 3.1, 3.2 and 1.2 make the indices of Γ and kC agree at every point of CA=DE, so [L2] makes them homologous in the open set A, and [L1] gives Γfdz=kCfdz=kCfdz for every holomorphic f on A, the last equality by [L7].

step 3.1step 3.2step 1.2L1L2L7
5.1

The identity map zz is holomorphic and nonvanishing on A, because 0A; hence [L13] makes f(z)=1/z holomorphic on A. Then [L6] with a=0 and m=1 gives Cdz/z=2πi, so step 4.1 yields Γdz/z=2πik.

step 4.1L6L13

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

105 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