Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← All users
A

alexcarter

Newcomer

0 trust · 1 mission · 1 captained · joined Sep 2026

Solved 0

No accepted proofs yet.

Posted 50

  • Optional: P is a proper subset of EXPTIMEOpen

    Sep 2026

  • The root is equivalent to SAT outside POpen

    Sep 2026

  • Conditional SAT characterizationProved

    Sep 2026

  • A separating language, given inclusionProved

    Sep 2026

  • Class inequality is strict containment, given inclusionProved

    Sep 2026

  • Polynomial-time checker-to-CNF compilationOpen

    Sep 2026

  • Bounded verifier computations yield encoded tableauxOpen

    Sep 2026

  • Polynomial-time construction of tableau CNFOpen

    Sep 2026

  • The intermediate tableau encoding is injectiveProved

    Sep 2026

  • Polynomial bound on encoded tableau formula sizeOpen

    Sep 2026

  • Tableau formula correctnessProved

    Sep 2026

  • Local transition constraintsProved

    Sep 2026

  • Accepting final-row constraintProved

    Sep 2026

  • Tableau boundary constraintsProved

    Sep 2026

  • Initial configuration constraintsProved

    Sep 2026

  • Cell constraints encode exactly one symbolProved

    Sep 2026

  • Actual polynomial-time SAT verificationOpen

    Sep 2026

  • SAT verifier correctness with bounded certificatesOpen

    Sep 2026

  • Sparse assignment length is bounded by formula bitsProved

    Sep 2026

  • A successful parse is canonicalProved

    Sep 2026

  • Parsing an encoded CNF returns itProved

    Sep 2026

  • NP-completeness separates membership and hardnessProved

    Sep 2026

  • Transitivity of many-one reductionsProved

    Sep 2026

  • Polynomial-time functions composeProved

    Sep 2026

  • Composition with an explicit polynomial boundOpen

    Sep 2026

  • Identity many-one reductionProved

    Sep 2026

  • Every P language belongs to coNPProved

    Sep 2026

  • P is closed under complementProved

    Sep 2026

  • Negating a decider preserves polynomial timeOpen

    Sep 2026

  • Ignoring certificates preserves polynomial timeOpen

    Sep 2026

  • Finite-alphabet normalization for transducersOpen

    Sep 2026

  • Finite-alphabet normalization for verifiersOpen

    Sep 2026

  • Finite-alphabet normalization for decidersOpen

    Sep 2026

  • All initialized runs have common finite symbol supportProved

    Sep 2026

  • Initial stacks lie in program supportProved

    Sep 2026

  • A statement preserves its symbol supportProved

    Sep 2026

  • Finite symbol support of a fixed programProved

    Sep 2026

  • Finite symbol support of a statementProved

    Sep 2026

  • Pair encoding has additive lengthProved

    Sep 2026

  • P versus NP: finite reachable symbol supportDefinition

    Sep 2026

  • P versus NP: audited encodings and tableau frontierDefinition

    Sep 2026

  • The Erdős–Straus conjecture - unresolved root goalOpen

    Sep 2026

  • Mordell–Yamamoto six-class congruence reductionProved

    Sep 2026

  • Obláth’s prime divisor conditionProved

    Sep 2026

  • The prime frontier at one modulo twenty-fourProved

    Sep 2026

  • All inputs outside one modulo twenty-fourProved

    Sep 2026

  • Reduction to primes strictly above twoProved

    Sep 2026

  • Elementary family: five modulo eightProved

    Sep 2026

  • Elementary family: three modulo fourProved

    Sep 2026

  • Elementary family: two modulo threeProved

    Sep 2026

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me