Kolmogorov Automorphism¶

An invertible measure-preserving system is a K-automorphism when every nontrivial factor has positive entropy.

Version: v1 · 2026-10-31 · History
Domain-specific #: 14526
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Measure Theory, Dynamical Systems → Mathematics
Aliases: K-automorphism

Core Idea¶

A K-automorphism is an invertible measure-preserving transformation whose every nontrivial factor has positive entropy, in the standard probability-space setting. A factor is a coarser system that still follows the dynamics; a one-point factor is trivial. This means that positive entropy of the whole system alone is not enough.^[1]^[2]

How would you explain it like I'm…

No faithful explanation at this level. Two of three generators agree a five-year-old picture collapses into 'a really unpredictable shuffle', i.e. mere positive entropy or Bernoulli randomness, losing the every-factor requirement.

No Predictable Blurry View

Mathematicians study rules that move points around in a space without squishing or stretching the total amount of space, and that can be run backward. Entropy measures how unpredictable such a rule is over time. You can also look at a simpler, blurrier version of the rule, called a factor. A Kolmogorov automorphism is a rule where every blurry version that isn't completely trivial is still unpredictable. Just being unpredictable overall isn't enough — a rule could be unpredictable but still hide a perfectly predictable blurry version.

Completely Positive Entropy

A Kolmogorov automorphism (K-automorphism) is an invertible transformation of a probability space that preserves measure (the 'size' of sets) and has no nontrivial zero-entropy factor. A factor is a coarser system you get from the original in a way that respects the transformation; 'nontrivial' rules out the one-point system. Equivalently, every nontrivial factor has positive entropy — the system has completely positive entropy. This is stronger than having positive entropy overall, because a system could have positive entropy but still contain a predictable, zero-entropy factor. Bernoulli shifts, like repeated coin flips, are K-systems, but not every K-system is Bernoulli.

A Kolmogorov automorphism, or K-automorphism, is an invertible measure-preserving transformation of a standard probability space that has no nontrivial zero-entropy factor. Equivalently in this setting, it has completely positive entropy: every nontrivial factor has positive entropy. A factor is a coarser dynamical system obtained from the original by a map that respects the transformation, and 'nontrivial' excludes the one-point system; all statements hold up to null sets. The property is strictly stronger than positive total entropy, because a system can have positive entropy while still possessing a nontrivial zero-entropy factor, and such a system fails the K-test. Bernoulli shifts are K-systems, but the K-property does not imply that a system is Bernoulli.

Scope of Application¶

Use this test for a specified measure and transformation in ergodic theory. It is not automatically a test for arbitrary noninvertible maps or physical mixtures.

Clarity¶

Ask whether a nontrivial factor can have zero entropy. If one can, the system fails the K test even if the whole system has positive entropy.

Manages Complexity¶

The criterion summarizes a question about all admissible factors; the relevant proof must still establish the hypotheses and the factor condition.

Abstract Reasoning¶

Removing the all-factors condition changes the identity. K also does not require the stronger Bernoulli property.^[3]

Knowledge Transfer¶

Carry the measure, invertibility, factor and entropy conventions with the result. A similarly named kind of mixing can use a different criterion.

Examples¶

Bernoulli shift. Shift a doubly infinite sequence of independent fair coin symbols. Rokhlin identifies Bernoulli automorphisms as K.^[1] Mapped back: product-measure sequence space → invertible shift → source-reported positive entropy for nontrivial factors.

T,T⁻¹ transformation. Independent fair-coin path and scenery sequences define a path-selected scenery shift. Kalikow’s publisher abstract calls the transformation K and reports it not loosely Bernoulli.^[2]^[3] Mapped back: path/scenery product space → path-driven transformation → source-reported K condition, with a non-Bernoulli boundary. The proof is not reproduced here.

Neighborhood in Abstraction Space¶

Kolmogorov Automorphism sits in a sparse region of the domain-specific corpus (69^th percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Measure & Probability Foundations (43 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-31

Not to Be Confused With¶

A positive-entropy system can have a nontrivial zero-entropy factor. A Bernoulli system has a stronger independence-based isomorphism property; K does not require Bernoulli. Ergodicity and physical mixing alone do not establish the K factor test.

References¶

[1] V. A. Rokhlin, Lectures on the entropy theory of measure-preserving transformations, Russian Mathematical Surveys 22, no. 5 (1967), 1–52, §3.6 p. 12 and §13.10 p. 41. Author exposition directly inspected in PDF text extraction; formula typography requires later visual verification. registry ↩a ↩b

[2] Steven Kalikow, Non-intersecting splitting algebras in a non-Bernoulli transformation, arXiv:1108.5737v1 (submitted 29 August 2011), introduction and §5 in the author PDF. The arXiv record gives the v1 submission date; the inspected PDF displays a conflicting internal 2024 date, which remains unresolved. registry ↩a ↩b

[3] Steven Arthur Kalikow, “T, T⁻¹ transformation is not loosely Bernoulli”, Annals of Mathematics 115 (1982), 393–409, DOI 10.2307/1971397. Publisher’s bibliographic page and author abstract directly inspected; full proof not inspected. registry ↩a ↩b