analysis / Harmonic analysis

Stein’s dimension-free weak-(1,1) Riesz transform problem

The theorem is the vector-valued endpoint bound ∥Rf∥L1,∞≤2∥f∥L1\|Rf\|_{L^{1,\infty}} \le 2\|f\|_{L^1} for R=(R1,…,Rn)R = (R_1,\ldots,R_n), so the constant 2 also serves each component RjR_j uniformly in the dimension; the best previously known component bound grew like clog⁡nc\log n. The mechanism is a decomposition theorem stated as Theorem 1.2: for every nonnegative f∈L1∩L2f \in L^1 \cap L^2 and every λ>0\lambda > 0, write f=μ+(−Δ)α/2uf = \mu + (-\Delta)^{\alpha/2}u with μ≤λ\mu \le \lambda and uu in the fractional Sobolev space HαH^\alpha, obtained from an obstacle problem for the fractional Laplacian together with a Lewy-Stampacchia type estimate on an unbounded domain. That replaces the Calderon-Zygmund decomposition, whose cube geometry is where the dimensional loss enters.

38Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

analysisAug 18, 2026Significance 38/100Registry: unreviewed

Stein’s dimension-free weak-(1,1) Riesz transform problem

Prior state unknown→proved

The theorem is the vector-valued endpoint bound ∥Rf∥L1,∞≤2∥f∥L1\|Rf\|_{L^{1,\infty}} \le 2\|f\|_{L^1} for R=(R1,…,Rn)R = (R_1,\ldots,R_n), so the constant 2 also serves each component RjR_j uniformly in the dimension; the best previously known component bound grew like clog⁡nc\log n. The mechanism is a decomposition theorem stated as Theorem 1.2: for every nonnegative f∈L1∩L2f \in L^1 \cap L^2 and every λ>0\lambda > 0, write…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

The theorem is the vector-valued endpoint bound ∥Rf∥L1,∞≤2∥f∥L1\|Rf\|_{L^{1,\infty}} \le 2\|f\|_{L^1} for R=(R1,…,Rn)R = (R_1,\ldots,R_n), so the constant 2 also serves each component RjR_j uniformly in the dimension; the best previously known component bound grew like clog⁡nc\log n. The mechanism is a decomposition theorem stated as Theorem 1.2: for every nonnegative f∈L1∩L2f \in L^1 \cap L^2 and every λ>0\lambda > 0, write f=μ+(−Δ)α/2uf = \mu + (-\Delta)^{\alpha/2}u with μ≤λ\mu \le \lambda and uu in the fractional Sobolev space HαH^\alpha, obtained from an obstacle problem for the fractional Laplacian together with a Lewy-Stampacchia type estimate on an unbounded domain. That replaces the Calderon-Zygmund decomposition, whose cube geometry is where the dimensional loss enters.

The theorem is the vector-valued endpoint bound ∥Rf∥L1,∞≤2∥f∥L1\|Rf\|_{L^{1,\infty}} \le 2\|f\|_{L^1} for R=(R1,…,Rn)R = (R_1,\ldots,R_n), so the constant 2 also serves each component RjR_j uniformly in the dimension; the best previously known component bound grew like clog⁡nc\log n. The mechanism is a decomposition theorem stated as Theorem 1.2: for every nonnegative f∈L1∩L2f \in L^1 \cap L^2 and every λ>0\lambda > 0, write f=μ+(−Δ)α/2uf = \mu + (-\Delta)^{\alpha/2}u with μ≤λ\mu \le \lambda and uu in the fractional Sobolev space HαH^\alpha, obtained from an obstacle problem for the fractional Laplacian together with a Lewy-Stampacchia type estimate on an unbounded domain. That replaces the Calderon-Zygmund decomposition, whose cube geometry is where the dimensional loss enters.

Recorded attempts

Evidence graph

Connected research record