AlphaProof Nexus
Solved autonomously by AlphaProof Nexus, with the proofs formally verified in Lean.
Provider: Google DeepMind · Prompt public: unknown · Independence: unknown
Problem detail · source-aware
Monochromatic Quantum Graphs in the Diagonal Family
VibeMathed reports this item as partial. VibeMath preserves that report as a source assertion and has not independently authored a plain-language mathematical explanation.
Precise statement
Can a complete edge-coloured, complex-weighted graph realize perfect-matching amplitudes of one on every monochromatic inherited vertex colouring and zero otherwise? Nonexistence is proved in the diagonal family $N = D$ for every even $N \ge 4$, alongside further finite cases.
The source statement is reproduced for indexing with attribution. Mathematical correctness requires domain-expert or mechanical review. VibeMath has not independently audited statement fidelity, correctness, priority, or novelty.
What AI did
Verification boundary
Lean-checked; formal proofs published with DeepMind's AlphaProof Nexus report (arXiv:2605.22763).
Correctness: supported · statement fidelity: audited · peer review: none
Timeline
-
arXiv:2605.22763 - AlphaProof Nexus report
the diagonal family is ruled out; the broader two-parameter problem remains open
Known method families
construction (source-reported)
Source-reported tools: construction.
Independent: unknown · difference confidence: 0
What remains uncertain
VibeMath has not independently audited the mathematical statement, proof, or novelty claim.
- VibeMath has not independently verified the mathematical claim.
- AI-attempt independence and training-data exposure are unknown unless explicitly documented.
- VibeMath has not independently audited the mathematical statement, proof, or novelty claim.