Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 d,n≥1 be integers, Q=[0,1]d, and let Fd,n⊂C(Q;R) consist of the continuous functions whose restrictions represent members of Wn,∞((0,1)d) satisfying max⁡∣α∣≤n∥Dαf∥L∞((0,1)d)≤1. There exists cd,n>0 such that, for every integer W≥1, every map η:RW→C(Q;R), and every map M:Fd,n→RW continuous for the uniform norm on Fd,n, sup⁡f∈Fd,n∥f−η(M(f))∥∞≥cd,n(W+1)−n/d. No continuity or measurability assumption is imposed on η. In particular, if this supremum is at most ε>0, then W≥Cd,nε−d/n for some Cd,n>0 depending only on d,n.

Facts & Assumptions

Given: AC, d,n,W≥1, Fd,n, arbitrary η, and selection M continuous for the uniform-norm topology as in the statement.

[F1]

A function is in the indicated Sobolev ball exactly when its weak derivatives through order n, including the function itself, have L∞ norms at most one (Integer-order Sobolev spaces and their norms).

[F2]

Every continuous map SW→RW takes the same value at some antipodal pair, under AC (Borsuk–Ulam theorem in every dimension).

Proof

1.1F1constructalgebra

Define p(t)=(4t(1−t))n+1 for 0≤t≤1 and p(t)=0 otherwise, and put ψ(x)=∏r=1dp(xr). The one-sided derivatives of p of orders 0,…,n vanish at each endpoint because the polynomial has a zero of multiplicity n+1 there. Hence the zero extension is Cn(R), and ψ∈Cn(Rd) is supported in [0,1]d, is one at its center, and lies between zero and one. Set B=max⁡∣α∣≤n∥Dαψ∥∞≥1. 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 n match their zero extensions. This also verifies the weak derivative identity after every scaling and finite sum used below.

2.1F1step 1.1constructalgebra

Set N=W+1 and k=⌈N1/d⌉. Partition Q into kd closed coordinate cubes of side 1/k, and take the first N in lexicographic order. Write vj for their lower vertices and put ϕj(x)=B−1k−nψ(k(x−vj)),j=1,…,N. Distinct supports have disjoint interiors; all derivatives of orders at most n vanish on their boundaries. Thus, for u=(u1,…,uN)∈[−1,1]N, the sum T(u)=∑jujϕj satisfies ∥DαT(u)∥∞≤B−1k∣α∣−n∥Dαψ∥∞≤1. The weak derivative verification in step 1.1 proves T(u)∈Fd,n. Disjoint interiors, and evaluation at the centers, give the exact identity ∥T(u)∥∞=B−1k−nmax⁡j∣uj∣. In particular T is linear, odd and continuous into C(Q) with its uniform norm.

3.1F2step 2.1construct

For z∈SN−1=SW, put R(z)=z/∥z∥∞. Its denominator is nonzero, and R is continuous and odd with ∥R(z)∥∞=1. Therefore z↦M(T(R(z))) is continuous into RW. By [F2], some antipodal pair has equal images. Setting f=T(R(z)), we obtain M(f)=M(−f) and ∥f∥∞=B−1k−n.

4.1step 3.1algebra

Let q=η(M(f))=η(M(−f)). The triangle inequality yields 2B−1k−n=∥f−(−f)∥∞≤∥f−q∥∞+∥−f−q∥∞. At least one of the two errors is at least B−1k−n. Because k≤2N1/d, this is at least cd,nN−n/d with cd,n=2−nB−1>0. This proves the asserted supremum bound without any regularity of η.

5.1F1F2step 4.1algebra∎

If every error is at most ε, step 4.1 gives W+1≥(cd,n/ε)d/n. Since W≥1 implies W+1≤2W, we obtain W≥12cd,nd/nε−d/n. The construction works at W=1, d=1, n=1, on cubes touching the boundary and when N=kd, 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