When the noncommutative AM-GM inequality holds
Source: github.com/lowrank/noncommutative-amgm-lean/tree/26ecfa508f…
For arbitrary real positive semidefinite matrices A_i whose sum is at most n I, the uniform average W of ordered products of m distinct matrices satisfies -I = 2 ceil(m/2)^2. When n >= 4m^2 its lower bound improves to -(1-1/(2m)) I. The formalization also proves the stronger lower bound -(1-1/m) I at the quadratic threshold, the original sine-node criterion, and the cubic-size corollary. The statements retain the original arbitrary PSD and sum-at-most-nI hypotheses. Harmonic decomposition, positive root quadratures, matrix Gram factors, normalized coefficient extraction, and the original…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-19-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-19-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'