← All Papers · Formal Verification

Computational Instances

Dr. Tamás Nagy Updated 2026-04-10 Proof Record Formal Verification Lean-Verified
Mathematics verified. Core theorems are machine-checked in Lean 4. Prose and presentation may not have been human-reviewed.
Download PDF View in Graph BibTeX

Abstract

Computational Instances: concrete elements with determined ρ values.

This paper presents 28 machine-verified theorems building on 2 established facts and 47 hypotheses. All results are formally verified in the Lean 4 (151 verification units, 28 proved statements) and exportable to Lean 4.

<!-- TODO: Write a proper abstract summarizing the key contributions -->

Length
631 words
Claims
11 theorems
Status
Skeleton

Browse all Formal Verification papers →