{"slug":"archived-q1053-d62a2a92c96c","identifier":"archived-q1053-d62a2a92c96c","title":"MCB Decidability","author":"Maclain Hunter","sourceSha256":"d62a2a92c96cc26d04abb582b6443e4c54ad6e39c15684689418646741813d8d","sourceKind":"archived-authored-source","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:08.032Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.integer_parity_range"],"units":[{"id":"integer_parity_range","sourceStatement":"{\n  \"name\": \"MCB Decidability\",\n  \"formal\": \"∀n ∈ ℤ: (-1)^n ∈ {+1, -1}\",\n  \"proof\": \"By case analysis on parity of n\",\n  \"implementation\": \"paritySign(n: number): MCBState\"\n}","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":"1c1c37238c59213e7c31731e6f41c19e8795a21095684c2b7fa55a60e35f9dab","bytes":730},"Proof.lean":{"sha256":"413e09a0bb3b73382bc892e945e97015c416c7b57940aa1dc71b160e68f0df99","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":"d62a2a92c96cc26d04abb582b6443e4c54ad6e39c15684689418646741813d8d","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/archived-q1053-d62a2a92c96c","jsonUrl":"/proof-verification/archived-q1053-d62a2a92c96c.json","leanUrl":"/proof-verification/archived-q1053-d62a2a92c96c.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/archived-q1053-d62a2a92c96c#lean","name":"Lean 4 witness: MCB Decidability","url":"https://mcbcore.net/proof-verification/archived-q1053-d62a2a92c96c","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:40:08.032Z","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://mcbcore.net/proof-knowledge/archived-q1053-d62a2a92c96c","identifier":"archived-q1053-d62a2a92c96c"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/archived-q1053-d62a2a92c96c.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://mcbcore.net/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":"d62a2a92c96cc26d04abb582b6443e4c54ad6e39c15684689418646741813d8d"},{"@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"}]}}