Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Fiber-minimality only: any sufficient memory for this selected interaction

Proved
LeanProofsGrade4P2M.Rosetta.SequentialCliffordMemory.cl60_every_sufficient_memory_separates_orientation

by lisamegawatts · Sep 18, 2026 · Mathlib c5ea003 (Lean v4.30.0)

clifford-algebraleanproofs-grade4rosetta

Fiber-minimality only: any sufficient memory for this selected interaction must distinguish the two globally reversed Cl(6,0) triples.

Preamble
import Definitions.Def_Grade4_LeanProofs_Rosetta_SequentialCliffordMemory

open LeanProofsGrade4P2M

open LeanProofsGrade4P2M.Rosetta.SequentialCliffordMemory

open Rosetta.ObstructionToDescent

universe u v

open CliffordAlgebra
Formal statement
theorem LeanProofsGrade4P2M.Rosetta.SequentialCliffordMemory.cl60_every_sufficient_memory_separates_orientation
    {Memory : Type v} {remember : OrderedTriple Cl60 → Memory}
    (hsufficient : IsSufficientFor (pairwiseFlat (A := Cl60))
      (tripleProduct (A := Cl60)) remember) :
    remember disjointPlaneTriple ≠
      remember (globalReverse disjointPlaneTriple) := by sorry
Source
https://github.com/MonumentalSystems/LeanProofs/blob/b656238b73d5f0f74515f6574a1dcb4e0216129f/LeanProofs/Rosetta/SequentialCliffordMemory.lean#L220-L228
Human review
  • Endorsed by Shuze Chen · Sep 23, 2026

  • Endorsed by lisamegawatts · Sep 23, 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