χ_R(∣T3⟩^⊗5) ≥ 6

T₃ orbit, qutrit.

Participate

Run it yourself, or point a coding agent at it.

git clone https://github.com/unitaryfoundation/stabrank
cd stabrank
# describe your decomposition in bounds/mybound.json
make fit BOUND=bounds/mybound.json ARGS=--write
make verify BOUND=bounds/mybound.json

fit solves for the exact coefficients, or tells you no exact combination of your terms reproduces the target. verify rebuilds the identity in exact arithmetic. If it passes, open a pull request adding the file and the leaderboard picks it up on the next build.

A bound the pipeline cannot check is recorded as cited and never takes a record.

← back to the board

Verification

reproduced certificate script asserted: CERTIFIED chi(T3^5) >= 6

Compute

1 run; 0.15 CPU-hours; 0.03 h wall-clock; on Apple silicon laptop, 6 worker processes.

Notes

Puts the cell at 6 ≤ χ ≤ 18. The certificate re-runs the m=3 rank-6 exclusion (Galois descent cutting the search to 45 candidate lines, then exhaustion with every candidate rejected in exact arithmetic over Q(ω₉)) and applies projection monotonicity: χ(ψ ⊗ φ) ≥ χ(ψ) whenever φ has a nonzero computational amplitude. The sector decomposition behind the upper bound gives no better lower bound, since max_j χ(c_j) ≤ χ(T3^5) and the sectors are only known to have rank between 5 and 6. Beating the published exponent 1/2 at m=5 needs rank 15, which is rank 5 in every sector.

Attribution

this repository · stabrank cert_t3m3_rank6.py · projection monotonicity applied twice to the certified χ(T3^3) ≥ 6

Submission

JSON

{
  "schema_version": "0.1",
  "orbit": "T3",
  "m": 5,
  "direction": "lower",
  "rank": 6,
  "certificate": {
    "script": "verify_challenge/cert_t3_m5_from_m3.py",
    "expect": "CERTIFIED chi(T3^5) >= 6"
  },
  "provenance": {
    "author": "this repository",
    "reference": "stabrank cert_t3m3_rank6.py",
    "method": "projection monotonicity applied twice to the certified chi(T3^3) >= 6",
    "date": "2026-09-18",
    "github": [
      "vprusso"
    ],
    "compute": {
      "cpu_hours": 0.15,
      "wall_clock_hours": 0.03,
      "runs": 1,
      "hardware": "Apple silicon laptop, 6 worker processes"
    }
  },
  "notes": "Puts the cell at 6 <= chi <= 18. The certificate re-runs the m=3 rank-6 exclusion (Galois descent cutting the search to 45 candidate lines, then exhaustion with every candidate rejected in exact arithmetic over Q(w9)) and applies projection monotonicity: chi(psi (x) phi) >= chi(psi) whenever phi has a nonzero computational amplitude. The sector decomposition behind the upper bound gives no better lower bound, since max_j chi(c_j) <= chi(T3^5) and the sectors are only known to have rank between 5 and 6. Beating the published exponent 1/2 at m=5 needs rank 15, which is rank 5 in every sector."
}