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.
Interpolation for the two-by-two Hadamard matrix
Example
For two-point counting measure, the matrix acts by . Its norm is 1 and its norm is . For its norm is at most .
Facts & Assumptions
On counting measure the Lp norms are the corresponding finite sums or essential maximum Complex Lp classes and Euclidean test-function conventions.
A complex-linear core map with endpoint bounds A and B has the stated conjugate-exponent bound Interpolate L1 to Linfinity and L2 to L2 bounds.
Verification
Given: The objects and hypotheses in the statement.
Counting measure assigns masses to the four subsets and is countably additive because a disjoint family has at most two nonempty members. Every complex tuple is a finite simple function and H is complex-linear. The complex Lp conventions give , , and . Since , the first operator norm is at most one; the input (1,0) has input norm one and output (1,1) of infinity norm one, so the norm is exactly one.
Expanding with complex conjugates gives , since the two cross terms cancel. Hence , proving the second operator norm exactly. For , apply F2 with A=1 and B=sqrt(2): . The endpoints are the two direct calculations.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
21 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
- Laugesen Theorem C.6; explicit finite matrix calculation (standard reference, not scraped)