AFTD Auto-Formalizing Theoretical Domains

ghz_two_copy_closed_lower_bound

theoremverifiedformalization

For every parameter alpha, there exist orthonormal frames e and f in O(3) and setting indices mu, nu, mu', nu' in {0, 1, 2, 3} such that the two-copy closed-network quantity Lambda(tau_{mu nu}, tau_{mu' nu'}) equals 1 + sin^2(2*alpha).

Statement

theorem ghz_two_copy_closed_lower_bound (α : ℝ) : ∃ (e f : Matrix (Fin 3) (Fin 3) ℝ), e ∈ Matrix.orthogonalGroup (Fin 3) ℝ ∧ f ∈ Matrix.orthogonalGroup (Fin 3) ℝ ∧ ∃ (μ ν μ' ν' : Fin 4), bell_network_lambda (ghz_correlation_vector α e f μ ν) (ghz_correlation_vector α e f μ' ν') = 1 + Real.sin (2 * α) ^ 2
Formalizes
arXiv:2610.35838 Corollary 1 (Eq. 15)
Verified
01 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • bell_network_lambdaFor vectors u, v in R^3, Lambda(u, v) is defined as (1/2) * (s + sqrt(s^2 - 4 * (u . v)^2)) where s = |u|^2 + |v|^2.
  • ghz_correlation_vectorFor parameter alpha in R, orthonormal frames e, f of R^3, and indices mu, nu in {0, 1, 2, 3}, the correlation vector tau_{mu nu} has…
  • ghz_network_lambda_standard_frameFor the generalized GHZ state with parameter alpha, the identity frames e = I and f = I at indices (3, 0) and (1, 1) satisfy…

Read back from the Lean

For every real number α, there exist 3 × 3 real matrices e and f such that: 1. e is an orthogonal matrix (e ∈ O(3, ℝ)), 2. f is an orthogonal matrix (f ∈ O(3, ℝ)), and 3. there exist indices μ, ν, μ', ν' ∈ Fin 4 (i.e. {0, 1, 2, 3}) such that bell_network_lambda (ghz_correlation_vector α e f μ ν) (ghz_correlation_vector α e f μ' ν') = 1 + Real.sin (2 * α) ^ 2.

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

The proof, explained

The proof establishes the lower bound by providing explicit witnesses for all existential quantifiers. Both orthonormal frames are chosen to be the 3x3 identity matrix, which lies in the orthogonal group O(3). Selecting the measurement indices (mu, nu, mu', nu') = (3, 0, 1, 1), the evaluation reduces directly to the lemma ghz_network_lambda_standard_frame.

  1. It suffices to find setting indices achieving the target value when both orthonormal frames e and f are chosen to be the identity matrix.

    We instantiate the existential quantifiers for the frames e and f with the identity matrix 1. Since Matrix.orthogonalGroup is formalized as a submonoid of matrices, the identity matrix belongs to it by Submonoid.one_mem.

    lines 3–4

    uses Submonoid.one_mem

      use 1, 1
      refine ⟨Submonoid.one_mem _, Submonoid.one_mem _, ?_⟩
  2. The lower bound 1 + sin^2(2*alpha) is attained with the setting indices (mu, nu, mu', nu') = (3, 0, 1, 1).

    We provide the explicit setting indices mu = 3, nu = 0, mu' = 1, and nu' = 1. The resulting equality for the standard identity frames is exactly the statement of ghz_network_lambda_standard_frame.

    lines 5–6

    uses ghz_network_lambda_standard_frame

      use 3, 0, 1, 1
      exact ghz_network_lambda_standard_frame α
Submonoid.one_mem
The identity element 1 is a member of any submonoid.
ghz_network_lambda_standard_frame
In the standard frame (where both e and f are the identity matrix), the closed-network quantity Lambda for setting indices (3, 0) and (1, 1) equals 1 + sin^2(2*alpha).

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- Analytical lower bound: there exist orthonormal frames attaining 1 + sin^2(2*alpha). -/theorem ghz_two_copy_closed_lower_bound (α : ℝ) : ∃ (e f : Matrix (Fin 3) (Fin 3) ℝ), e ∈ Matrix.orthogonalGroup (Fin 3) ℝ ∧ f ∈ Matrix.orthogonalGroup (Fin 3) ℝ ∧ ∃ (μ ν μ' ν' : Fin 4), bell_network_lambda (ghz_correlation_vector α e f μ ν) (ghz_correlation_vector α e f μ' ν') = 1 + Real.sin (2 * α) ^ 2 := by  use 1, 1  refine ⟨Submonoid.one_mem _, Submonoid.one_mem _, ?_⟩  use 3, 0, 1, 1  exact ghz_network_lambda_standard_frame α
See it in the graphDiscuss this resultChallenge it