What was already known
Seward proved that equal-entropy Bernoulli shifts over any countably infinite group are isomorphic. Burton’s earlier formal result compared a finite uniform base with its square. The new result covers all nontrivial standard probability bases for one group.
AI involvement
Peter Burton credits Claude Fable 5.2 with the pairing argument and the mathematical definitions and statements. Claude Opus 5.5 agents developed the proofs. Burton chose the target, approved the statement and directed the project.
Importance
The construction removes the entropy restriction for one countable group and extends the earlier finite-base example to arbitrary nontrivial standard bases.
Technical verification
Burton reports a fresh Lean build, a standard-axiom audit and a NanoDa check of the all-base theorem on 11 November. Comparator checked the same theorem sources in the preceding repository layout; the current layout has its own build and NanoDa record.
Formal checking
Burton reports a fresh Lean build, a standard-axiom audit and a NanoDa check of the all-base theorem on 11 November. Comparator checked the same theorem sources in the preceding repository layout; the current layout has its own build and NanoDa record.
- Checker
- Lean and NanoDa, as reported by Peter Burton
- Scope
- There is a countable group × ( ≀ ) whose Bernoulli shifts are measurably isomorphic for every pair of standard probability bases that are not point masses. The isomorphism is equivariant and measure preserving on invariant sets of full measure; base entropies may differ or be infinite.
- Basis
- Reported by the linked checker
- Build, axiom audit and NanoDa checking recordChecking scope
Human understanding
Burton directed the work and checked its statement. The source attributes the argument to Claude and documents no separate human explanation of its central mechanism.
Correction and publication history
New research with documented central AI work and completed checking evidence.
Read this published revision