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.
Sobolev lower bound for continuous parameter selection
Statement
Assume the Axiom of Choice. Let be integers, , and let consist of the continuous functions whose restrictions represent members of satisfying There exists such that, for every integer , every map , and every map continuous for the uniform norm on , No continuity or measurability assumption is imposed on . In particular, if this supremum is at most , then for some depending only on .
Statement references
Facts & Assumptions
Given: AC, , , arbitrary , and selection continuous for the uniform-norm topology as in the statement.
A function is in the indicated Sobolev ball exactly when its weak derivatives through order , including the function itself, have norms at most one (Integer-order Sobolev spaces and their norms).
Every continuous map takes the same value at some antipodal pair, under AC (Borsuk–Ulam theorem in every dimension).
Proof
Define for and otherwise, and put . The one-sided derivatives of of orders vanish at each endpoint because the polynomial has a zero of multiplicity there. Hence the zero extension is , and is supported in , is one at its center, and lies between zero and one. Set This is finite since the derivatives are continuous polynomials on the compact cube and zero outside it. Their classical derivatives are weak derivatives: integrate by parts successively in each coordinate against a compactly supported smooth test function; endpoint terms vanish because the derivatives below order match their zero extensions. This also verifies the weak derivative identity after every scaling and finite sum used below.
Set and . Partition into closed coordinate cubes of side , and take the first in lexicographic order. Write for their lower vertices and put Distinct supports have disjoint interiors; all derivatives of orders at most vanish on their boundaries. Thus, for , the sum satisfies . The weak derivative verification in step 1.1 proves . Disjoint interiors, and evaluation at the centers, give the exact identity In particular is linear, odd and continuous into with its uniform norm.
For , put . Its denominator is nonzero, and is continuous and odd with . Therefore is continuous into . By [F2], some antipodal pair has equal images. Setting , we obtain and .
Let . The triangle inequality yields At least one of the two errors is at least . Because , this is at least with . This proves the asserted supremum bound without any regularity of .
If every error is at most , step 4.1 gives . Since implies , we obtain . The construction works at , , , on cubes touching the boundary and when , with exactly the same vanishing-derivative argument. AC is inherited from [F2] and subsumes the countable choice in [F1]; choosing finitely many indexed cubes or derivatives introduces no new choice principle.
Depends on
Used by
Dependency tree · two levels
18 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
- Ronald DeVore, Ralph Howard, Charles Micchelli, Optimal nonlinear approximation (standard reference, not scraped)
- Dmitry Yarotsky, Error bounds for approximations with deep ReLU networks (standard reference, not scraped)