Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact sum of odd-power triple energies

Proved
Couret.STROBO2TORS.recoh_odd_power_energy_sum

by alexcour · Nov 8, 2026 · Mathlib c5ea003 (Lean v4.30.0)

couret-programmecouret-unification-20261108

For a,b,c∈Ca,b,c\in\mathbb Ca,b,c∈C put Ej=∣a2j+1+b2j+1+c2j+1∣2E_j=|a^{2j+1}+b^{2j+1}+c^{2j+1}|^2Ej​=∣a2j+1+b2j+1+c2j+1∣2. Let m∈Nm\in\mathbb Nm∈N be positive and suppose a2m=b2m=c2m=1a^{2m}=b^{2m}=c^{2m}=1a2m=b2m=c2m=1. Write C(a,b)=[a=b]−[a=−b]C(a,b)=[a=b]-[a=-b]C(a,b)=[a=b]−[a=−b], with real indicator values, and let N=N_{=}N=​ and N−N_{-}N−​ count equal and opposite pairs among the three indexed pairs (a,b),(a,c),(b,c)(a,b),(a,c),(b,c)(a,b),(a,c),(b,c). Then

∑j=0m−1Ej=m(3+2(C(a,b)+C(a,c)+C(b,c))).\sum_{j=0}^{m-1}E_j=m\bigl(3+2(C(a,b)+C(a,c)+C(b,c))\bigr).j=0∑m−1​Ej​=m(3+2(C(a,b)+C(a,c)+C(b,c))).
Preamble
import Definitions.Def_Couret_RecohOddPowerAverage_39ee40b78d83
import Mathlib.Analysis.Complex.Basic
import Mathlib.Data.Complex.BigOperators
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Theorems.Thm_Couret_STROBO2TORS_recoh_odd_pair_sum
import Theorems.Thm_Couret_STROBO2TORS_recoh_unit_three_energy
import Mathlib.Analysis.Complex.Basic
import Mathlib.Data.Complex.BigOperators
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.Ring

set_option autoImplicit false

/-!
# Averaging odd powers of three roots of even order

The order is written `2 * m`, with `0 < m`.  This includes the entire
2-primary case and keeps the geometric-sum argument independent of a
particular presentation of the order.  Repeated complex phases are allowed.

The energy at index `j` is the squared norm of the reading at exponent
`2 * j + 1`.  An opposite pair makes every such energy equal to one.
Otherwise their sum is at least `3 * m`, and some energy is at least three.
-/

namespace Couret.STROBO2TORS

open scoped BigOperators

























Formal statement

theorem recoh_odd_power_energy_sum (m : ℕ) (hm : 0 < m) (a b c : ℂ)
    (ha : a ^ (2 * m) = 1) (hb : b ^ (2 * m) = 1)
    (hc : c ^ (2 * m) = 1) :
    (∑ j ∈ Finset.range m, recohOddPowerEnergy a b c j) =
      (m : ℝ) * (3 + 2 * (recohOddPairCorrelation a b +
        recohOddPairCorrelation a c + recohOddPairCorrelation b c)) := by sorry


















end Couret.STROBO2TORS

Source
Alexandre Couret, https://github.com/alexcour/couret-finite-verifications/blob/eb7323762a9fa64f54f95ea7aa2981dee0ba54af/research/strobo-2tors-2026-10-12/lean/RecohOddPowerAverage.lean#L166-L191, lines 166–191; source file SHA-256 82ee1df9b270ad5f4eb67127defb17a17528059f12fe33954ce8f77aa29140c7; theorem Couret.STROBO2TORS.recoh_odd_power_energy_sum

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me