Make an existing proof easier to inspect by exposing its hierarchy, dependencies, scope, and unresolved obligations.
A 4-skill pipeline for Claude Code: verify mathematical proofs → repair with literature support → sharpen the theory → write corrected proofs. Integrates Codex MCP for adversarial cross-review. Venue-audited reference library across statistics/econometrics/ML theory.
Official project page for From Competition Problems to Mathematical Proof, a free 637-page olympiad mathematics textbook by Parsa Fatehi. Includes the Zenodo DOI, errata, reviews, and reader feedback.
Axiomatic ARE-Logic with Plexity Logical Ecosystem Science Framework
Learn Lean (Math-Proving Based Programming Language) for mathematical proving.
A comprehensive Coq formalization of the Collatz conjecture with a combinatorial analysis framework. Proves linear division advantage.
Primitives Become Lean4 Inductive Types | Lattice Operations Become Machine-Verified Theorems | Structural Claims About Mathematics Become Decidable Propositions
Certified log-concavity of the Riemann-Jacobi kernel with Arb/FLINT ball-arithmetic certificates. Source-critical audit of the Polya-type real-zero criterion. No unconditional RH claim.
AI-generated solutions to two research-level math problems from the First Proof community experiment: a Yang-Mills gauge-fixing heat-flow estimate on the 2-torus, and sharp fatness of geodesic triangles in sparse random graphs. Produced autonomously in Claude Code, offered for human validation.
plain math functions
Bilingual (EN·한국어) interactive study notes for ROB 501 Mathematics for Robotics: proofs, abstract linear algebra, inner product spaces and least squares, QR/SVD/LU/Cholesky, the Kalman filter, real analysis, and optimization — with collapsible proofs and an interactive figure for every key idea
Zero-overhead data marshalling protocol for safety-critical distributed systems with NASA-STD-8739.8 compliance, formal verification, and Zero Trust architecture.
Independent mechanical re-verification of Robertson-Sanders-Seymour-Thomas 1997 Four Color Theorem: 633 configurations reducible + 5 presents verified on Windows/MSYS2, with LLM audit and rules-minimization experiments.
Prime Power Transformer: A Number-Theoretic Architecture for Compute
Machine-verified in Lean 4: the Binary Snap (⊥ → ε₀) is a theorem, not an axiom, and it holds independently across algebra, topology, information theory, functional analysis, set theory, category theory, and computability. A formal ontology of the bottom element ⊥.
machine-verified proofs for euler's theorem and touchard's congruence
ProofCore is a browser-native, 100% offline-first, hybrid mathematical proof verification engine. It combines rigorous symbolic math with semantic understanding to reliably verify mathematical proofs, offering zero external dependencies and production-ready quality
A disorganized collection of mathematical proofs.
Mathematical framework connecting surjective group homomorphisms to quantum error correction via Type II₁ von Neumann algebras. Derives code distance bounds from algebraic structure and validates with computational examples.
Proof 5: Why neural networks prefer low frequencies — a ReLU frequency tradeoff theorem. 3/3 theorems empirically verified.
To associate your repository with the mathematical-proof topic, visit your repo's landing page and select "manage topics."