Existence of positive tensor rank decompositions for unital symmetric real tensors
Let be a unital symmetric real tensor, meaning that its indices are symmetric and its unit conditions are . A positive tensor rank decomposition is a representation
with positive coefficients and real vectors . Existence conjecture. Every unital symmetric real tensor has a positive tensor rank decomposition. Numerical experiments for found such decompositions for 1,000 random tensors, but no proof is given, so the general assertion remains open.
References
Primary source
Dennis Obster, “Tensors and Algebras: An Algebraic Spacetime Interpretation for Tensor Models”, arXiv:2203.03633 (2023).
Progress summary
A reader-submitted argument claims to prove the conjecture, but no independent verification has been found.
The conjecture asks whether every unital symmetric real tensor admits a decomposition using positive coefficients. The catalogued literature had not reported a resolution as of March 2022.
Community submission (unverified; posted 2026-09-05)
A submitted proof reduces the problem to matching prescribed mass, mean, covariance, and third moments. It uses paired atoms to realize each cubic term while preserving the first two moments, then adds symmetric atoms to complete the covariance and a final atom to restore total mass. The argument claims this yields the required positive decomposition in every finite dimension, but it has not been independently checked.
Current status (as of September 2026): The conjecture remains without an independently verified proof; a community submission claims a complete proof, so the asserted resolution is unconfirmed.
Sources
- arxiv.org
- arxiv.org
- mathoverflow.net
- stat.uchicago.edu
- hal.science
- math.tju.edu.cn
- deepmind.google
- cdn.openai.com
- www-cdn.anthropic.com
- ar5iv.labs.arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- arxiv.org
- ar5iv.labs.arxiv.org
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- mathstodon.xyz
- cdn.openai.com
- www-cdn.anthropic.com
- cdn.openai.com
- cdn.openai.com
- www-cdn.anthropic.com
Solutions 1
ProofAn AI-assisted constructive proof of Obster’s positive-decomposition conjecture using finite moment matching, with strictly positive unit contractions.See full solution
Proof of Conjecture 4.7 in finite dimension.
Let , , with unit , meaning . We construct with , the positivity condition in Obster, equations (4.9)–(4.10). Minimal length is unnecessary (footnote 11).
Choose orthonormal coordinates with , . Then has unit . If with , then decomposes , with . Hence assume .
Put . The unit fixes , , and for ; write the remaining block as . It suffices to construct positive weighted atoms satisfying
because then works. For , use one atom.
By polarization, write , allowing . Choose
Thus and . For each , set
Place weights
These are positive. This pair has mass , first moment zero, second moment , and third moment
Together the pairs therefore have mass , mean zero, second moment , and third moment .
Diagonalize , with and orthonormal . Choose with . Add atoms , each with weight . They supply second moment , with zero first and third moments. Put the remaining positive mass at the origin. All required moments now hold. ∎
The existence statement also follows from established moment theory; see Blekherman–Fialkow (2020), Corollary 2.2. The construction above is self-contained.
Developed with OpenAI Codex and reviewed by Claude Opus 5.