Newton identity for three unit phases
ProvedCouret.STROBO2TORS.recoh_triple_newton_identitycouret-programmecouret-unification-20261108
Let have modulus one, put , , and . Then
Preamble
import Definitions.Def_Couret_RecohTripleNewton_821bcf694d07 import Mathlib.Analysis.Complex.Basic import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring import Mathlib.Analysis.Complex.Basic import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Ring set_option autoImplicit false /-! Quantitative Newton identity for three unit complex numbers, and the two-choice rational protocol used to replace a character by itself or its cube before any support reading is measured. The cube reading is the sum of the cubes of the three values. It is not the cube of their sum. No distinctness of the values is assumed. The rational comparison below is executable. Its correctness theorem takes an explicit approximation certificate; this module does not construct that certificate or establish extensionality for arbitrary approximation routines. -/ namespace Couret.STROBO2TORS
Formal statement
theorem recoh_triple_newton_identity (z₁ z₂ z₃ : ℂ)
(h₁ : ‖z₁‖ = 1) (h₂ : ‖z₂‖ = 1) (h₃ : ‖z₃‖ = 1) :
z₁ ^ 3 + z₂ ^ 3 + z₃ ^ 3 =
(z₁ + z₂ + z₃) ^ 3 +
3 * (z₁ * z₂ * z₃) * ((1 - ‖z₁ + z₂ + z₃‖ ^ 2 : ℝ) : ℂ) := by sorry
end Couret.STROBO2TORS
Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/eb7323762a9fa64f54f95ea7aa2981dee0ba54af/research/strobo-2tors-2026-10-12/lean/RecohTripleNewton.lean#L30-L54, lines 30–54; source file SHA-256 c0dfe04ad32a6cb240d859da6d7a72431007a71855a11b54c052d91aa4f8724e; theorem Couret.STROBO2TORS.recoh_triple_newton_identity