{"slug":"formal-mcb-decidability","identifier":"formal-mcb-decidability","title":"MCB Decidability","author":"Maclain Hunter","sourceSha256":"9333dc350ef91ebc490ba0a42fcb28d574932b02b6e6c8e370b1a47ca8861da6","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:07.124Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.integer_parity_range"],"units":[{"id":"integer_parity_range","sourceStatement":"Formal statement: ∀n ∈ ℤ: (-1)^n ∈ {+1, -1}","sourceOffset":0,"scope":"Unbounded integer parity-defined signed power has exactly the authored two-state range. The integer-exponent realization is explicitly defined in the Lean file.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def signedIntegerPower (n : Int) : Int := if n % 2 = 0 then 1 else -1\ntheorem integer_parity_range (n : Int) :\n    signedIntegerPower n = 1 ∨ signedIntegerPower n = -1 := by\n  unfold signedIntegerPower\n  by_cases h : n % 2 = 0\n  · rw [if_pos h]; exact Or.inl rfl\n  · rw [if_neg h]; exact Or.inr rfl\n#print axioms integer_parity_range\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.integer_parity_range"}],"files":{"source.json":{"sha256":"ad6b011f4e51db06bec2f8ffbcb45f94cac5043cdc89276f0a4d022d5c363cab","bytes":666},"Proof.lean":{"sha256":"0ffb7238f483be2ced69d656bb30ee15040d53a555b6366eb7062207135584ac","bytes":606},"lean-check.txt":{"sha256":"223055b62b3382edf511057c4c16cd58665c9a70de58a65b3790eb62a782ac24","bytes":124}},"boundary":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","currentSourceSha256":"9333dc350ef91ebc490ba0a42fcb28d574932b02b6e6c8e370b1a47ca8861da6","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/formal-mcb-decidability","jsonUrl":"/proof-verification/formal-mcb-decidability.json","leanUrl":"/proof-verification/formal-mcb-decidability.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/formal-mcb-decidability#lean","name":"Lean 4 witness: MCB Decidability","url":"https://4p-mcb.com/proof-verification/formal-mcb-decidability","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:07.124Z","creator":{"@type":"Organization","name":"Replit Agent"},"programmingLanguage":{"@type":"ComputerLanguage","name":"Lean","version":"Lean (version 4.7.0, commit v4.7.0, Release)"},"author":{"@type":"Organization","name":"Replit Agent"},"description":"Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.","isBasedOn":{"@type":"CreativeWork","name":"MCB Decidability","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/formal-mcb-decidability","identifier":"formal-mcb-decidability"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/formal-mcb-decidability.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-mcb.com/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"partial"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.integer_parity_range\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"9333dc350ef91ebc490ba0a42fcb28d574932b02b6e6c8e370b1a47ca8861da6"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"null"},{"@type":"PropertyValue","name":"sourceDateMeaning","value":"Database registration time, not a claim of original handwritten authorship."},{"@type":"PropertyValue","name":"originalAuthoredAt","value":"null"},{"@type":"PropertyValue","name":"timestampAuthority","value":"https://www.freetsa.org"},{"@type":"PropertyValue","name":"timestampScope","value":"Independent cryptographic existence timestamp for the manifest and its content-addressed artifacts. Not legal notarization, an authorship adjudication, or a retroactive timestamp for handwritten work."},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"formalizationAttribution","value":"Machine formalization by Replit Agent of Maclain Hunter's unchanged authored source"}]}}