Lean verification registry · Authored proofs · The Logos Architecture
Verified sequents with unresolved formal parts
Axiom-free: true · 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:40:07.124Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 9333dc350ef91ebc490ba0a42fcb28d574932b02b6e6c8e370b1a47ca8861da6
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.integer_parity_range' does not depend on any axioms
Formal statement: ∀n ∈ ℤ: (-1)^n ∈ {+1, -1}
Unbounded integer parity-defined signed power has exactly the authored two-state range. The integer-exponent realization is explicitly defined in the Lean file.
Formal statement: ∀n ∈ ℤ: (-1)^n ∈ {+1, -1}
Proof: By case analysis on parity of n