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.

The boundary arc contribution in the valence computation

Statement

Let k be even and let 0≠f∈Mk. On the unit-circle arc of the fundamental domain (away from the finitely many zeros and poles of f) one has the identity dlog⁡f(Sτ)=dlog⁡f(τ)+k dτ/τ with Sτ=−1/τ. Consequently, with the boundary orientation used in the argument-principle computation, the circular arc, traversed clockwise from ω to ω+1, of the positively oriented boundary of the truncated fundamental domain contributes the net amount πik/6 to ∮dlog⁡f (hence k/12 after division by 2πi), while the two vertical boundary sides cancel by T-invariance. If zeros lie on the boundary, these contributions mean limits after deleting paired neighbourhoods under S and T; the small indentation arcs are counted separately.

Facts & Assumptions

Given: Even k, a nonzero modular form f∈Mk (Level-one modular forms and cusp forms), and the standard domain D with Sτ=−1/τ, Tτ=τ+1, the arc being ∣τ∣=1 between ω=e2πi/3 and ω+1=eiπ/3 through i (The standard fundamental domain, boundary identifications and elliptic stabilisers).

[F1]

f(Sτ)=τkf(τ) for S=(0−110) and f(Tτ)=f(τ) (Level-one modular forms and cusp forms).

[F2]

Logarithmic derivative and the chain rule: on any region where a holomorphic g has no zeros, dlog⁡g=g′/g dτ; for c≠0, ddτlog⁡f(Sτ)=f′(Sτ)f(Sτ)⋅1τ2 (The logarithmic derivative of a meromorphic function, The chain rule for complex derivatives, Linearity, product, reciprocal, and quotient rules for complex derivatives).

[F3]

For a closed contour, ∮dlog⁡f is computed by the argument principle; reversal changes the sign, concatenation adds, and ∫γdτ/τ over a contour from a to b equals the increment of a logarithm, in particular ∫ωidτ/τ=log⁡i−log⁡ω (The integral of dz/(z−p) along a contour is the increment of a continuous logarithm, Rectifiable complex contours, reversal, concatenation, closedness, and orientation, The contour integral of a constant c is c times the endpoint displacement).

Proof

1.1F1F2givenalgebra

On a neighbourhood avoiding zeros, differentiate f(Sτ)=τkf(τ) and divide by that equality. The chain and product rules [F2] give f′(Sτ)f(Sτ)τ−2=f′(τ)f(τ)+k/τ, hence dlog⁡f(Sτ)=dlog⁡f(τ)+k dτ/τ. No global logarithm of f is required.

2.1F3step 1.1givenalgebra

Let L be the clockwise half-arc ω→i and R the half-arc i→ω+1. Since S(L) is R with reversed orientation, integrating 1.1 gives −∫Rdlog⁡f=∫Ldlog⁡f+k∫Ldτ/τ. Thus A:=∫Ldlog⁡f+∫Rdlog⁡f=−k∫Ldτ/τ=−k(iπ/2−2πi/3)=πik/6, and A/(2πi)=k/12. When boundary zeros occur, delete matching subarcs under S; the same equality holds on the remaining half-arcs, and the omitted integral of dτ/τ tends to zero. In particular it also applies when i or the endpoints are zeros.

3.1F1F3givenalgebra∎

Vertical sides: the right vertical side of the truncated domain is the image under T of the left vertical side, the map being orientation preserving on H; since f(Tτ)=f(τ) the logarithmic derivative is T-invariant, and the two sides are traversed in opposite directions as parts of the boundary, so their contributions to ∮dlog⁡f cancel. Hence the net contribution of the boundary pieces lying on ∂D is the arc contribution πik/6.

Depends on

Used by

Dependency tree · two levels

49 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