The abelianization of is
ProvedCannonFloydParry.nonempty_abelianization_mulEquiv_zsqThe quotient of Thompson's group by its commutator subgroup is isomorphic to .
In the source the isomorphism is induced by the homomorphism sending to the pair of integers for which the right derivative of at is and the left derivative of at is . The assertion here is that some isomorphism exists, not that it is this particular one.
import Definitions.Def_CannonFloydParry
import Mathlib
namespace CannonFloydParry
theorem nonempty_abelianization_mulEquiv_zsq :
Nonempty (Abelianization F ≃* Multiplicative (ℤ × ℤ)) := by
sorry
end CannonFloydParry
Read-back
What the Lean code literally says, in plain math · claude-opus-5
Read-back
The declaration is a single closed statement. It has no variables, no hypotheses and no typeclass assumptions of its own: nothing is quantified over, and there is nothing to satisfy before it applies. Everything it speaks about is fixed by the definitions it names. Its content is one existence claim, which the rest of this note unpacks in full.
What the statement asserts, in one sentence
Writing for the group defined below and for its abelianization, the statement asserts:
where is the set of ordered pairs of integers with the group operation , that operation being written multiplicatively. Equivalently: is isomorphic, as a group, to the free abelian group of rank .
The claim is purely existential. It exhibits no particular isomorphism, says nothing about where any specific element of is sent, and asserts no naturality, canonicity or uniqueness: it says only that the collection of such isomorphisms is not empty.
The ambient group
Let
regarded as a set in its own right and ordered by the order it inherits from (so in means exactly in ).
Let be the set of order isomorphisms of . An element of is a package consisting of
- a map ,
- a map ,
- the two round-trip identities and for all , and
- the equivalence , for all .
No continuity, differentiability or measurability is required: an order isomorphism here is an order-theoretic object, not a topological one. (Since is a linearly ordered interval, the order condition does of course constrain strongly; the point is only that no topological hypothesis is written down.)
is a group under composition, with
with the identity map as neutral element and with as the inverse of . The order of composition is worth recording: in a product, the right factor is applied first.
Dyadic rationals
A real number is called dyadic when there are an integer and a natural number (with allowed) such that
So the dyadic numbers include all integers, and include negative numbers; they are not restricted to .
The generating condition
Call an element piecewise dyadic-linear when the following holds:
There exists a finite set such that
- every element of is dyadic, and
- for all with and
(the open interval from to meets in no point), there exist an integer and a real number such that
Several features of this condition affect what it says, and are recorded here rather than smoothed over.
- The set is existentially quantified, finite, and required only to consist of dyadic numbers. It is not required to be contained in , nor to be the exact set of points where fails to be linear; any finite dyadic set with the stated property will do. The empty set is permitted, in which case the condition demands a single formula valid on all of at once.
- The exponent and the intercept are quantified inside the "for all ", so they may differ from one interval to the next. That is what makes the condition a piecewise one.
- The slope is with an integer, not a natural number: it is a positive power of two and may be less than (e.g. , ), but it is always strictly positive. Slope and negative slopes are excluded.
- The intercept is an arbitrary real number. Nothing in this condition requires to be dyadic, or rational.
- The affine identity is imposed on the closed interval , endpoints included, and only for those that also lie in .
The group
Let
and let
be the subgroup of generated by : the smallest subgroup of containing , equivalently the intersection of all subgroups of that contain , equivalently the set of all finite products of elements of and of their inverses (together with the empty product, the identity).
is the generated subgroup, not the set itself. Nothing in the definitions used by this statement asserts that is already closed under composition and inversion, so is all that is available; whether the inclusion is an equality is not part of what is being said here.
Throughout the statement, is treated as a group in its own right: its elements are the elements of that lie in , and its multiplication, identity and inversion are those of restricted to .
The abelianization
Let denote the commutator subgroup of : the subgroup of generated by all commutators
that is, the smallest subgroup of containing every such element. (Commutators are formed inside , with both entries ranging over all of .)
Then
the quotient of by that subgroup, taken as the set of equivalence classes under
carrying the multiplication induced from . This is a group, and an abelian one. In the statement it is this quotient group that appears on the left-hand side.
The target group
The right-hand side is the set of ordered pairs of integers, carrying the operation
i.e. componentwise integer addition, written multiplicatively. The underlying set is literally the set of integer pairs; only the name and symbol of the operation change. This is the free abelian group of rank two, with its two additive coordinates.
Two readings that are not intended, and are excluded by what is written: the target is not a direct product of two copies of some separate multiplicative group, and the operation is not componentwise multiplication of integers. It is componentwise addition, relabelled.
The isomorphism that is claimed to exist
The objects whose existence is asserted are multiplication-preserving equivalences. Such an object consists of exactly the following data and properties:
- a map ;
- a map ;
- the identity for every ;
- the identity for every ;
- multiplicativity: for all — spelled out with the operations above, this says
in , coordinatewise.
The two round-trip identities make a bijection with as its inverse. Note that preservation of the identity element and of inverses is not among the demands: the required data is a bijection together with multiplicativity, nothing more. (For groups these further properties follow, but they are not what is being asserted.)
Finally, the statement asserts the nonemptiness of the collection of such objects, as a proposition. It does not name, construct or characterise one; it does not claim that any two of them agree; and it carries no information about which isomorphism, among possibly many, one might obtain.
Degenerate and edge cases
- There are no hypotheses in this statement, hence none that could be vacuous or impossible to satisfy. Nothing needs to be supplied to instantiate it.
- is allowed in the definition of dyadic, so every integer is dyadic.
- is allowed in the generating condition, as noted above.
- The generating condition places no requirement on at a single point in isolation: its hypothesis requires strictly, so degenerate intervals impose nothing directly.
- Because the target is and not merely "some abelian group", the statement carries quantitative content about : it says is infinite, torsion-free, and generated by exactly two independent elements. It is strictly stronger than saying that is abelian, or finitely generated, or free abelian of some unspecified rank.
Confirmed by the mission captain (proposal self-audit).