Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-08-16
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.

ML estimate: a contour integral is bounded by a supremum bound times path length

Statement

If ∣f(z)∣≤M on the trace of a rectifiable contour γ, with M≥0, then ∣∫γf(z) dz∣≤ML(γ).

Facts & Assumptions

Given: A continuous f with ∣f∣≤M on a rectifiable contour γ.

[L1]

The fundamental inequality bounds the complex integral by the absolute line integral (The fundamental inequality: the modulus of the integral is at most the absolute line integral for rectifiable contours).

[L2]

The arc-length function satisfies sγ(b)−sγ(a)=L(γ) (The arc-length function sγ(t)=L(γ∣[a,t]) of a rectifiable path).

[L3]

The Stieltjes integral bound gives ∣∫f dα∣≤MVar⁡(α) under ∣f∣≤M (The total-variation bound for a Riemann–Stieltjes integral).

[L4]

For piecewise-C1 paths, published scalar and vector line integrals obey the bound ML(γ) (Line-integral estimates by arc length and the supremum of the field).

Proof

technique · direct
1.1L2L3

Apply [L3] to ∣f∘γ∣ and the nondecreasing sγ; by [L2], ∫γ∣f∣ ∣dz∣≤ML(γ).

2.1step 1.1L1

Combine step 1.1 with [L1].

3.1step 2.1L4∎

This agrees with the published piecewise-C1 estimate [L4] on its exact domain and extends it to rectifiable contours. The cases M=0 and L(γ)=0 give zero directly.

Depends on

Used by

Dependency tree · two levels

22 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