Strang’s conjecture

Let Δ\Delta be a triangulation of a simply connected polygonal domain Ω⊂R2\Omega\subset\mathbb{R}^2, let f1∘f_1^\circ and f0∘f_0^\circ denote the numbers of interior edges and interior vertices of Δ\Delta, and define Sk1(Δ)={s∈C1(Ω):s∣T∈Pk(T) for every triangle T∈Δ}S_k^1(\Delta)=\{s\in C^1(\Omega):s|_T\in\mathbb{P}_k(T)\text{ for every triangle }T\in\Delta\}. Strang's conjecture asserts the dimension formula dim⁡Sk1(Δ)=(k+22)+f1∘(k2)−f0∘(k−22)\dim S_k^1(\Delta)=\binom{k+2}{2}+f_1^\circ\binom{k}{2}-f_0^\circ\binom{k-2}{2}, with (n2)=0\binom{n}{2}=0 when n<2n<2, for the relevant degrees kk.

References

Progress summary

Refreshed
Claimed progress

The general dimension formula is not proved: many cases are settled, but the cubic case and some low-degree cases remain open, with a new test covering only a restricted class.

Strang proposed the dimension formula in 1974, initially for the case r=1r=1, k=3k=3. The broader conjecture asks when the expected dimension formula holds for C1C^1 polynomial splines on triangulations; it is not universally valid in low degrees.

Known results

  • Schumaker proved the conjectured expression is always a lower bound.
  • Alfeld–Schumaker proved equality for k≥4r+1k\geq 4r+1; Hong improved this to k≥3r+2k\geq 3r+2.
  • Billera proved the r=1r=1, k=3k=3 case for generic triangulations.
  • Morgan–Scott gave a counterexample at r=1r=1, k=2k=2; equality is known for all triangulations when k=4k=4 or k≥5k\geq 5, while k=3k=3 remains open.

August 2026 positive result

An unrefereed preprint gives an equivalent surjectivity criterion, supplies code for computational checks, and proves the k=2k=2 case for strongly collapsible complexes satisfying an additional non-collinearity condition. This is a restricted positive result, not a resolution of the general conjecture.

Current status (as of September 2026): The formula is settled for k=4k=4 and k≥5k\geq 5, fails in general for k=2k=2, and remains open for k=3k=3; the August preprint adds only an unverified restricted case and a computational criterion.

Sources

Solutions 0

No solutions have been posted yet.