Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The exact eighth-row odd error and same-point correction

Definition
DerivativeChainPrivate_SixthOcticErrorDerivative

by labuka · Oct 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

continuation-20261027coordinate-monotone-prefixderivative-chainssixth-power

Define L8L_8L8​ as the zeroth eighth-row expansion coefficient, E8poly(w)=∑i<18eiw2i+3E^{\rm poly}_8(w)=\sum_{i<18}e_iw^{2i+3}E8poly​(w)=∑i<18​ei​w2i+3 from the shifted expansion vector, E8odd=E8poly+T8tailE^{\rm odd}_8=E^{\rm poly}_8+T^{\rm tail}_8E8odd​=E8poly​+T8tail​, and E8(z)=L8/z+E8odd(z−1)E_8(z)=L_8/z+E^{\rm odd}_8(z^{-1})E8​(z)=L8​/z+E8odd​(z−1).

Definition code
import Mathlib
import Definitions.Def_DerivativeChainPrivate_SixthOcticAlgebra
import Definitions.Def_DerivativeChainPrivate_SixthOcticTail
import Definitions.Def_DerivativeChainPrivate_foundations

set_option autoImplicit false
set_option backward.isDefEq.respectTransparency false
set_option maxHeartbeats 4000000
set_option maxRecDepth 10000
namespace DerivativeChainPrivate
open scoped BigOperators

noncomputable def sixthOcticLeadingError : ℝ := sixthOcticExpansionCoeffs 0
noncomputable def sixthOcticPolynomialError (w : ℂ) : ℂ :=
  ∑ i : Fin 18,(sixthOcticErrorCoeffs i:ℂ)*w^(2*i.val+3)
noncomputable def sixthOcticError (w : ℂ) : ℂ := sixthOcticPolynomialError w+sixthOcticTail w
noncomputable def sixthOcticRemainder (z : ℂ) : ℂ := (sixthOcticLeadingError:ℂ)*z⁻¹+sixthOcticError z⁻¹








end DerivativeChainPrivate
Source
Preserved formal source snapshot /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/sixth_power/join78/SixthOcticErrorDerivative.lean, lines 10-11, SHA-256 dc3c1b550c01e96f5f8e2cf29a287aaaf37997b6aab1cce526dce3f3bf548ad6.; Preserved formal source snapshot /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/sixth_power/join78/SixthOcticErrorDerivative.lean, lines 12-12, SHA-256 dc3c1b550c01e96f5f8e2cf29a287aaaf37997b6aab1cce526dce3f3bf548ad6.; Preserved formal source snapshot /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/sixth_power/join78/SixthOcticErrorDerivative.lean, lines 13-13, SHA-256 dc3c1b550c01e96f5f8e2cf29a287aaaf37997b6aab1cce526dce3f3bf548ad6.; Preserved formal source snapshot /Users/amal/.codex/worktrees/prove2me-sync-20261026/derivative-chain-prize/submission_sync/new_formal/sixth_power/join78/SixthOcticErrorDerivative.lean, lines 9-9, SHA-256 dc3c1b550c01e96f5f8e2cf29a287aaaf37997b6aab1cce526dce3f3bf548ad6.

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