Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Surjective score preservation implies additivity under left nondegeneracy

Proved
APFPaper5.K1.turn_additive_of_score_preserving

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

apfapf-referencesib-v15-2026-11

Let B be a real-bilinear pairing on a supplied real vector space. Assume hnd: a vector scoring zero against every second-slot vector is zero; hiso: B(Ta,Tb)=B(a,b) for all a,b; and hsurj: T is onto the entire vector space. Then T(a+b)=Ta+Tb for all a,b. The theorem concludes additivity only. The pairing, its nondegeneracy, all-pair score preservation and full-space surjectivity are supplied; no physical turn model or admissible inverse is constructed.

Preamble
import Definitions.Def_APFPaper5_K1_OrderedScore
import Mathlib.Tactic.Ring

set_option autoImplicit false
namespace APFPaper5.K1
end APFPaper5.K1
open APFPaper5.K1
variable {V : Type*} [AddCommGroup V] [Module ℝ V]
Formal statement
theorem APFPaper5.K1.turn_additive_of_score_preserving (B : V → V → ℝ) (hB : IsBilinear B)
    (hnd : ∀ v : V, (∀ c : V, B v c = 0) → v = 0) (T : V → V)
    (hiso : ∀ a b : V, B (T a) (T b) = B a b) (hsurj : ∀ c : V, ∃ c' : V, T c' = c) :
    ∀ a b : V, T (a + b) = T a + T b := by sorry
Source
Sib v15 frozen source: Theorems/Thm_APFPaper5_K1_turn_structure.lean:29; Papers/Paper 05 - Quantum Structure - Hilbert Space and Born Rule/Paper_5_Quantum_Structure_Hilbert_Born_Supplement_v7.33.tex, 427-470; Artifacts_2026-11-12_session/claude/EthanBrooke-01WrrBvu/RULING_cross_term_and_preservation_2026-11-12.md, standing
Human review
  • Endorsed by Shuze Chen · Nov 16, 2026

    Confirmed by the moderator at approval.

  • Endorsed by FiniteUniverse · Nov 16, 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