structure
definition
MoralLedger
show as:
view math explainer →
open explainer
Read the cached plain-language explainer.
open lean source
IndisputableMonolith.Algebra.LedgerAlgebra on GitHub at line 241.
browse module
All declarations in this module, on Recognition.
explainer page
depends on
formal source
238
239 The DREAM theorem proves that 14 virtues generate all
240 σ-preserving transformations on this structure. -/
241structure MoralLedger extends DoubleEntryAlgebra where
242 /-- Each vertex represents an agent's moral state -/
243 agentSkew : Fin ledger.n → ℤ
244 /-- Skew is derived from edge balance -/
245 skew_from_edges : ∀ v : Fin ledger.n,
246 agentSkew v = ledger.netFlux v
247
248/-! ## §9. Summary Certificate -/
249
250/-- **LEDGER ALGEBRA CERTIFICATE**
251
252 1. Events form an abelian group (ℤ, +, 0) ✓
253 2. Conjugation e ↦ −e is involution ✓
254 3. Paired events sum to zero (double-entry) ✓
255 4. 8-window neutrality from 4 paired events ✓
256 5. Graded ledger has conservation at every vertex ✓
257 6. Net flux = 0 at all vertices ✓
258 7. Antisymmetric edges ⟹ global balance ✓
259 8. Connection to ethics (σ = 0 from ledger structure) ✓ -/
260theorem ledger_algebra_certificate :
261 -- Paired events cancel
262 (∀ e : LedgerEvent, e + e.conj = 0) ∧
263 -- Conjugation is involution
264 (∀ e : LedgerEvent, e.conj.conj = e) ∧
265 -- Neutral windows exist
266 (∀ e₁ e₂ e₃ e₄ : LedgerEvent,
267 (neutralWindow e₁ e₂ e₃ e₄).isNeutral) ∧
268 -- Conservation at every vertex
269 (∀ L : GradedLedger, ∀ v : Fin L.n, L.netFlux v = 0) :=
270 ⟨paired_event_sum_zero, conj_involution, neutralWindow_isNeutral,
271 GradedLedger.netFlux_zero⟩