Problem 19 Milestone — Finite semiring invertible module free
DisprovedRybinAI2026.P19.finite_semiring_invertible_module_freeFor every pair of types and , every commutative-semiring structure on whose underlying type is finite, every additive-commutative-monoid structure on , every compatible -module structure on , and every witness that this particular module is invertible, is a free -module. Here invertibility means that has a tensor inverse: there exist an additive commutative monoid , an -module structure on , and an -linear equivalence , with on the right regarded as its regular module. Freeness means that there exist an index type and an -basis of , equivalently that every element of has a unique expression as a finite -linear combination of the . Only the underlying type of is assumed finite; no explicit finite enumeration of , finiteness or finite generation of , finiteness of , rank-one basis, chosen tensor inverse, unique tensor equivalence, or unique basis is asserted. The hypotheses do not require to have additive inverses, to be cancellative, to have no zero divisors, or to satisfy , and they require only an additive commutative monoid—not an additive group—on . Thus the one-element semiring is included; over it the module axioms force to be trivial, and the basis index may be empty. For types or structures for which the stated semiring, module, finiteness, or invertibility assumptions cannot all be supplied, the universally quantified assertion has no applicable case and is vacuous.
import Mathlib
namespace RybinAI2026.P19
/-- Every invertible module over a finite commutative semiring is free. This is the finite
fallback question from the source problem. -/
theorem finite_semiring_invertible_module_free
(R M : Type*) [CommSemiring R] [Finite R]
[AddCommMonoid M] [Module R M] [Module.Invertible R M] :
Module.Free R M := by
sorry
end RybinAI2026.P19Read-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For every pair of types and , every commutative-semiring structure on whose underlying type is finite, every additive-commutative-monoid structure on , every compatible -module structure on , and every witness that this particular module is invertible, is a free -module. Here invertibility means that has a tensor inverse: there exist an additive commutative monoid , an -module structure on , and an -linear equivalence , with on the right regarded as its regular module. Freeness means that there exist an index type and an -basis of , equivalently that every element of has a unique expression as a finite -linear combination of the . Only the underlying type of is assumed finite; no explicit finite enumeration of , finiteness or finite generation of , finiteness of , rank-one basis, chosen tensor inverse, unique tensor equivalence, or unique basis is asserted. The hypotheses do not require to have additive inverses, to be cancellative, to have no zero divisors, or to satisfy , and they require only an additive commutative monoid—not an additive group—on . Thus the one-element semiring is included; over it the module axioms force to be trivial, and the basis index may be empty. For types or structures for which the stated semiring, module, finiteness, or invertibility assumptions cannot all be supplied, the universally quantified assertion has no applicable case and is vacuous.
Confirmed by the mission captain (proposal self-audit).