Theorem 4: coefficient sufficiency
OpenQAlgorithms.Papers.Independent.Intakenext100.P38.twoBody_coefficient_sufficiencyLet 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 .
Let and let be its actual dynamical Lie algebra.
For real coefficients on the valid triples , put
For and every such real coefficient family,
This is sufficiency for membership in the actual generated Lie algebra; no orthogonality property of that algebra is assumed.
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,14–19, Theorem 4: sufficiency for the ACTUAL Lie closure;
no necessary-orthogonality theorem is assumed as an input. -/
theorem twoBody_coefficient_sufficiency {n : ℕ} (hn : 2 ≤ n)
(c : ℕ → ℕ → ℕ → ℝ)
(hc : ∀ mu : ℕ, 2 * mu ≤ n → mu ≠ 1 → centralCoefficient c mu = 0) :
coefficientCombination n c ∈ g2 n := 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 every natural number and every function , let be the sum of all -fold Pauli tensor products with exactly factors , factors , factors , and identities elsewhere. Suppose that for every natural number with and ,
Then
belongs to the smallest real Lie subalgebra of complex matrices on -bit strings, with bracket , containing , , and . The hypothesis includes , so ; it imposes no condition at , and coefficients at triples whose sum exceeds do not enter the conclusion.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.