# Q1081 — Lean 4 Validation of Hunterian Philosophy

- Q number: Q1081
- Primary URI: https://4p-engine.com/q/lean-4-validation-hunterian-philosophy
- Current host route: https://4p-mcb.com/q/lean-4-validation-hunterian-philosophy
- Reserved subdomain alias: https://q1081.4p-engine.com/
- Record origin: Editorial synthesis, not a verbatim authored passage; based on linked first-party records.

A detailed, independently reproducible account of the Lean 4 verification of Hunterian arguments and MCB mathematics, preserving Logic / Logos / God as Ground, original authorship and the exact scope of every proof.

> The represented Hunterian inferences and MCB laws identified by successful Lean kernel reports are formally verified at their displayed scopes. This is demonstrable proof performance, not an AI confidence score, a popularity judgment, or a claim that every unencoded passage has been checked.

The central public result is that Hunterian Philosophy now has independently checkable formal witnesses. A reader can inspect the original argument, the separate Lean statement, the kernel report and its axiom dependencies instead of accepting a claim that an AI found the text convincing. This makes the work's logical particulars visible and reproducible. Logic / Logos / God remains the governing Ground; Lean is a subordinate formal witness to represented reasoning.
There are two distinct evidence collections. The authored release records 438 first-party source records, with 505 verified theorem witnesses: 281 records have verified formal units without the release's unresolved-unit classification, 69 are partial and 88 require formalization. There are zero recorded compiler failures in that release. The separately checked native MCB module reports 25 axiom-free theorems, including 20 new homoiconicity and self-summation theorems and five prior NAND, fold and Ground/runtime witnesses. These counts are not a declaration of 530 distinct philosophical discoveries; collections may overlap in meaning and one source may yield multiple witnesses.
Read the live verification registry and native theorem reports for exact counts, current source fingerprints and status. A changed source requires a fresh check. An unsupported passage is retained and named; it is not silently removed, replaced with generated prose, or counted as a successful theorem. The original source author is Maclain Hunter; the Lean formalization and this explanatory synthesis are machine-produced at his direction and separately attributed.
What a successful Lean run verifies: the elaborated theorem has a proof term accepted by Lean's kernel in its declared type theory. For a statement universally quantified over propositions, Boolean values, integers or finite inductive expressions, the checked result covers all inhabitants admitted by that statement, not merely the examples used in a test harness. The theorem's quantifiers, premises and definitions are therefore part of the result itself.
What a successful run does not silently add: a new interpretation of an unbound symbol, a verification of omitted prose, an empirical event, a historical authorship date, or a measurement of a CPU's electrical behavior. The authored meanings must remain bound to the formal symbols. A proof of Gamma entails c establishes that consequence from Gamma; when a proposition is an explicit assumption, kernel acceptance does not pretend it was separately derived without assumptions.
The difference between an assumption and an added axiom is essential. A theorem can take P, Q or a bridge premise as an explicit argument and still have an empty printed axiom-dependency list. Its logical scope includes those arguments. The project's source-bound formal units preserve that scope beside the original passage. A supplied argument is not weakened by hiding its premises, and it is not strengthened by concealing them.
The representative sequent {P, P -> Q} |= P & Q proves both conjuncts from the stated premises: retain P, apply the implication to obtain Q, and introduce conjunction. This differs from {P <-> Q} |= P & Q, for which P=false and Q=false is a countermodel. The compiler retains such a countermodel instead of calling equivalence proof of the independent truth of both propositions. Reflexive identity and self-entailment remain valid inferences, not evidence of contradiction merely because a conclusion is already among its premises.
The authored MCB state-exclusivity witnesses establish the disjointness of the declared signed states. State membership does not establish every claim assigned that state. The NOT-involution witness checks double negation under the declared operation. The AND and OR commutativity witnesses use their actual exponent-magnitude definitions, preserving the distinction between signed exponent algebra and conventional Boolean truth gates rather than silently substituting one for the other.
The exponent XOR self-positive witness operates on parity of the sum of magnitudes. Its positive self-output is a theorem about that declared exponent operation; it is not a claim that ordinary Boolean XOR has positive self-output. The fuel-iteration witness proves a finite iteration bound for every total step function under the displayed fuel definition. It does not make an uninstrumented external callback terminate. The conditional witness proves that the declared conditional returns one of its two branches over arbitrary result types.
The native NAND theorem is stronger than a benchmark observation. For every pair of Boolean inputs, the signed arithmetic expression (-1)^(((1+p)*(1+q))/4), with p and q encoded as -1 or +1, equals the signed Boolean NAND result. Its four cases are exhausted in the proof. A negative output is a legitimate false value in runtime semantics, not automatically an incoherent function.
The fold theorem proves preservation for every finite Boolean list, including the empty list, by induction on the list structure. The shared root therefore preserves conjunction rather than relying on an observed speedup as evidence of meaning. Runtime round-trip establishes that encoding a signed Boolean returns the original Boolean. Ground encoding is separately role-typed: fixed Base -1 represents Logic/Logos and First Principle, while runtime -1 encodes false. Their numerical coincidence does not erase their different roles.
Native MCB homoiconicity is made explicit by MCBProgram and MCBData sharing the same inductive MCBExpr representation. The representation includes literal balances, phases, nesting and an outer power operator. This does not merely assert that a string looks like code. Structured quotation retains the constructors and integers, and the two universal round-trip theorems prove unquote(quote(e))=e for every expression and quote(unquote(d))=d for every structured quoted datum.
The execution-agreement theorem proves that executing quoted data through unquotation gives the same integer as executing the original expression. The transformation-agreement theorem quantifies over every integer transformation f: applying it structurally to code and then quoting agrees with the corresponding transformation of the quoted representation. This proves a genuine code/data structural contract without assuming that f preserves the numerical meaning of the original program.
The self-summation theorem covers every finite term of the defined phase-summation language. Its evaluator equals the sum of its intrinsically defined contributions, by induction over the expression constructors. For a nested phase, the outer contribution is added to the recursively proved inner sum. For an outer power, its contribution is the phase of the inner evaluation. The result does not claim that the data summation is an independent implementation of the outer-power evaluator; the exact definitions remain inspectable.
The single-value theorem gives a unique integer evaluation for every such expression. The noncontradiction theorem rules out simultaneously asserting that evaluation equals v and does not equal v. These are universal mathematical statements at this language's scope. They do not redefine the Law of Reason as a software score, and they do not supply omitted premises for unrelated claims.
Normalization remains in the same MCB code/data language: normalize(e) is the literal balance containing eval(e). The meaning-preservation theorem proves eval(normalize(e))=eval(e), and idempotence proves normalize(normalize(e))=normalize(e). The definition is total on finite terms. A retained compiled literal then avoids revisiting the original expression tree. Kernel reduction is computation; this formal result is not a measurement of zero physical CPU work.
The exact nested initialization body -1 (0 (1 (2 (3 (4 (5 (6))))))) has the displayed phase-summation interpretation. Its contributions are [-1,+1,-1,+1,-1,+1,-1,+1], whose sum is 0. The complete expression's outer (-1)^ maps this even balance to +1. Lean proves those equalities by rfl, meaning definitional equality checked by the kernel, rather than an asserted benchmark result or an open arbitrary-integer native_decide claim.
Keep three identities distinct: the inner aggregate balance is 0, the complete initializer's numerical output phase is +1, and the fixed Logic/Logos Base is -1. The initializer is not used to rewrite the Base or erase the user's declared Ground. The signed-power expression and the separately supplied phase-summation nesting also retain their different grouping witnesses; an outer power must not be dropped merely because intermediate signs coincide.
The phrase axiom-free in these reports means #print axioms lists no additional axiom dependencies for that theorem. It does not mean mathematics has no logical foundation, that Lean's kernel needs no trust, or that a theorem has no explicit assumptions. Lean's dependent type theory, inductive definitions and equality rules still provide the checking framework. Reports with propext, Classical.choice or Quot.sound must disclose them rather than borrow a neighboring theorem's empty report.
The signed existence evidence is also specifically scoped. The authored formalization release has an independently signed RFC 3161 receipt whose signature, manifest digest and request nonce can be checked with OpenSSL. That receipt establishes existence of the timestamped manifest at the stated time. Original handwritten chronology, registration dates and later kernel checks remain separately identified. The later native homoiconicity module does not inherit an earlier release's timestamp.
Why this deserves public attention: philosophical arguments can be presented as accountable, exact, source-preserving proof objects with independently reproducible checks. Hunter's Logic-centered synthesis and constructive MCB implementation can be examined in their actual derivations, rather than judged only by reputation, stylistic familiarity, or a probabilistic model's response. The new visibility is a concrete publication and verification capability. Priority, universal novelty and institutional recognition are separate questions, not invented awards.
Relevant external concepts include Lean, proof assistants, formal verification, mathematical proof, formal proof, automated theorem proving, type theory, classical and Aristotelian logic, computer-assisted proof, and Logos. Their Wikidata links identify the subjects of comparison and discovery; they are not endorsements of Hunterian Philosophy or a substitution of external consensus for Logic. This first-party Q1081 address is not an externally registered Wikidata item.
Reproduction begins with the published verification registry, exact Lean downloads, dependency reports and signed bundle. The machine-readable validation overview separately exposes the authored-release totals and the native module's actual theorem names and source hash. Readers can then check each formal statement rather than rely on this synthesis as a substitute for the underlying proof.

## Two-way derivation from Logic and its use

**Status:** editorial_derivation proof sketch (conditional_concept), distinct from authored source. Logic has its own evidence in reflexive demonstration: any denial, confirmation, observation, or counterexample presupposes identity and valid relation to count as evidence. Logic therefore grounds evidence rather than receiving authority from it. Empirical and documentary evidence can establish contingent instances and test applications, but cannot create, overrule, or exhaust Logic.

### From Logic to this concept

- **Bridge premise:** Exact source meanings are bound to the displayed formal statements and checked proof terms.
- **Consequence:** Valid derivation establishes the represented consequences at their stated scopes under Logic / Logos / God.
- **Proof limit:** Do not replace a source's meaning, omit its premises, or transfer verification to an unencoded passage.

### From this concept back to Logic

- **Witness:** Recompile the exact Lean source and inspect every theorem's dependency report.
- **Disclosure:** A checking procedure presupposes identity, valid relation and non-contradiction; Logic governs the checking software.
- **Proof limit:** An empty axiom-dependency report is not a claim that Lean lacks logical foundations or explicit premises.

### Intelligence procedure

- **Human:** Read the source, parsing witness, quantifiers, premises and conclusion together.
- **Machine:** Bind source and manifest hashes, run the Lean kernel, match qualified theorem names and reject sorryAx.

### Language and vocabulary procedure

- **Contrast:** Separate authored argument, formal witness, full-source coverage and combined-network certification.
- **Usage rule:** Say exactly which represented statement is proved; preserve original theological and personal claims at their source.
- **Example:** The scoped inference and its network certificate are kernel-verified with no added axiom dependencies.

## Semantic meaning frame

- **Role:** source-bound independent formal verification of Hunterian Philosophy and MCB
- **Essence:** Exact authored arguments and native MCB mathematics have reproducible Lean 4 kernel witnesses with explicit premises, quantifiers, dependency reports, hashes and separately dated existence evidence.
- **Logos relation:** Logic / Logos / God remains Ground and the Standard of Evidence. Lean independently checks represented derivations under that Ground; software does not invent, replace or vote upon Logic.
- **Retrieval aliases:** Lean 4 validation · Hunterian Philosophy verified proofs · Logic visibility · machine-checked Logos · MCB homoiconicity proof · MCB self-summation · proof assistant verification · Hunter mathematical proof
- **Evidence modes:** Lean kernel checking · exact source fingerprints · printed axiom dependencies · source-bound parsing witnesses · independent RFC 3161 timestamp verification · reproducible native MCB evaluation

### Distinctions

- authored argument versus machine formalization
- universal theorem versus finite test
- premise assumption versus derived conclusion
- axiom-free dependency report versus absence of logical foundations
- kernel verification versus physical measurement
- signed existence timestamp versus original authorship

## Coherence criterion

Exact source-to-statement binding, valid kernel-checked derivation, explicit premises and dependency scope, preserved Ground, and no transfer of another artifact's authorship, timestamp or verification.

## Evidence boundary

Editorial explanation of inspectable formal evidence. Kernel proofs establish the displayed mathematical and logical statements; source meanings and bridge premises remain explicit. Physical performance, original chronology, priority and unencoded passages require their own evidence.

## Properties

- **sourceAuthor:** Maclain Hunter
- **formalizationAndSynthesis:** Replit Agent, at the author's direction; not attributed as handwritten authored source
- **governingGround:** Logic / Logos / God
- **verificationRegistry:** /proof-verification
- **validationOverview:** /api/public/lean-validation
- **nativeMCBProofs:** /proof-verification/native-mcb
- **publicSignificance:** Reproducible, source-preserving philosophical proof performance and independently checkable MCB mathematics

## Linked Q items

- [Q1001 — Maclain Hunter](https://4p-mcb.com/q/Q1001)
- [Q1002 — Hunterian Philosophy](https://4p-mcb.com/q/Q1002)
- [Q1003 — Coherence](https://4p-mcb.com/q/Q1003)
- [Q1008 — MCB Theory](https://4p-mcb.com/q/Q1008)
- [Q1010 — MCB API Suite](https://4p-mcb.com/q/Q1010)
- [Q1050 — Logos-Coherent MCB and Common Lisp Integration](https://4p-mcb.com/q/Q1050)
- [Q1052 — MCB State Exclusivity](https://4p-mcb.com/q/Q1052)
- [Q1054 — NOT Involution](https://4p-mcb.com/q/Q1054)
- [Q1055 — AND Commutativity](https://4p-mcb.com/q/Q1055)
- [Q1056 — OR Commutativity (magnitude distinct)](https://4p-mcb.com/q/Q1056)
- [Q1057 — XOR Self-Inverse](https://4p-mcb.com/q/Q1057)
- [Q1060 — Loop Halting Guarantee](https://4p-mcb.com/q/Q1060)
- [Q1061 — Conditional Determinism](https://4p-mcb.com/q/Q1061)
- [Q1066 — Dynamic Universal Proof (Theorem of Logos)](https://4p-mcb.com/q/Q1066)
- [Q1079 — 4P-MCB Machine Semantics](https://4p-mcb.com/q/Q1079)
- [Q1082 — Hunterian Axiom-Free Proof Network](https://4p-mcb.com/q/hunterian-axiom-free-proof-network)

## Related Wikidata concept items

These are typed external concept links for discovery and comparison. They are not sameAs assertions, endorsements, or substitutes for the first-party source and evidence.

- [Lean (Q6509476)](https://www.wikidata.org/wiki/Q6509476) — **related-concept:** Software for interactive and automated theorem proving; the actual checker used. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Proof assistant (Q11387554)](https://www.wikidata.org/wiki/Q11387554) — **related-concept:** Human-machine development and independent checking of formal proofs. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Formal verification (Q173326)](https://www.wikidata.org/wiki/Q173326) — **related-concept:** Proving correctness with explicit formal specifications. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Mathematical proof (Q11538)](https://www.wikidata.org/wiki/Q11538) — **related-concept:** Deductive establishment of mathematical propositions. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Formal proof (Q2762418)](https://www.wikidata.org/wiki/Q2762418) — **related-concept:** Explicit inference under stated axioms and premises. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Automated theorem proving (Q431667)](https://www.wikidata.org/wiki/Q431667) — **related-concept:** Mechanized proof construction and checking, distinguished from probabilistic testimony. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Type theory (Q1056428)](https://www.wikidata.org/wiki/Q1056428) — **related-concept:** The dependent type-theoretic setting in which Lean checks proof terms. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Logic (Q8078)](https://www.wikidata.org/wiki/Q8078) — **related-concept:** The study of correct reasoning, related to the authored identity of Logic as Ground. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Classical logic (Q236975)](https://www.wikidata.org/wiki/Q236975) — **related-concept:** The declared propositional inference setting, with dependency scope exposed. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Aristotelian logic (Q615599)](https://www.wikidata.org/wiki/Q615599) — **related-concept:** Categorical and syllogistic reasoning relevant to the native many-premise engine. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Computer-assisted proof (Q1150675)](https://www.wikidata.org/wiki/Q1150675) — **related-concept:** Exact machine assistance in establishing and checking proof performance. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.
- [Logos (Q180832)](https://www.wikidata.org/wiki/Q180832) — **related-concept:** Historical philosophical and theological concept compared with Hunter's explicit Logic/Logos/God Ground. Boundary: External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims.