AFTD Auto-Formalizing Theoretical Domains

magic_square_winning_op

def

Given dimensions dA and dB, Alice's matrix effects A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ and Bob's matrix effects B : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dB) (Fin dB) ℂ, the bipartite winning operator is the (dA × dB) by (dA × dB) complex matrix given by (1 / 9 : ℂ) • ∑ x : Fin 3, ∑ j : Fin 3, ∑ s : Fin 3 → Bool, ∑ c : Fin 3 → Bool, if s j = c x then (A x s ⊗ₖ B j c) else 0, where ⊗ₖ is the matrix Kronecker product.

Statement

noncomputable def magic_square_winning_op {dA dB : ℕ}
    (A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ)
    (B : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dB) (Fin dB) ℂ) :
    Matrix (Fin dA × Fin dB) (Fin dA × Fin dB) ℂ
Defined in
arXiv:2610.12001, page 19, line 1027
Verified
08 Nov 2026
Axioms
none listed
Used by 3
  • magic_square_winning_op_zero_leftFor any dimensions dA and dB and any Bob matrix effects B : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dB) (Fin dB) ℂ, if Alice's matrix effects…
  • magic_square_winning_op_sub_det_row0_leFor any valid measurement effects A for Alice and B for Bob in the magic square game (where each A x is a POVM with support on even…
  • magic_square_winning_op_det_row0Given dimensions dA and dB, Alice's matrix effects A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ, Bob's matrix effects B : Fin 3…

Read back from the Lean

Given natural numbers dA and dB, and families of complex matrices A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ and B : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dB) (Fin dB) ℂ, magic_square_winning_op A B is defined as the complex matrix indexed by Fin dA × Fin dB given by: (1/9 : ℂ) • ∑_{x : Fin 3} ∑_{j : Fin 3} ∑_{s : Fin 3 → Bool} ∑_{c : Fin 3 → Bool} (if s j = c x then A x s ⊗ₖ B j c else 0), where ⊗ₖ is the Kronecker product of matrices.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The bipartite winning operator for the magic square game with Alice's effects A and Bob's effects B. -/
noncomputable def magic_square_winning_op {dA dB : ℕ}
    (A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ)
    (B : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dB) (Fin dB) ℂ) :
    Matrix (Fin dA × Fin dB) (Fin dA × Fin dB) ℂ := open scoped Kronecker in
  (1 / 9 : ℂ) • ∑ x : Fin 3, ∑ j : Fin 3, ∑ s : Fin 3 → Bool, ∑ c : Fin 3 → Bool,
    if s j = c x then (A x s ⊗ₖ B j c) else 0
See it in the graphDiscuss this resultChallenge it