pith. machine review for the scientific record. sign in
module module moderate

IndisputableMonolith.GameTheory.CooperationFromSigma

show as:
view Lean formalization →

The module defines a game-theoretic model in Recognition Science where binary player choices of cooperate or defect produce joint outcomes labeled by a sigma deviation measure. It establishes that sigma-conservative outcomes produce positive cooperation dividends while defect-defect pairs violate conservation. The structure consists of type definitions for Choice and JointOutcome, direct sigma assignments for each pair, and lemmas verifying signs and conservation properties.

claimLet $C$ denote cooperate and $D$ denote defect. For joint outcomes, define the sigma map such that $sigma(C,C)>0$, $sigma(D,D)<0$, and $sigma(C,D)=sigma(D,C)=0$. A joint outcome is sigma-conservative when total sigma is preserved, which yields a positive cooperation dividend.

background

The module imports the RS time quantum tau_0 = 1 tick from Constants and cost primitives from the Cost module. It introduces Choice as the binary enumeration of cooperate or defect. JointOutcome pairs these choices, and jointSigma assigns a real-valued deviation to each pair. The setting models interactions in which sigma encodes departure from cost conservation or the Recognition Composition Law.

proof idea

This is a definition module, no proofs.

why it matters in Recognition Science

This module supplies the game-theoretic primitives that connect sigma conservation to cooperation within the Recognition Science framework. It aligns with the forcing chain by showing how positive sigma in mutual cooperation respects the phi-ladder structure while defect-defect outcomes break conservation. No downstream theorems are recorded in the current dependency graph.

depends on (2)

Lean names referenced from this declaration's body.

declarations in this module (20)