Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

LeanProofs.Rosetta.AutonomousFullStateRecurrence

Definition
Grade4_LeanProofs_Rosetta_AutonomousFullStateRecurrence

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

clifford-algebraleanproofs-grade4rosetta

Foundational definitions and structural lemmas from LeanProofs.Rosetta.AutonomousFullStateRecurrence, required by the selected LeanProofs theorem graph.

Definition code
import Definitions.Def_Grade4_LeanProofs_Rosetta_GeometricMemoryCertificate
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.NormNum

namespace LeanProofsGrade4P2M


/-!
# Autonomous full-state recurrence and observational readouts

The first section is a Level-A typed certificate for an arbitrary autonomous
recurrence `X_(k+1) = Phi(X_k)` and readout family `O_g`.  Iteration is on the
full state.  Readout replacement leaves the state trajectory definitionally
unchanged, so a projection is observational data rather than a state-transport
map.

The final section is a finite real-algebra counterexample built from the
existing signed Cartan cubic witness.  It supplies an explicitly declared toy
`Phi` only to show that equal quadratic readouts need not determine a signed
downstream update or interaction.  No physical evolution, cross-scale map,
vortex sector, instability law, or registered geometric-resonance bridge is
constructed here.
-/

noncomputable section

namespace Rosetta.AutonomousFullState

open Rosetta.CartanCubic
open Rosetta.GeometricMemory

/-! ## Generic autonomous recurrence -/

/-- An autonomous full-state map with a grade-indexed observational readout. -/
structure System (State Grade Observation : Type*) where
  Phi : State → State
  readout : Grade → State → Observation

















/-! ## Exact signed-cubic non-factorization counterexample -/

/-- Typed full invariant state plus a downstream scalar register. -/
structure FullInvariantState where
  quadratic : RawI2
  cubic : RawI3
  downstream : ℝ

/-- Readout labels for the explicitly registered invariant state. -/
inductive InvariantReadoutGrade where
  | quadratic
  | cubic
  | downstream

def invariantReadout : InvariantReadoutGrade → FullInvariantState → ℝ
  | .quadratic, state => state.quadratic.value
  | .cubic, state => state.cubic.value
  | .downstream, state => state.downstream

/--
Declared algebraic update used only as a counterexample: it copies the signed
cubic into the downstream register with coefficient `c`.
-/
def declaredSignedCubicPhi (coefficient : ℝ)
    (state : FullInvariantState) : FullInvariantState :=
  { state with downstream := coefficient * state.cubic.value }

def declaredSignedCubicSystem (coefficient : ℝ) :
    System FullInvariantState InvariantReadoutGrade ℝ where
  Phi := declaredSignedCubicPhi coefficient
  readout := invariantReadout

/-- Full invariant state for the registered `(1,1,-2)` Cartan witness. -/
def t8FullState : FullInvariantState where
  quadratic := ⟨I2 1 1 (-2)⟩
  cubic := ⟨I3 1 1 (-2)⟩
  downstream := 0

/-- Full invariant state for the simultaneous sign reversal. -/
def reversedT8FullState : FullInvariantState where
  quadratic := ⟨I2 (-1) (-1) 2⟩
  cubic := ⟨I3 (-1) (-1) 2⟩
  downstream := 0









end Rosetta.AutonomousFullState

end


end LeanProofsGrade4P2M
Source
https://github.com/MonumentalSystems/LeanProofs/blob/b656238b73d5f0f74515f6574a1dcb4e0216129f/LeanProofs/Rosetta/AutonomousFullStateRecurrence.lean

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