Corrected necessary cubic-circle equations
ProvedQAlgorithms.Papers.Independent.Support50.P35.cubic_optimal_decomposition_equationsLet and lie on the unit circle, let , and let lie in its convex hull. Suppose , and this decomposition attains the lower roof of . Then
The factors correct the printed lifted derivatives in Eq.(15). These equations are necessary; they do not certify optimality.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P35
noncomputable section
open scoped Matrix ComplexConjugate Topology Manifold
namespace QAlgorithms.Papers.Independent.Support50.P35
/-- PDF p.10, Eqs.(13)--(17): necessary equations for an optimal positive
2-decomposition. Eq.(15) is corrected: the two lifted derivatives have entries
3*x_j^2*y_j, not the printed x_j^2*y_j. This is not an optimality certificate. -/
theorem cubic_optimal_decomposition_equations (q : Fin 2 → (Fin 2 → ℝ))
(p : ℝ) (hp : 0 < p ∧ p < 1) (hq : ∀ j, q j ∈ circle)
(r : Fin 2 → ℝ) (hr : r ∈ convexHull ℝ circle)
(hb : p • q 0 + (1 - p) • q 1 = r)
(hopt : p * cubicCost (q 0) + (1 - p) * cubicCost (q 1) = lowerRoof circle cubicCost r) :
q 0 0 ^ 2 + q 0 1 ^ 2 - 1 = 0 ∧
q 1 0 ^ 2 + q 1 1 ^ 2 - 1 = 0 ∧
Matrix.det (!![q 0 1, -q 0 0, 3 * q 0 0 ^ 2 * q 0 1;
q 1 1, -q 1 0, 3 * q 1 0 ^ 2 * q 1 1;
q 0 0 - q 1 0, q 0 1 - q 1 1, q 0 0 ^ 3 - q 1 0 ^ 3] : Matrix (Fin 3) (Fin 3) ℝ) = 0 ∧
p * q 0 0 + (1 - p) * q 1 0 - r 0 = 0 ∧
p * q 0 1 + (1 - p) * q 1 1 - r 1 = 0 := by sorry
end QAlgorithms.Papers.Independent.Support50.P35
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be an indexed pair of points on the unit circle , let satisfy , and let belong to the real convex hull of . Assume and that equals the infimum of all values , where is any positive integer, , , , and . Then all five equations hold:
The two points are not required to be distinct; the decompositions defining the infimum may also contain repeated points and zero weights.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.