p. 2, Eq. (2) — the gravitationally evolved state is entangled unless
ProvedBMV2017.psiEnd_entangledLet (basis or , or ; first factor = mass 1; , ; global phase omitted). If for every integer , then is not a product vector: there are no with .
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_BMV2017_defs open Matrix open scoped Kronecker ComplexOrder
namespace BMV2017
theorem psiEnd_entangled (α β : ℝ) (h : ∀ n : ℤ, α + β ≠ 2 * Real.pi * n) :
¬ IsProductVector (psiEnd α β) := by sorry
end BMV2017Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Theorem BMV2017.psiEnd_entangled. Let be arbitrary real numbers (the only binders), and assume the single hypothesis
where the integer is regarded as a real number, i.e. is not an integer multiple of (equivalently ). Then the two-qubit vector is not a product vector.
Unfolded definitions. A qubit index ranges over , and a two-qubit vector is any function (no normalization is imposed anywhere). The vector is defined by with
so, listing components in the order ,
Here the first index is the first qubit; sits on and on . A vector is a product vector if there exist arbitrary functions (not required to be nonzero or normalized) with for all . The conclusion therefore says: there are no complex numbers satisfying simultaneously
Logical strength and edge cases. The statement is a one-directional implication: " not a product vector". It asserts nothing about the case (including ); in that case the hypothesis fails and the theorem is silent (it does not claim the vector is a product there, nor the converse). The hypothesis is satisfiable (e.g. ), so the theorem is not vacuous. For a array, being a product is equivalent to , so the hypothesis is exactly the condition . "Entangled" in the theorem's name is expressed only through this non-factorization of the vector; no density matrix, partial trace, purity, separability, witness, or Kraus/positivity notion from the imported files appears in the statement.