AFTD Auto-Formalizing Theoretical Domains

symmetric_qubit_fork_xyz

def

The tripartite real matrix symmetric_qubit_fork_xyz p a q t of type Matrix (Fin 2 × (Fin 2 × Fin 2)) (Fin 2 × (Fin 2 × Fin 2)) ℝ for real parameters p, a, q, t : ℝ, defined by p • (Matrix.diagonal ![1, 0]).kronecker ((qubit_state_0 a t).kronecker (qubit_state_0 a t)) + (1 - p) • (Matrix.diagonal ![0, 1]).kronecker ((qubit_state_1 q).kronecker (qubit_state_1 q)).

Statement

noncomputable def symmetric_qubit_fork_xyz (p a q t : ℝ) :
    Matrix (Fin 2 × (Fin 2 × Fin 2)) (Fin 2 × (Fin 2 × Fin 2)) ℝ
Defined in
OP-1440
Verified
11 Nov 2026
Axioms
none listed
Built on 2
  • qubit_state_0The 2x2 real matrix qubit_state_0 a t of type Matrix (Fin 2) (Fin 2) ℝ for real parameters a, t : ℝ, defined as qubit_rotation t *…
  • qubit_state_1The diagonal qubit state sigma_1 with eigenvalues 1-q and q.

Read back from the Lean

A definition of a function symmetric_qubit_fork_xyz taking four real parameters $p, a, q, t : \mathbb{R}$ and returning a real matrix indexed by $(\text{Fin } 2 \times (\text{Fin } 2 \times \text{Fin } 2)) \times (\text{Fin } 2 \times (\text{Fin } 2 \times \text{Fin } 2))$ (an $8 \times 8$ block matrix), defined as: $$p \cdot (p_0 \otimes (s_0 \otimes s_0)) + (1 - p) \cdot (p_1 \otimes (s_1 \otimes s_1))$$ where: - $p_0 = \operatorname{diag}(1, 0) = \begin{pmatrix} 1 & 0 \\ 0 & 0 \end{pmatrix}$ - $p_1 = \operatorname{diag}(0, 1) = \begin{pmatrix} 0 & 0 \\ 0 & 1 \end{pmatrix}$ - $s_0 = \text{qubit\_state\_0}(a, t)$ - $s_1 = \text{qubit\_state\_1}(q)$ - $\otimes$ is the matrix Kronecker product (Matrix.kronecker) - $\cdot$ is scalar multiplication (•) on 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 tripartite state rho_XYZ on Fin 2 x (Fin 2 x Fin 2). -/
noncomputable def symmetric_qubit_fork_xyz (p a q t : ℝ) :
    Matrix (Fin 2 × (Fin 2 × Fin 2)) (Fin 2 × (Fin 2 × Fin 2)) ℝ := let s0 := qubit_state_0 a t
  let s1 := qubit_state_1 q
  let p0 : Matrix (Fin 2) (Fin 2) ℝ := Matrix.diagonal ![1, 0]
  let p1 : Matrix (Fin 2) (Fin 2) ℝ := Matrix.diagonal ![0, 1]
  p • (p0.kronecker (s0.kronecker s0)) + (1 - p) • (p1.kronecker (s1.kronecker s1))
See it in the graphDiscuss this resultChallenge it