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.
An explicit norming functional for the finite-dimensional maximum norm
Example
Let and . Equip with . For let be the least index attaining , and put Conjugation is trivial over . Then and . At the zero functional attains the unit-dual-ball norm formula. For , use the unique zero norm on the zero vector space, which has no norm-one functional.
For a displayed nonuniqueness instance, at the distinct functionals and both have norm one and value . This entire finite-coordinate construction works in ZF without assuming HB.
Facts & Assumptions
A finite nonempty list of real numbers has a maximum and minimum (Every nonempty finite set of reals has a maximum and a minimum).
Every nonempty subset of the natural numbers has a least element (The well-ordering principle).
The dual is the bounded scalar-linear functionals, with norm the supremum of absolute values on the closed unit ball (The dual space X^* of a normed space and its dual norm).
The norm axioms use absolute homogeneity with the modulus over either field (Real and complex scalar conventions for normed spaces).
Verification
Given: or , , and the displayed coordinate formulas, with the zero-dimensional case treated separately.
For , the finite list has a maximum. It is nonnegative and is zero exactly when each coordinate is zero. For any scalar , , including . Also each , and taking the maximum gives the triangle inequality. These verify that is a norm over either field.
For , the set of maximizing indices in is nonempty. Its least element exists by natural-number well-ordering. Then , so is defined and . The formula satisfies , and . Thus is scalar-linear and bounded, with .
Let have coordinate one in position and zero elsewhere, and put . Then and . Thus , proving . Also .
For any bounded linear of norm at most one and nonzero , ; step 3.1 attains equality. At , every linear gives value zero and the zero functional attains the same maximum. For the vector space has just zero and every linear functional sends it to zero, so the dual has only the zero functional of norm zero; its unit ball is nonempty but it has no norm-one element.
At , . Each coordinate functional satisfies and , so for . Both give , while and , so they are distinct. In dimension one the same displayed construction is , with its norm and value computed in steps 2.1 and 3.1. No extension or infinite selection was used.
Source notes
Brezis Corollary 1.3 and Remark 2, pp.3–4 (finite explicit specialization); Teschl Theorem 4.20 proof, p.116 (norming criterion).
Depends on
Used by
Nothing in the library uses this result yet.
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
- Haim Brezis, Functional Analysis, Sobolev Spaces and Partial Differential Equations, §§1.1–1.2 and §1.3 evaluation paragraph (standard reference, not scraped)
- Gerald Teschl, Topics in Real and Functional Analysis, Theorems 4.13–4.20 and §5.1 (2018 university-hosted copy) (standard reference, not scraped)