Lean verification registry · Authored proofs · The Logos Architecture
Verified sequents with unresolved formal parts
Axiom-free: false · 1 checked theorem statements.
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.
Original source author: Maclain Hunter. Machine formalization: Replit Agent. No original wording was rewritten.
Source registered: not established (not original authorship).
Formalized: 2026-10-03T10:37:05.082Z.
Checked: 2026-10-03T10:38:15.068Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 8df06616926623e1384a2280170583ac9a367a0d17ec57cc45e27124a5bed932
Lean source · Verification JSON · Exact archived source JSON · Compiler report · Current authored source page · Signed release and verification instructions
Lean (version 4.7.0, commit v4.7.0, Release) exitCode=0 'HunterAuthored.parity_power_multiplication' depends on axioms: [propext, Classical.choice, Quot.sound]
{
"name": "Exponent Multiplication Parity",
"formal": "(-1)^a * (-1)^b = (-1)^(a+b)",
"proof": "Standard law of exponents",
"significance": "MCB multiplication is O(1) exponent addition"
}
Unbounded integer parity-defined powers multiply by exponent addition. The dependency report explicitly retains the arithmetic tactic's kernel axioms; this theorem is not automatically labeled axiom-free.
{
"name": "Exponent Multiplication Parity",
"formal": "(-1)^a * (-1)^b = (-1)^(a+b)",
"proof": "Standard law of exponents",
"significance": "MCB multiplication is O(1) exponent addition"
}