Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Problem 19 Goal — Semilocal semiring invertible module free

Disproved
RybinAI2026.P19.semilocal_semiring_invertible_module_free

by wenxinzhang · Sep 4, 2026 · Mathlib c5ea003 (Lean v4.30.0)

finite-semiringsinvertible-moduleslean-formalizationpicard-groupssemirings

For every pair of types RRR and MMM, every commutative-semiring structure on RRR, every assumption that the type MaxSpec⁡(R)\operatorname{MaxSpec}(R)MaxSpec(R) of maximal ideals of RRR is finite, every additive-commutative-monoid structure on MMM, every compatible RRR-module structure on MMM, and every witness that MMM is invertible as an RRR-module, the resulting module MMM is free over RRR; equivalently, MMM admits an RRR-basis indexed by some type. All assumptions and the conclusion refer to the same specified semiring, additive, scalar-multiplication, and invertible-module structures. Finiteness of MaxSpec⁡(R)\operatorname{MaxSpec}(R)MaxSpec(R) does not assert that a maximal ideal exists, so an empty maximal spectrum is included. No additive inverses or nontriviality assumption is imposed on RRR, so RRR may be the zero semiring; MMM need not be an additive group or be separately assumed nonzero, and the zero-module and empty-basis cases are included whenever the invertibility assumption is satisfiable. If any required structure or invertibility witness does not exist for a chosen RRR and MMM, the assertion has no applicable instance and is vacuous for that choice. The conclusion asserts only the existence of a basis: it neither supplies a particular basis nor says that its indexing type is finite or singleton, and it states no rank, uniqueness, or specific isomorphism M≅RM\cong RM≅R.

Preamble
import Mathlib
Formal statement
namespace RybinAI2026.P19

/-- Every invertible module over a commutative semiring with finitely many maximal ideals is
free.  This is the positive form of the semi-local semiring Picard-group question. -/
theorem semilocal_semiring_invertible_module_free
    (R M : Type*) [CommSemiring R] [Finite (MaximalSpectrum R)]
    [AddCommMonoid M] [Module R M] [Module.Invertible R M] :
    Module.Free R M := by
  sorry

end RybinAI2026.P19
Source
https://rybindmitry.github.io/problems/19.html
Read-back

What the Lean code literally says, in plain math · gpt-5.6-sol

For every pair of types RRR and MMM, every commutative-semiring structure on RRR, every assumption that the type MaxSpec⁡(R)\operatorname{MaxSpec}(R)MaxSpec(R) of maximal ideals of RRR is finite, every additive-commutative-monoid structure on MMM, every compatible RRR-module structure on MMM, and every witness that MMM is invertible as an RRR-module, the resulting module MMM is free over RRR; equivalently, MMM admits an RRR-basis indexed by some type. All assumptions and the conclusion refer to the same specified semiring, additive, scalar-multiplication, and invertible-module structures. Finiteness of MaxSpec⁡(R)\operatorname{MaxSpec}(R)MaxSpec(R) does not assert that a maximal ideal exists, so an empty maximal spectrum is included. No additive inverses or nontriviality assumption is imposed on RRR, so RRR may be the zero semiring; MMM need not be an additive group or be separately assumed nonzero, and the zero-module and empty-basis cases are included whenever the invertibility assumption is satisfiable. If any required structure or invertibility witness does not exist for a chosen RRR and MMM, the assertion has no applicable instance and is vacuous for that choice. The conclusion asserts only the existence of a basis: it neither supplies a particular basis nor says that its indexing type is finite or singleton, and it states no rank, uniqueness, or specific isomorphism M≅RM\cong RM≅R.

Human review
  • Endorsed by Shuze Chen · Sep 5, 2026

  • Endorsed by wenxinzhang · Sep 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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