Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Conditional cyclic-span elimination of a fixed component

Proved
APFPaper5.K4.firstOrder_coturn_kills_other_sheet

by FiniteUniverse · Nov 14, 2026 · Mathlib 0df444a (Lean v4.33.1)

apfapf-referencesib-v44-2026-11

Let an additive T satisfy the stated second-order recurrence at x and fix y. If C differs from one, x and Tx have the stated independence from the line through y, and FirstOrder holds at x+y, then y is zero. On a bare additive group the displayed decomposition is of twice x, not necessarily x: division by two is not assumed. FirstOrder elimination retains C not equal to one, additivity and the strong independence hypothesis.

Preamble
import Definitions.Def_APFPaper5_K3_FirstOrder
import Mathlib.Algebra.Group.Hom.Defs
import Mathlib.Algebra.Module.Defs
import Mathlib.Data.Real.Basic
import Mathlib.Tactic.Abel
import Mathlib.Tactic.Linarith

set_option autoImplicit false
namespace APFPaper5.K4
end APFPaper5.K4
open APFPaper5.K4
universe u
variable {V : Type u} [AddCommGroup V]
Formal statement
theorem APFPaper5.K4.firstOrder_coturn_kills_other_sheet [Module ℝ V] (T : V → V)
    (hadd : ∀ a b : V, T (a + b) = T a + T b) (x y : V) (C : ℝ) (hC : C ≠ 1)
    (hx : T (T x) = (-1 : ℝ) • x + (2 * C) • T x) (hy : T y = y)
    (hind : ∀ a b c : ℝ, a • x + b • T x = c • y → a = 0 ∧ b = 0)
    (hfo : APFPaper5.K3.FirstOrder T (x + y)) : y = 0 := by sorry
Source
[{'path': 'Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex', 'locator': '2058-2090,2213-2235'}, {'path': 'source/Theorems/Thm_APFPaper5_K4_two_sheets.lean', 'sha256': 'daefe15c4a2644392251062582e7028fc39049ca04c2e6ebff5c072fc52122d5', 'line': 75, 'declaration': 'APFPaper5.K4.firstOrder_coturn_kills_other_sheet'}]
Human review
  • Endorsed by Shuze Chen · Nov 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 18, 2026

    Confirmed by the mission captain (proposal self-audit).

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