§5: four covariance types and the operational diagonalizations
OpenQAlgorithms.Papers.Independent.Intakenext100.P46.four_typesFor a physical standard two-mode covariance let , , with . Select the symmetric chart first if . Otherwise compare and : type I has , type II has , and type III has . In type I the local squeeze parameter and the subsequent two-mode squeeze satisfy
In type II they satisfy
Here has diagonal ; applying or after diagonalizes the covariance. The rotation has rows and , and has diagonal and off-diagonal . In type III, or , and a block symplectic Williamson transformation exists. In the symmetric chart the explicit transformation of Eqs. (12)–(14) applies. This classifies the operational charts without claiming their unprioritized predicates are disjoint. In both generic cases there are further positive local squeeze parameters for which converts the resulting diagonal covariance to , with . Thus the operations give the full normal form, including the final local normalization.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P46
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P46
open scoped BigOperators ENNReal ComplexOrder Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.RealRegisters (Hilbert)
open QAlgorithms.Papers.Independent.Dependency50.P33 (State IsSeparable)
open QAlgorithms.Papers.Independent.Dependency50.P13
(finiteRelativeEntropy compression entropyWeight)
open QAlgorithms.Papers.Independent.Claimed50.P47
(Occupation bipartiteCharacteristic bipartiteWeyl gaussianStateCharacteristic)
-- These accepted definitions have the same completed Hilbert-space meaning.
open QAlgorithms.Papers.Independent.Next46.P13 (coordinateBasis)
open QAlgorithms.Papers.Independent.Frontier18.P18 (operatorCoeff boundedOperator)
open QAlgorithms.Papers.Independent.Claimed50.P41 (IsDiagonal)
/-- Chen, PDF pp.8–9, (36): four covariance charts and operational
squeeze/rotation diagonalizations. Ratio predicates overlap at symmetry; the
symmetric chart is selected first. Inverse formulas never run at a=b. -/
theorem four_types (a b c1 c2 : ℝ) (hphysical : IsPhysicalCovariance (standardCM a b c1 c2))
(hc1 : 0 < c1) (hc2 : 0 < c2) :
covarianceType a b c1 c2 ∈ ({1, 2, 3, 4} : Set ℕ) ∧
(a = b →
let S := symplecticLift (symmetricSq (2 * a) (2 * c1) (2 * c2))
standardCM a b c1 c2 = S * normalDiagonal
(symmetricGammas (2 * a) (2 * c1) (2 * c2)) * S.transpose) ∧
(a ≠ b → c1 / c2 + c2 / c1 < a / b + b / a →
let x := Real.sqrt ((a * c1 - b * c2) / (a * c2 - b * c1))
0 < x ∧ ∃ r : ℝ,
Real.tanh (2 * r) = -2 * Real.sqrt ((a * c1 - b * c2) *
(a * c2 - b * c1)) / |a ^ 2 - b ^ 2| ∧
IsDiagonal (congruence (squeezeBoth r * xSqueeze x) (standardCM a b c1 c2)) ∧
∃ (xp y : ℝ) (g : Two → ℝ), 0 < xp ∧ 0 < y ∧ (∀ j, 1 / 2 ≤ g j) ∧
congruence (ySqueeze y * xSqueeze xp * squeezeBoth r * xSqueeze x)
(standardCM a b c1 c2) = normalDiagonal g) ∧
(a ≠ b → a / b + b / a < c1 / c2 + c2 / c1 →
let x := Real.sqrt ((a * c1 - b * c2) / (b * c1 - a * c2))
0 < x ∧ ∃ t : ℝ,
Real.tan (2 * t) = 2 * Real.sqrt ((a * c1 - b * c2) *
(b * c1 - a * c2)) / (a ^ 2 - b ^ 2) * (if 0 < b * c1 - a * c2 then 1 else -1) ∧
IsDiagonal (congruence (rotateBoth t * xSqueeze x) (standardCM a b c1 c2)) ∧
∃ (xp y : ℝ) (g : Two → ℝ), 0 < xp ∧ 0 < y ∧ (∀ j, 1 / 2 ≤ g j) ∧
congruence (ySqueeze y * xSqueeze xp * rotateBoth t * xSqueeze x)
(standardCM a b c1 c2) = normalDiagonal g) ∧
(a ≠ b → a / b + b / a = c1 / c2 + c2 / c1 →
(a / b = c1 / c2 ∨ a / b = c2 / c1) ∧
∃ (Sq : Matrix Two Two ℝ) (g : Two → ℝ),
IsSymplecticMatrix (symplecticLift Sq) ∧ (∀ j, 1 / 2 ≤ g j) ∧
standardCM a b c1 c2 = symplecticLift Sq * normalDiagonal g * (symplecticLift Sq).transpose) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P46
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all real numbers , put
Assume that , that the complex matrix is positive semidefinite, and that and . Define
for a real matrix and a function on the two mode labels . The theorem asserts all of the following conjunction: the natural number obtained by choosing when , otherwise when , otherwise when the reverse strict inequality holds, and otherwise , belongs to ; if , then, with
one has ; if and , then
and there exists such that
the matrix has every off-diagonal entry zero, and there exist real and a function , with for each , such that
if and , then
and there exists such that
the matrix has every off-diagonal entry zero, and there exist real and , with every , such that
and if and , then or , and there exist a real matrix and such that is invertible, , every , and . These are implications under their respective conditions; scalar division and matrix inversion are total, with scalar division by zero equal to zero and singular matrix inverse equal to zero, and the displayed fourth powers use the total real power function.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.