Lean 4 Proof Engineer

As a Lean 4 Proof Engineer in this role, your primary responsibility will be to translate complex, human-written mathematical arguments into precise, machine-verifiable formalizations. You will be pushing the boundaries of what modern proof assistants can express and automate. This fully remote, flexible contract role is tailored for mathematicians who excel in rigorous proof construction and formal verification. Key Responsibilities: - Translate informal mathematical proofs into Lean 4 (and related systems) with a focus on clarity, structure, and correctness - Analyze domain-specific proofs to identify gaps, hidden assumptions, and formalizable sub-structures - Construct formalizations that challenge the limits of existing proof assistants, especially in areas where automation faces challenges - Collaborate with AI researchers to develop and refine formal verification strategies - Create readable, reproducible proof scripts aligned with best mathematical practices and proof assistant idioms - Offer expert guidance on proof decomposition, lemma selection, and structuring techniques for formal models - Investigate instances where automated provers fail and provide articulate explanations such as complexity issues, missing lemmas, or insufficient libraries - Develop Lean proofs that reveal deeper patterns or generalizations implicit in the original mathematics Qualifications Required: - Hold a Master's degree or higher in Mathematics, Logic, Theoretical Computer Science, or a related field - Possess a strong foundation in rigorous proof writing across various areas such as algebra, analysis, topology, logic, or discrete math - Hands-on experience with Lean (Lean 3 or Lean 4), Coq, Isabelle/HOL, Agda, or similar systems, with a preference for Lean - Deep enthusiasm for formal verification, proof assistants, and the future of mechanized mathematics - Ability to translate dense informal arguments into well-structured formal proofs with precision This role is ideal for a mathematically mature problem-solver who enjoys the challenge of translating complex arguments into machine-verifiable forms. You should appreciate structural beauty and precision, and be energized by resolving gaps that automated tools struggle to bridge. Strong communication skills are essential for explaining formalization decisions, edge cases, and proof strategies to collaborators. This opportunity allows you to work on cutting-edge AI projects, offering freelance autonomy with intellectually demanding work. You will have the chance to contribute to mapping the frontier of mechanized mathematics and gain exposure to how advanced AI systems are trained to reason formally. Additionally, there is potential for ongoing work and contract extensions as new projects launch. As a Lean 4 Proof Engineer in this role, your primary responsibility will be to translate complex, human-written mathematical arguments into precise, machine-verifiable formalizations. You will be pushing the boundaries of what modern proof assistants can express and automate. This fully remote, flexible contract role is tailored for mathematicians who excel in rigorous proof construction and formal verification. Key Responsibilities: - Translate informal mathematical proofs into Lean 4 (and related systems) with a focus on clarity, structure, and correctness - Analyze domain-specific proofs to identify gaps, hidden assumptions, and formalizable sub-structures - Construct formalizations that challenge the limits of existing proof assistants, especially in areas where automation faces challenges - Collaborate with AI researchers to develop and refine formal verification strategies - Create readable, reproducible proof scripts aligned with best mathematical practices and proof assistant idioms - Offer expert guidance on proof decomposition, lemma selection, and structuring techniques for formal models - Investigate instances where automated provers fail and provide articulate explanations such as complexity issues, missing lemmas, or insufficient libraries - Develop Lean proofs that reveal deeper patterns or generalizations implicit in the original mathematics Qualifications Required: - Hold a Master's degree or higher in Mathematics, Logic, Theoretical Computer Science, or a related field - Possess a strong foundation in rigorous proof writing across various areas such as algebra, analysis, topology, logic, or discrete math - Hands-on experience with Lean (Lean 3 or Lean 4), Coq, Isabelle/HOL, Agda, or similar systems, with a preference for Lean - Deep enthusiasm for formal verification, proof assistants, and the future of mechanized mathematics - Ability to translate dense informal arguments into well-structured formal proofs with precision This role is ideal for a mathematically mature problem-solver who enjoys the challenge of translating complex arguments into machine-verifiable forms. You should appreciate structural beauty and precision, and be energi