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.
Hölder at the conjugate pair , : an exact equality instance and a strict instance
Example
and are conjugate rationals, . For the two-entry lists , Hölder's inequality for finite sums (rational exponents) reads
so both sides are equal here. For and the inequality is strict: the left-hand side is and the right-hand side is .
Facts & Assumptions
Given: The two-entry lists , and the lists , , , .
Hölder's inequality (Hölder's inequality for finite sums (rational exponents)): for conjugate rationals and reals , ; it records no equality characterization.
Two-entry sums (Finite sums and finite products, by recursion, Laws of finite sums and finite products): , sums are additive and scale, and the constant sum is .
Absolute values (Basic properties of the absolute value, Absolute value in an ordered field): , only for , and , , .
Rational powers (Rational powers of a positive base, Laws of rational exponents): for every rational ; and for ; and for rational .
Verification
The equality instance: with all four entries equal to , [L2] gives , and by [L3] and [L4]; the right-hand side is by [L4], so [L1] holds with both sides equal to here.
The strict instance: for and , [L2] and [L3] give , while and by [L4]; hence the right-hand side is by [L4], and , so the inequality is strict at this pair.
Summary: at , the inequality of [L1] is an equality on the constant list of ones (step 1.1) and strict on the disjoint-support pair , (step 1.2); since [L1] records no equality characterization, only the two evaluations and the inequality itself are asserted, and the exact agreement in step 1.1 is a computation and not a claimed equality criterion.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
36 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
- John K. Hunter, An Introduction to Real Analysis (author-hosted complete lecture notes, University of California at Davis) (standard reference, not scraped)