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 bounds for rational integrands on a semicircular arc and a line segment
Example
On the upper semicircle , . On the segment from to ,
Facts & Assumptions
Given: The two oriented contours and rational integrands in the Example.
If on a rectifiable contour, then (ML estimate: a contour integral is bounded by a supremum bound times path length).
A piecewise- path has length equal to the sum of its speed integrals (A continuous piecewise- path is rectifiable and its length is the sum of the speed integrals over its pieces).
Complex modulus is multiplicative and obeys the triangle inequality (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Verification
On , the reverse triangle inequality from [L3] gives , so ; [L2] gives semicircle length , and [L1] gives the first bound.
On , , one has and , so [L3] gives .
The segment length is by [L2], so [L1] gives the second bound. Both contours stay a positive distance from their poles.
Depends on
- ML estimate: a contour integral is bounded by a supremum bound times path length
- A continuous piecewise-$C^1$ path is rectifiable and its length is the sum of the speed integrals over its pieces
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 53 results over 13 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- R. Howell and J. Mathews, Complex Analysis, §6.2 (standard reference, not scraped)