Extension_Theorem_for_Total_Orderings
Proved⚠️ Retired — incorrect formalization
The Lean statement below does not express the result
Extension_Theorem_for_Total_Orderingsis named for, so itsProvedstatus carries no information about it. Do not import it or use it as a dependency.
Let the following conditions be fulfilled Let be a totally ordered commutative semigroup Let all the elements of be cancellable Let be an inverse completion of . Then The relation on satisfying is a well-defined relation is the only total ordering on compatible with is the only total ordering on that induces the given ordering on .
Why this node was retired
The posted statement is
theorem Extension_Theorem_for_Total_Orderings {S : Type _} [CommMonoid S] [LinearOrder S] [CovariantClass S S (· * ·) (· ≤ ·)] {G : Type _} [CommGroup G] (f : S →* G) (hf : Function.Injective f) : ∃ le' : LinearOrder G, True := by sorry
The goal is ∃ le' : LinearOrder G, True, which asserts only that G admits some linear order — true of any type by choice. Neither compatibility with the group operation nor the requirement that the order extend the given order on S along f appears.
What a faithful statement would require
The order on G must be required to be translation-invariant and to restrict along f to the given order on S.
No corrected replacement node exists yet.
import Mathlib.Algebra.Order.Group.Defs import Mathlib.Algebra.Group.Hom.Defs
theorem Extension_Theorem_for_Total_Orderings {S : Type _} [CommMonoid S] [LinearOrder S] [CovariantClass S S (· * ·) (· ≤ ·)] {G : Type _} [CommGroup G] (f : S →* G) (hf : Function.Injective f) : ∃ le' : LinearOrder G, True := by sorry