Theorem 6: k-body central orthogonality
OpenQAlgorithms.Papers.Independent.Intakenext100.P38.generatorsK_orthogonalLet denote the number of qubits, with computational basis indexed by . Write for the unnormalized sum of distinct phase-zero Pauli words with copies of , copies of the standard , and copies of . All Lie closures, linear spans, and dimensions below are over ; commutators are .
For , let and .
For , define
In particular . For every and every ,
The two cases are a union, as confirmed by the source's explanation after (39) and equation (E8). This avoids an empty literal conjunction.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P38
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P38
open scoped BigOperators
open QAlgorithms.Papers.Independent.Support50.P30
(QnnOperator qubitPermutationMatrix PermutationEquivariant)
attribute [local instance] LieRing.ofAssociativeRing
/-- PDF pp.6,21, Theorem 6: 'mu=0 and high mu' enumerates a UNION of cases,
confirmed by the '(or mu=0)' explanation after (39) and by (E8). -/
theorem generatorsK_orthogonal {n k : ℕ} (hk : 2 ≤ k) (hkn : k ≤ n)
(H : QnnOperator n) (hH : H ∈ generatorsK n k) (mu : ℕ)
(hmu : 2 * mu ≤ n) (hcase : mu = 0 ∨ k / 2 < mu) :
Matrix.trace (H * centralElement n mu) = 0 := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P38
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all natural numbers satisfying , let be the sum of all -fold Pauli tensor products having exactly factors , factors , factors , and identities elsewhere. For every complex matrix
and every natural number satisfying and either or , define
Then as a complex number. The index is explicitly allowed and gives ; if , it is the only index satisfying the stated conditions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.