AFTD Auto-Formalizing Theoretical Domains

qubit_plane_infimum_distance

deforiginal

The infimum distance D of a family of Hermitian jump operators J_j to any embedded qubit plane, normalized by W.

Statement

noncomputable def qubit_plane_infimum_distance {ι : Type*} [Fintype ι] {d : ℕ}
    (J : ι → Matrix (Fin d) (Fin d) ℂ) (W : ℝ) : ℝ
Related work
arXiv:2610.37187
Verified
15 Nov 2026
Axioms
none listed
Built on 2
  • EmbeddedQubitPlaneAn embedded qubit plane in dimension d consists of a rank-two orthogonal projector P and an orthonormal pair E1, E2 of traceless Hermitian…
  • qubit_plane_distanceThe normalized squared distance of a family of Hermitian operators J_j to an embedded qubit plane Q, given by (sum_j ||J_j -…

Read back from the Lean

The definition qubit_plane_infimum_distance takes a finite index type ι, a dimension d : ℕ, a family of d × d complex matrices J : ι → Matrix (Fin d) (Fin d) ℂ, and a real parameter W : ℝ. It returns the real number defined as the infimum (sInf) over all embedded qubit planes Q : EmbeddedQubitPlane d of qubit_plane_distance J W Q.

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 infimum normalized squared distance D over all embedded qubit planes. -/
noncomputable def qubit_plane_infimum_distance {ι : Type*} [Fintype ι] {d : ℕ}
    (J : ι → Matrix (Fin d) (Fin d) ℂ) (W : ℝ) : ℝ :=
  sInf (Set.range (qubit_plane_distance J W))
See it in the graphDiscuss this resultChallenge it