magic_square_strategy_guess_prob
The maximum probability p_guess(K | E, x = 0) of an adversary guessing Alice's first row K in a strategy with effects A and state ρ, defined as the supremum of the guessing success probability over all guessing POVMs M on the adversary system.
Statement
noncomputable def magic_square_strategy_guess_prob {dA dB dE : ℕ} (A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ) (ρ : Matrix ((Fin dA × Fin dB) × Fin dE) ((Fin dA × Fin dB) × Fin dE) ℂ) : ℝ
- Defined in
- arXiv:2610.12001, Theorem 6.1
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Built on 2
- is_povmA finite family of complex d×d matrices indexed by a finite outcome set is a POVM (positive-operator-valued measure): each effect is…
- magic_square_key_guess_successGiven dA dB dE : ℕ, Alice's effects A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ, a complex matrix ρ indexed by (Fin dA × Fin…
Read back from the Lean
magic_square_strategy_guess_prob is a noncomputable definition that takes natural numbers dA, dB, dE, an operator family A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ, and a matrix ρ : Matrix ((Fin dA × Fin dB) × Fin dE) ((Fin dA × Fin dB) × Fin dE) ℂ. It returns the real supremum (sSup) of the set of all real numbers p for which there exists a POVM M : (Fin 3 → Bool) → Matrix (Fin dE) (Fin dE) ℂ of dimension dE such that p = magic_square_key_guess_success A ρ M.
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 maximum probability p_guess(K | E, x = 0) of guessing Alice's first row K in strategy (A, ρ). -/ noncomputable def magic_square_strategy_guess_prob {dA dB dE : ℕ} (A : Fin 3 → (Fin 3 → Bool) → Matrix (Fin dA) (Fin dA) ℂ) (ρ : Matrix ((Fin dA × Fin dB) × Fin dE) ((Fin dA × Fin dB) × Fin dE) ℂ) : ℝ := sSup {p : ℝ | ∃ M : (Fin 3 → Bool) → Matrix (Fin dE) (Fin dE) ℂ, is_povm dE M ∧ p = magic_square_key_guess_success A ρ M}