One-call commutant has four sector generators
OpenQAlgorithms.Papers.Independent.Support50.P24.oneCallCommutantLet and let be any complex matrix on four -dimensional wires, grouped into two pairs. Put and , where swaps the two factors of a pair. Then
for some complex coefficients . The two group actions are independent. No positivity or causal normalization is imposed on . At the antisymmetric sector vanishes, so the coefficients need not be unique. This characterizes the invariant search space in the one-call example.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P24
noncomputable section
open QAlgorithms MeasureTheory
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
namespace QAlgorithms.Papers.Independent.Support50.P24
attribute [local instance] Classical.decEq Classical.propDecidable
attribute [local instance] QAlgorithms.Papers.Independent.Support50.P24.groupedContinuousENorm
/-- PDF p.3, Eq.(12): arbitrary matrices in the independent tensor-square commutant
are precisely linear combinations of the four physical sectors. At d=1 no uniqueness is claimed. -/
theorem oneCallCommutant (d : ℕ) (hd : 0 < d)
(C : QAlgorithms.Papers.Independent.Next46.P24.CombMatrix d) :
QAlgorithms.Papers.Independent.Next46.P24.InversionCovariant C ↔
∃ coefficient : Bool → Bool → ℂ,
C = ∑ b : Bool, ∑ c : Bool, coefficient b c •
QAlgorithms.Papers.Independent.Next46.P24.inversionSector d b c := by sorry
end QAlgorithms.Papers.Independent.Support50.P24
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every complex matrix whose rows and columns are indexed by quadruples , the following are equivalent: commutes with every matrix
and there exist four complex coefficients , indexed by , such that
where
There are no positivity, Hermiticity, or normalization assumptions on or on the coefficients, and no uniqueness of the coefficients is asserted. The case is included; in that case .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.