Pith. sign in

REVIEW 3 major objections 4 minor 1 cited by

Renormalization for Bruin-Troubetzkoy ITMs

T0 review · 3 major / 4 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A new Rauzy-style induction for Bruin-Troubetzkoy interval translation mappings produces a renormalization-invariant measure and shows the infinite-type parameter set has Hausdorff dimension between 1.5 and 2, matching its affinity…

desk verdict A promising renormalization framework for Bruin-Troubetzkoy ITMs, but a false lemma in the Pisot proof and an unverified SOSC leave two of the three main theorems unproven as written. read the letter →

arxiv 2412.07928 v2 pith:YRY4EIUD submitted 2024-12-10 math.DS

Mauro Artigiani , Pascal Hubert , Alexandra Skripchenko This is my paper · ORCID
classification math.DS MSC 37E0537A0537A4411J70
keywords intervaltranslationmappingsrenormalizationmultidimensionalcontinuedfractionsPisotpropertyHausdorffdimensionaffinityuniqueergodicityBruin-Troubetzkoygasket
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies the two-parameter family of three-interval translation maps introduced by Bruin and Troubetzkoy, maps of the unit interval made of three translations whose images may overlap and leave holes. It proposes a renormalization scheme, an induction on the interval similar in spirit to Rauzy induction for interval exchanges, and views it as a multidimensional continued fraction algorithm. The central aim is to show that the parameter set giving infinite-type (Cantor-attractor) maps carries a natural renormalization-invariant measure, that almost every such map is uniquely ergodic, and that this parameter set is a fractal with Hausdorff dimension between 1.5 and 2 equal to its affinity dimension. If correct, this turns a family previously understood through a Gauss map and symbolic substitutions into a self-affine gasket controlled by a matrix cocycle, and it exhibits a new combination: the renormalization algorithm has the Pisot property almost surely while the underlying maps are expected to be typically weak mixing.

What carries the argument

The load-bearing object is the induction on the simplex of interval lengths , with Cases 1 and 3 coded by the matrices , , and their symmetric analogues , ; iterating the induction gives a Markovian multidimensional continued fraction algorithm, named the Arnoux-Rauzy-Cassaigne (ARC) algorithm, whose projectivized action is a simplicial system. The invariant measure is obtained as the projection of the measure of maximal entropy on the natural suspension of this simplicial system. For the dimension result, the infinite-type set is realized as the attractor of an iterated function system generated by the semigroup built from these matrices, and the affinity dimension is the critical exponent of the singular-value zeta function of that semigroup.

What would settle it

For a fixed truncation level, write down the finitely many projective maps in the conjugated iterated function system and check whether their images on the open simplex are pairwise disjoint; a single overlap with nonempty interior violates SOSC and would break the application of the theorem giving dimension equals affinity dimension. Alternatively, compute the pressure function for the truncated semigroup and test whether its unique root approaches the claimed affinity dimension as the truncation level grows.

Watch

Extended reading notes

Core claim

The central discovery is that the Bruin-Troubetzkoy gasket, the set of parameters for which the interval translation map is of infinite type, is a self-affine fractal of the same general kind as the Rauzy gasket, and its Hausdorff dimension coincides with the affinity dimension of an associated semigroup of positive matrices. The authors construct an induction with four basic moves, encode it as a simplicial system, and use the simplicial-system machinery to produce a renormalization-invariant measure fully supported on this parameter set; for almost every such parameter the interval translation map is uniquely ergodic. They prove that the Hausdorff dimension lies between 1.5 and 2 and equals the affinity dimension, and they show that the induced multidimensional continued fraction algorithm has an almost everywhere negative second Lyapunov exponent, i.e., the Pisot property. Together these results upgrade earlier qualitative statements about this family into a measure-theoretic and dimension-theoretic picture.

Load-bearing premise

The equality between Hausdorff dimension and affinity dimension rests on the strong open set condition (SOSC) for the conjugated iterated function system generated by the truncated matrix sets, which the paper asserts but does not verify by constructing the required open set.

Editorial extensions

If this is right

  • There is a renormalization-invariant measure with support exactly equal to the infinite-type parameter set, and almost every Bruin-Troubetzkoy interval translation map with respect to it is uniquely ergodic.
  • The infinite-type parameter set has Hausdorff dimension at least 1.5 and strictly less than 2, so it is a measure-zero but dimension-rich fractal set.
  • Hausdorff dimension equals the affinity dimension, so the dimension is determined by the singular-value function of the matrix semigroup and can be studied through pressure functions.
  • The ARC multidimensional continued fraction algorithm has an almost everywhere negative second Lyapunov exponent, giving the Pisot property for the renormalization cocycle.
  • The paper sets up the conjecture that almost every infinite-type Bruin-Troubetzkoy interval translation map is weakly mixing, which would contrast with the almost sure Pisot property of the renormalization algorithm.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the weak-mixing conjecture is confirmed, Bruin-Troubetzkoy interval translation maps would be a natural family where a Pisot renormalization cocycle coexists with almost sure weak mixing of the underlying systems, showing that the Pisot property does not automatically force spectral rigidity.
  • The same induction should extend to the d-branch Bruin-Troubetzkoy family studied by Bruin, producing analogous gaskets whose dimension bounds are governed by the corresponding matrix semigroup; the paper does not treat that generalization.
  • Because the ARC algorithm comes with an explicit invariant measure and an almost sure Pisot property, it is a candidate for simultaneous Diophantine approximation of pairs of parameters; testing its convergence rates numerically would be a direct check of whether the Pisot property is useful there.
  • One could numerically approximate the Hausdorff dimension by sampling long admissible words in the semigroup and estimating the singular-value pressure; agreement with the affinity dimension would corroborate the open-set assumption, while a mismatch would localize where the proof needs repair.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper introduces an induction/renormalization procedure R for the Bruin–Troubetzkoy family of 3-interval translation maps, interprets it as a Markovian multidimensional continued fraction algorithm (ARC), and derives three main results: (i) a renormalization-invariant measure μ supported on the infinite-type parameter set G with respect to which T_{α,β} is uniquely ergodic almost surely (Theorem 3); (ii) Hausdorff dimension bounds 1.5 ≤ dim_H G < 2 and equality with the affinity dimension (Theorem 4); and (iii) an almost-sure Pisot Lyapunov spectrum for the ARC cocycle (Theorem 5). The proofs combine Fougeron's simplicial-system criteria, the CLL22 Lyapunov-exponent method, and Jurga's results on the Rauzy gasket.

Significance. The significance is potentially high. The paper offers the first natural renormalization-invariant measure for infinite-type Bruin–Troubetzkoy interval translation maps, connects the parameter set to a gasket analogous to the Rauzy gasket, and exhibits a continued-fraction algorithm with the Pisot property whose associated ITMs are conjecturally weak mixing. The manuscript is well organized and contains explicit matrix computations that are in principle checkable. These strengths are real. However, one central lemma is false and a key open-set condition is asserted without proof, so the present form does not establish Theorems 4 and 5.

major comments (3)
  1. [Section 3.2, Lemma 17] Lemma 17 is false as stated. For k=1, write M = A C_A. Then ⊤M = [[2,0,1],[1,1,0],[1,0,1]]. Take f = (1,2,3) ∈ R^3_{\ge 0} and v = (1,-2,1) ∈ f^\perp. A direct computation gives ∥v∥_D = 3 and ∥⊤M v∥_D = 4, so the norm restricted to f^\perp is at least 4/3 > 1, contradicting the claimed value 1. The proof's auxiliary vector v' = (v_1, v_2 - v_3, 0) = (1,-3,0) violates the asserted inequality min v ≤ min v' because min v = -2 and min v' = -3. Since Lemma 19 uses Lemma 17 to discard all non-paired blocks A^k C_A and B^k C_B, and Theorem 20 derives the negative second Lyapunov exponent from Lemma 19, the proof of Theorem 5 is unsupported as written. A corrected argument must either prove a weakened norm bound that still yields contraction, or replace this step entirely.
  2. [Section 4.3, proof of Theorem 22] The proof asserts that, after conjugation, the matrices Γ_N 'satisfy the SOSC', but no open set U or verification of f_i(U) ∩ f_j(U) = ∅ is actually supplied. Theorem 21 (Jurga's Theorem 1.3), which is the mechanism for concluding dim_H K_X = min{s_X, 2}, explicitly requires the strong open set condition. Balancedness (Proposition 24) and Zariski density (Proposition 27) do not by themselves imply disjointness of images. Without a proof of SOSC, the chain sup_N dim_H K_{Γ_N} = sup_N s_{Γ_N} = s_Γ = s_A is not justified, and therefore the equality dim_H G = s_A in Theorem 4 is not established. Please provide a proof or a precise reference for the SOSC claim for the conjugated systems.
  3. [Section 3.2, Lemma 19] The proof of Lemma 19 begins with the unproved assertion that μ assigns positive measure to every cylinder, in particular μ([112211221]) > 0. This positivity is load-bearing: without it, the exponent in the final bound may be non-positive and the inequality cannot imply λ_2 < 0. Positivity on all cylinders does not follow immediately from the support statement in Theorem 3; an argument is needed, for example that each cylinder intersects the parameter simplex in a nonempty open set and that μ has full support. Please state and prove the required positivity property.
minor comments (4)
  1. [Section 2.2, Lemma 7] The name 'Bruin-Troubetzoy' is a typo for 'Bruin-Troubetzkoy'.
  2. [Section 3.2, proof of Lemma 19] The word 'ineuquality' should be 'inequality'; also the notation n_m versus n in the Birkhoff-sum estimate should be made consistent, since the paragraph uses both without explicitly relating the two.
  3. [Section 4.2] The phrase 'identity the alphabet A with the set of matrices' should be 'identify the alphabet A with the set of matrices'.
  4. [Section 3.2, Lemma 16] The notation ∥M|_{f^⊥}∥_D is used before the restricted norm is defined; the convention introduced in equation (5) should be stated immediately after Lemma 16 for readability.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the main theorems are derived from external criteria (Fougeron, Jurga, CLL22) applied to an explicitly constructed IFS, and the self-citations are peripheral.

full rationale

I checked each load-bearing step. Theorem 3 is obtained by verifying Lemma 10 (quickly escaping) and then applying Fougeron's Theorem 4.24; the invariant measure is produced by Fougeron's construction, not fitted to force unique ergodicity. Theorems 4 and 22 use Jurga's Theorem 1.3 after checking Zariski density, balancedness, and relating the semigroup Gamma to the IFS; the affinity dimension is defined as the critical exponent of a singular-value zeta function, and the equality dim_H G = s_A is a proved inequality, not an assumed equivalence. Theorem 5 follows the CLL22 strategy with explicit norm estimates; even if Lemma 17 is wrong as the external reviewer claims, that is a correctness gap, not an input-output tautology. The self-citations ([FS21], [DHS23], [Art+21]) are used for background, terminology, and auxiliary results, not as the source of the central conclusions. Two non-circular weaknesses deserve separate flagging: the proof of Theorem 22 (Section 4.3) asserts that the conjugated Gamma_N 'satisfies the SOSC' without verifying disjointness or constructing the open set, and the proof of Theorem 5 rests on Lemma 17, which the skeptical reviewer supports with a concrete counterexample; both are unproven or potentially false hypotheses, but neither makes the derivation circular. No fitted parameter is renamed as a prediction, and no author-imported uniqueness theorem is invoked to force the construction.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

The central results rely on external machinery from recent preprints: Fougeron's simplicial systems formalism (Fou20) for the measure and upper bound, Jurga's theorem on the Rauzy gasket (Jur23) for the Hausdorff and affinity equality, and CLL22 for the Pisot argument. The paper's contribution is the construction of the ARC algorithm and the verification of some hypotheses. No data were fitted, and no free parameters enter the results; the constants chosen in proofs (epsilon <= 1/5 in Proposition 24) are internal to arguments, not determined by data. The assertion that every cylinder has positive μ-measure is an unproved input to Lemma 19.

assumptions (4)
  • domain assumption Fougeron's simplicial systems machinery: Theorem 4.24 (existence of natural measure μ), Proposition 4.1 (uniform expansion), Corollary 4.4 (ergodicity), Theorem 1.5 (upper Hausdorff bound for quickly escaping systems).
    Theorem 3 and the upper bound in Theorem 4 are derived by reducing to results from Fou20; the paper checks quick escaping via Lemma 10 but does not re-derive the machinery.
  • domain assumption Jurga's Theorem 1.3: for a finite set of positive SL(3,R) matrices generating a Zariski-dense semigroup satisfying SOSC, dim_H K_X = min{s_X, 2}.
    Used in Theorem 22 to show dim_H G = s_A; relies on Jur23, including the SOSC condition which the paper asserts but does not prove.
  • ad hoc to paper Every cylinder has positive μ-measure, so that μ([112211221]) - ε > 0 in Lemma 19.
    Asserted in the proof of Lemma 19 'by its construction, the measure μ assigns positive measure to every cylinder'; no proof is supplied. The negativity of λ2 depends on this.
  • standard math The Veech argument transfers a.e. convergence of the renormalization path to unique ergodicity of the original ITM.
    Standard argument for IETs, invoked to finish Theorem 3 from the measure μ; depends on the geometric shrinking of the renormalization cylinders, which the paper states but does not fully detail.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Renormalization for Bruin-Troubetzkoy ITMs." pith.science (2026). https://pith.science/paper/YRY4EIUD

@misc{pith2026241207928,
  author       = {Pith},
  title        = {Pith review of: Renormalization for Bruin-Troubetzkoy ITMs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YRY4EIUD}},
  note         = {Machine review of arXiv:2412.07928}
}
read the original abstract

We study a class of interval translation mappings introduced by Bruin and Troubetzkoy, describing a new renormalization scheme, inspired by the classical Rauzy induction for this class. We construct a measure, invariant under the renormalization, supported on the parameters yielding infinite type interval translation mappings in this class. With respect to this measure, a.e. transformation is uniquely ergodic. We show that this set has Hausdorff dimension between 1.5 and 2, and that the Hausdorff dimension coincides with the affinity dimension. Finally, seeing our renormalization as a multidimensional continued fraction algorithm, we show that it has almost always the Pisot property. We discover an interesting phenomenon: the dynamics of this class of transformations is often (conjecturally: almost always) weak mixing, while the renormalizing algorithm typically has the Pisot property.

Figures

Figures reproduced from arXiv: 2412.07928 by the authors.

Figure 1
Figure 1. An example of a Bruin-Troubetzkoy ITM. The intervals below are images of the ones above, color coded. to which the restriction of T is a translation. The endpoints of these intervals are called singularities of the map. It was noticed already in [BK95] that each ITM is either of finite or infinite type. This classification is based on the properties of the attractor of the ITM. Namely, for a given mapping T we consi… view at source ↗
Figure 2
Figure 2. The Bruin-Troubetzkoy gasket. For technical reasons, it will be convenient to change from the parameters (α, β) to parameters (a, b, c) in the 2-dimensional symplex, see (2) on Page 5. This is legitimate, since the change of coordinates is given by a linear and invertible map, which preserves the Hausdorff dimension, since it is bi-Lipschitz. By an abuse of notation, we will denote both sets by G . Remark. The upper… view at source ↗
Figure 3
Figure 3. The two cases of the R induction not (immediately) yielding a finite type ITM. Let us also enumerate the intervals of continuity of the map T from the left to the right; thus, the first interval is the one of the length a, the second is the one of the length b and the third is the one of the length c. The vector that codes the order in which the intervals appear at the preimage of T, is given by π = (1, 2, 3). We de… view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: The case of the R induction inducing a finite type ITM. Then, the lengths change in the following way: a ′ = a, b ′ = b, c ′ = c − a, see Figure 3b. As for Case 1, we use a matrix form: ⃗λ = CA ⃗λ ′ , where CA =   1 0 0 0 1 0 1 0 1   . However, this case is very di…
Figure 5
Figure 5. Figure 5: The Rauzy graph G of the induction R. by 3 is longer than the rightmost interval (in our case it is interval labelled by 1), then the resulting ITM is coded by π ′ = (1, 2, 3) again. The matrices that are used to express the old lengths in terms of new ones are slightl…
Figure 6
Figure 6. Figure 6: The induction R as a simplicial system. section we explain how to associate a simplicial system with the induction algorithm. In the next one we check that all the conditions of Fougeron’s criterion are satisfied in our case. We refer to [Fou20] for more details and ex…
Figure 7
Figure 7. Figure 7: The Bruin-Troubetzkoy gasket using the simplicial coordinates (a, b, c). We observe that, by definition of the R induction, the first case is repeated n times, with n ≥ 0 given by n =  a b + c  =  1 − α α  =  1 α  − 1. Then, we are in the third case, and we chang…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Density of Stable Interval Translation Maps

    math.DS 2024-11 conditional novelty 8.0 of 10

    For interval translation maps on any fixed number of intervals, the stable, finite-type maps form an open and dense subset of parameter space.

Reference graph

Works this paper leans on

3 extracted references · 2 canonical work pages · cited by 1 Pith paper

  1. [215]

    A note on double rotations of infinite type

    issn: 0037-9484. doi: 10.24033/bsmf.2164. [Art+21] Mauro Artigiani, Charles Fougeron, Pascal Hubert, and Alexandra Skripchenko. “A note on double rotations of infinite type”.Trans. Mosc. Math. Soc.2021 (2021), pp. 157–172.issn: 0077-1554. doi: 10.1090/ mosc/311. [AF07] Artur Avila and Giovanni Forni. “Weak mixing for interval exchange transformations and ...

    work page doi:10.24033/bsmf.2164 2021

  2. [3857]

    Renormalization in a class of interval translation maps of d branches

    doi: 10.1017/S0143385700009652. [Bru07] Henk Bruin. “Renormalization in a class of interval translation maps of d branches”. Dyn. Syst.22.1 (2007), pp. 11–24.issn: 1468-9367. doi: 10.1080/14689360601028084. [BC12] Henk Bruin and Gregory Clack. “Inducing and unique ergodicity of double rotations”.Discrete Contin. Dyn. Syst.32.12 (2012), pp. 4133–

    work page doi:10.1017/s0143385700009652 2007

  3. [4147]

    Interval Translation Maps with Weakly Mixing Attractors

    issn: 1078-0947. doi: 10.3934/dcds.2012.32.4133. [BR23] Henk Bruin and Silvia Radinger. “Interval Translation Maps with Weakly Mixing Attractors”. 2023. arXiv:2312.10533 [math.DS]. [BT03] Henk Bruin and Serge Troubetzkoy. “The Gauss map on a class of interval translation mappings”.Isr. J. Math.137 (2003), pp. 125–148. issn: 0021-2172. doi: 10.1007/BF02785...

    arXiv 2003

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.