Alphabeta Math
TheoremStatement: 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.

The fundamental inequality: the modulus of the integral is at most the absolute line integral for rectifiable contours

Statement

For a continuous f on the trace of a rectifiable contour γ, ∣∫γf(z) dz∣≤∫γ∣f(z)∣ ∣dz∣.

Facts & Assumptions

Given: A rectifiable contour γ and a continuous integrand f.

[L2]

Complex modulus satisfies ∣z+w∣≤∣z∣+∣w∣ and ∣zw∣=∣z∣∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[L3]

Every chord of a rectifiable path is at most the length of the corresponding subpath (Every endpoint chord is no longer than the arc: ∥γ(b)−γ(a)∥2≤L(γ)).

Proof

technique · direct
1.1L2

For a tagged partition P, the complex polygonal sum SP=∑f(γ(ξj))(γ(tj+1)−γ(tj)) satisfies ∣SP∣≤∑∣f(γ(ξj))∣ ∣γ(tj+1)−γ(tj)∣ by [L2].

2.1step 1.1L1L3

By [L3], each chord in step 1.1 is at most sγ(tj+1)−sγ(tj). The resulting tagged arc-length sums converge to the existing absolute line integral from [L1].

3.1step 1.1step 2.1L1∎

Letting the mesh tend to 0, [L1] identifies the limit of SP with the complex line integral and step 2.1 identifies the majorant limit with the absolute integral, proving the inequality with sharp constant 1. The same argument includes a constant contour: every chord and arc-length increment is 0, so both sides vanish.

Depends on

Used by

Dependency tree · two levels

15 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