Pith. sign in

REVIEW 1 major objections 5 minor 18 references

Local Scaling and Dimension Distortion of Generalized Cantor Functions

T0 review · 1 major / 5 minor · reviewed 2026-08-27 · deepseek-v4-flash

Pith's one-line read This paper proves a complete symbolic criterion for the local scaling exponent of any generalized Cantor function, and derives an exact Hausdorff-dimension distortion law from it.

desk verdict A genuinely new pointwise scaling criterion for generalized Cantor functions, with a real but easily repairable proof gap in the converse of Theorem 2.1; worth refereeing. read the letter →

arxiv 2608.22423 v2 pith:T45JRZY7 submitted 2026-08-23 math.CA

classification math.CA MSC 28A8026A3028A78
keywords generalizedCantorfunctionself-similarmeasurelocalscalingexponentHausdorffdimensiondistortionsymboliccodingendpointrunscross-entropy
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

This paper establishes a complete pointwise criterion for when a generalized Cantor function, the distribution function of a self-similar Cantor measure, has a power-law local scaling at a point of its Cantor set. The criterion is symbolic: at $x=\pi(\omega)$, the scaling exponent exists and equals $\alpha>0$ exactly when the ratio $A_n(\omega)/B_n(\omega)$ of accumulated logarithmic mass to accumulated logarithmic contraction converges to $\alpha$ and the endpoint runs $R_n(\omega)$ grow sublinearly. This separates the bulk mass-geometry balance from the corrections produced by long runs along extreme branches, and it works for arbitrary contraction ratios and probability weights under the sole assumption that the defining intervals are pairwise disjoint. As an application, the paper constructs a subset $M\subset K$ of full Hausdorff measure on which the exponent is $h(\mathbf q,\mathbf p)/\chi(\mathbf q)$ and proves the exact dimension-distortion identity $\dim_{\mathrm H} F(A) = \frac{\chi(\mathbf q)}{h(\mathbf q,\mathbf p)} \dim_{\mathrm H} A$ for every $A\subset M$. A non-uniform three-branch example shows that convergence of the bulk ratio alone is not enough, because long endpoint runs can force two different limiting exponents along two sequences approaching the same point.

What carries the argument

The load-bearing object is the symbolic recursion $T(\omega)=c_{\omega_1}+p_{\omega_1}T(\sigma\omega)$ for $T=F\circ\pi$, where $c_i$ is the cumulative mass of the cylinders to the left of branch $i$. This identity lets the proof express the value difference $|F(x)-F(y)|$ as a product of cylinder probabilities times a residual difference, and Lemma 3.2 uses it to bound that residual below by $p_{\min}^{R_n(\omega)+2}$. Together with the separation constant $\delta=\min_{i<j} \operatorname{dist}(S_i(K),S_j(K))>0$, which keeps the geometric factor $\log w(x,y)$ bounded, this reduces the scaling quotient $Q(x,y)$ to $A_n(\omega)/B_n(\omega)$ plus an error controlled by $R_n(\omega)/n$. The sufficiency and necessity of Theorem 2.1 are both obtained from these two estimates.

What would settle it

Construct, or search for, a coding $\omega$ with $A_n(\omega)/B_n(\omega)\to\alpha$ and $R_n(\omega)/n\to 0$ for which the quotient $\log|F(y)-F(x)|/\log|y-x|$ nevertheless has two distinct subsequential limits as $y\to x$; this would refute the sufficiency direction of Theorem 2.1. Conversely, a point where the scaling limit exists and equals $\alpha$ but $A_n/B_n$ does not converge to $\alpha$ would refute the necessity direction. The paper's Section 5 example supplies the template for the first search: coding $\omega^{(2)}$ has bulk convergence but $R_{n_k}/n_k\to 1$, and two approaching sequences give limits $\alpha_0$ and $2\alpha_0$, so the theorem predicts, and the calculation confirms, no scaling exponent.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is Theorem 2.1: for $x=\pi(\omega)$ in the self-similar set $K$ with strong separation, the logarithmic local scaling exponent $\lim_{y\to x,\,y\in K} \frac{\log|F(y)-F(x)|}{\log|y-x|}$ equals $\alpha>0$ if and only if $\lim_n A_n(\omega)/B_n(\omega)=\alpha$ and $\lim_n R_n(\omega)/n=0$. The proof splits the scaling quotient into the bulk ratio $A_{n-1}/B_{n-1}$ plus a correction term bounded by $R_n(\omega)/n$; the endpoint-run condition forces that correction to vanish, and the contradiction argument shows that any linear endpoint run produces a second sequence with a strictly larger limit. Theorem 2.2 then restricts to $\mathbf q$-typical codings, where the strong law gives $A_n/B_n \to h(\mathbf q,\mathbf p)/\chi(\mathbf q)$ and $R_n/n\to 0$ almost surely, so the exponent is constant on a full-measure set $M\subset K^*$, and the distortion lemma converts this into the exact dimension formula $\dim_{\mathrm H} F(A) = \frac{\chi(\mathbf q)}{h(\mathbf q,\mathbf p)} \dim_{\mathrm H} A$ for every $A\subset M$.

Load-bearing premise

The single premise the argument cannot do without is that the intervals $S_i([0,1])$ are pairwise disjoint: this positive gap is what makes different codings geometrically separated and is used in both directions of the proof of Theorem 2.1.

Editorial extensions

If this is right

  • At every point whose coding has $A_n(\omega)/B_n(\omega)\to\alpha$ and $R_n(\omega)/n\to 0$, the local scaling exponent exists and equals $\alpha$; in particular, the set of $\alpha$-scaling points is described purely by digit statistics of the coding.
  • For $\mathbf q$-typical points, the exponent is $h(\mathbf q,\mathbf p)/\chi(\mathbf q)$, so when $\mathbf p=\mathbf q$ the typical exponent is the similarity dimension $s$ and the dimension-distortion factor is $1/s$.
  • The dimension-distortion factor $\chi(\mathbf q)/h(\mathbf q,\mathbf p)$ equals $1/(s+D_{KL}(\mathbf q\|\mathbf p)/\chi(\mathbf q))$, so any deviation of $\mathbf p$ from the natural weights strictly lowers the factor below $1/s$; the classical ternary Cantor function is recovered by $\mathbf p=\mathbf q=(1/2,1/2)$.
  • If the local scaling exponent exists at every point of a set $A\subset M$, then $F$ multiplies the Hausdorff dimension of every subset by the reciprocal of that exponent; hence the pointwise criterion and the dimension formula are two sides of one mechanism.

Reading between the lines

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

  • Because the criterion is purely symbolic, it gives an algorithm: for any concrete coding, decide existence of the scaling exponent by checking two limits in digit frequencies and run lengths. The same reduction should apply to graph-directed self-similar functions, where endpoint runs are replaced by transitions along the graph.
  • The paper proves the dimension-distortion formula on a full $\mathcal H^s$-measure subset, not on all of $K^*$; a natural next question, not addressed here, is whether the identity extends to all of $K^*$ or whether exceptional codings with linear endpoint runs genuinely break it.
  • The endpoint-run condition suggests a classification of points by $\limsup R_n/n$: one expects mixed exponents governed by $\alpha + c\cdot \limsup R_n/n$ when approaching from the side of a long run. The two-sequence example in Section 5 is exactly the first instance of such a mixed-exponent phenomenon.
  • The role of the separation constant $\delta$ in the proof suggests that overlapping systems need a third term involving iterated overlaps; testing the criterion on a self-similar system with exact overlaps would reveal whether sublinear endpoint runs still suffice.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 5 minor

Summary. The paper studies the pointwise local scaling of distribution functions of self-similar Cantor measures on the real line, under a strong separation condition on the underlying IFS. The main theorem (Theorem 2.1) characterizes, for a point x=π(ω) in the attractor K, the existence of the limit of log|F(y)-F(x)|/log|y-x| as y→x in K in terms of the convergence of A_n(ω)/B_n(ω) to a prescribed α>0 and the sublinear growth of the endpoint runs R_n(ω)/n. A second theorem (Theorem 2.2) constructs a full H^s-measure subset M of K on which the typical exponent is the cross-entropy-to-Lyapunov ratio h(q,p)/χ(q), and derives the exact dimension-distortion formula dim_H F(A) = (χ(q)/h(q,p)) dim_H A for all A⊂M. A three-branch example is used to show that the endpoint-run condition is necessary. The derivation is mostly symbolic and uses standard tools such as the strong law of large numbers, Borel-Cantelli, and Hutchinson's theorem.

Significance. If the proof gap discussed below is fixed, the paper would be a valuable contribution: it gives a genuinely pointwise, if-and-only-if characterization of local scaling for generalized Cantor functions with arbitrary contraction ratios and probability weights, and it connects the pointwise exponent to an exact Hausdorff-dimension distortion formula on a full-measure subset. The paper ships no fitted parameters, the main assertions are falsifiable through the explicit symbolic criterion, and the three-branch example is a useful concrete test of the necessity of the endpoint-run condition. The proofs are largely self-contained, with the external dimension-distortion lemma from [7] used transparently as a tool.

major comments (1)
  1. [Section 3, proof of Theorem 2.1 (converse)] The displayed two-sided estimate for Q(x,y_n) after the construction of y_n contains an incorrect lower bound. From Q = (A_n - log z)/(B_n - log w) together with z ≥ p_min and δ ≤ w ≤ 1, the valid lower bound is Q ≥ A_n/(B_n - log δ), not A_n/B_n - log δ. As printed, the lower bound tends to α - log δ and cannot be used to conclude A_n/B_n → α from Q(x,y_n) → α. The corrected lower bound together with the existing upper bound (A_n - log p_min)/B_n both tend to α, and a simple rearrangement gives A_n/B_n → α, so the conclusion is recoverable. This is a local, repairable gap, but the formula and the subsequent sentence 'Taking limits on both sides' must be corrected.
minor comments (5)
  1. [Section 3, endpoint-run contradiction] The phrase 'after moving each n_j backward to the beginning of the corresponding endpoint run' is confusing: the construction requires n_j to be placed immediately before the run, so that ω_{n_j} ≠ 1 in the first case and ω_{n_j} ≠ m in the second. Please clarify this index shift, since it is essential for the definition of η^(j).
  2. [Section 4, proof of Theorem 2.2] The implication μ((x,y]) = 0 ⇒ (x,y) ∩ K = ∅ is used twice but not justified. Add a sentence explaining that if a point of K lay in (x,y), then a sufficiently small cylinder of the IFS with positive μ-mass would also lie in (x,y), giving μ((x,y]) > 0.
  3. [Section 5, second subsequence] In the computation of z(x_2, \tilde y_k), the value T(21) = p_1 is used implicitly. This follows from Lemma 3.1 together with T(1) = 0, but T(1) = 0 (where 1 denotes the constant coding 111...) is never stated explicitly; please state it at first use.
  4. [Title] The title as extracted contains an evident typo, 'DISTOR TION'; please correct it to 'DISTORTION' in the final version.
  5. [Throughout] Several displayed formulas mix inline text and fraction notation in a way that is hard to parse in the extracted version (for example, the lower bound discussed in the major comment). Please ensure that all fractions are typeset unambiguously.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the derivation chain is self-contained and no prediction reduces to its inputs.

full rationale

The paper's main result, Theorem 2.1, is proved by two-sided estimates of the quotient Q(x,y) in terms of the symbolic quantities A_n(omega)/B_n(omega) and endpoint-run lengths R_n(omega); the converse constructs nearby points y_n and uses the strong separation condition, not the target limit, to force A_n/B_n to alpha. The endpoint-run condition is then derived by contradiction from the assumed local scaling exponent, and the example in Section 5 directly computes both limits to show that the bulk quotient alone is insufficient. Proposition 4.1 derives the typical exponent h(q,p)/chi(q) from the strong law of large numbers and Borel-Cantelli, with no fitted parameters. Theorem 2.2 combines Theorem 2.1, Hutchinson's external full-measure lemma, and the external dimension-distortion lemma [7]; these are independent results, not self-citations, and the paper's own derivation supplies the pointwise exponent required to apply them. There are no author self-citations, no fitted inputs renamed as predictions, and no ansatz smuggled in via prior work of the same authors. The only visible issue is a possible algebraic misstatement in the squeeze displayed in the converse direction of Theorem 2.1 (the displayed bounds do not evidently follow and would not squeeze to alpha); this is a local, repairable proof gap, not a circular reduction of the conclusion to its assumptions. Therefore no circular step is identified.

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

The central results introduce no fitted parameters: the weights p and contraction ratios r are arbitrary inputs, while q is derived from the IFS. The proof relies on standard facts, the stated strong-separation assumption, and the external dimension-distortion lemma from [7]. No new entities are postulated.

assumptions (4)
  • domain assumption Strong separation: the intervals S_i([0,1]) are pairwise disjoint for i=1..m.
    Stated in Section 1; used to define δ>0 in (10), ensure the coding map π is injective, and justify the endpoint estimates z(x,y)≥p_min^{R_n+2} and w(x,y)≥δ.
  • standard math Hutchinson's theorem gives existence and uniqueness of the self-similar set and measure, and the identity μ'=H^s|_K/H^s(K) for the natural vector q.
    Invocations in Section 1 and Lemma 4.2, cited to [12].
  • standard math Strong law of large numbers for Bernoulli measures and the Borel-Cantelli lemma.
    Used in Proposition 4.1 to identify typical limits and run-length growth.
  • standard math Lemma 4.3, the dimension distortion lemma for homeomorphisms with constant local exponent, is assumed valid as stated in [7].
    External result used to convert the pointwise exponent into the dimension formula in Theorem 2.2.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Local Scaling and Dimension Distortion of Generalized Cantor Functions." pith.science (2026). https://pith.science/paper/T45JRZY7

@misc{pith2026260822423,
  author       = {Pith},
  title        = {Pith review of: Local Scaling and Dimension Distortion of Generalized Cantor Functions},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/T45JRZY7}},
  note         = {Machine review of arXiv:2608.22423}
}
abstract

Let \(\mu\) be a self-similar Cantor measure on \(\mathbb R\) associated with a probability weight vector \(\mathbf p\), let \(K=\operatorname{supp}\mu\), and let \(F\) denote the distribution function of \(\mu\). We characterize the points \(x\in K\) at which the local scaling exponent \[ \lim_{\substack{y\to x, y\in K}} \frac{\log |F(y)-F(x)|}{\log |y-x|} \] exists and assumes a prescribed value. The characterization is formulated in terms of the convergence of the ratio between the accumulated logarithmic mass and geometric scales, together with the sublinear growth of the endpoint runs. Unlike the classical ternary case, our approach applies to arbitrary contraction ratios and probability weights. As an application, we construct a subset \(M\subset K\) of full Hausdorff measure on which the local scaling exponent of \(F\) is ${h(\mathbf q,\mathbf p)}/{\chi(\mathbf q)}$ and establish the exact dimension-distortion formula \[ \dim_{\mathrm H} F(A) = \frac{\chi(\mathbf q)}{h(\mathbf q,\mathbf p)} \dim_{\mathrm H} A \] for every \(A\subset M\), where \(\mathbf q\) is the natural probability vector, \(\chi(\mathbf q)\) is the corresponding Lyapunov exponent, and \(h(\mathbf q,\mathbf p)\) is the cross-entropy of \(\mathbf q\) relative to \(\mathbf p\). A three-branch example illustrates the results.

Figures

Figures reproduced from arXiv: 2608.22423 by the authors.

Figure 1
Figure 1. Generalized Cantor functions associated with the fixed IFS and three different probability vectors. Larger values of αp indicate flatter behavior at Hs -almost every point of K. 11 [PITH_FULL_IMAGE:figures/full_fig_p011_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

  1. [7]

    Dovgoshey, O

    O. Dovgoshey, O. Martio, V. Ryazanov, and M. Vuorinen, Linear distortion of Hausdorff dimension and Cantor’s function,Collect. Math.57(2006), no. 2, 193–210

  2. [1]

    I. S. Baek and W. Li, Dimensions of non-differentiability points of generalized Cantor functions,Acta Math. Sinica (Chinese Ser.)57(2014), no. 5, 939–946

  3. [2]

    R. B. Darst, The Hausdorff dimension of the nondifferentiability set of the Cantor function is ln 2/ln 3 2 , Proc. Amer. Math. Soc.119(1993), no. 1, 105–108

  4. [3]

    R. B. Darst, Hausdorff dimension of sets of non-differentiability points of Cantor functions,Math. Proc. Cambridge Philos. Soc.117(1995), no. 1, 185–191

  5. [4]

    F. M. Dekking and W. Li, How smooth is a devil’s staircase?,Fractals11(2003), no. 1, 101–107

  6. [5]

    T. P. Dence, Differentiable points of the generalized Cantor function,Rocky Mountain J. Math.9(1979), no. 2, 239–249

  7. [6]

    Dovgoshey, O

    O. Dovgoshey, O. Martio, V. Ryazanov, and M. Vuorinen, The Cantor function,Expo. Math.24(2006), no. 1, 1–37

  8. [8]

    J. A. Eidswick, A characterization of the nondifferentiability set of the Cantor function,Proc. Amer. Math. Soc.42(1974), 214–217

Show all 18 references
  1. [9]

    K. J. Falconer, One-sided multifractal analysis and points of non-differentiability of devil’s staircases, Math. Proc. Cambridge Philos. Soc.136(2004), no. 1, 167–174. 13

  2. [10]

    Feng and J

    M. Feng and J. J. Miao, Hölder differentiability of self-similar measures,J. Fractal Geom.(2025), published online first

  3. [11]

    R. E. Gilman, A class of functions continuous but not absolutely continuous,Ann. of Math. (2)33 (1932), 433–442

  4. [12]

    J. E. Hutchinson, Fractals and self-similarity,Indiana Univ. Math. J.30(1981), no. 5, 713–747

  5. [13]

    Kesseböhmer and B

    M. Kesseböhmer and B. O. Stratmann, Hölder-differentiability of Gibbs distribution functions,Math. Proc. Cambridge Philos. Soc.147(2009), no. 2, 489–503

  6. [14]

    Li, Non-differentiability points of Cantor functions,Math

    W. Li, Non-differentiability points of Cantor functions,Math. Nachr.280(2007), no. 1–2, 140–151

  7. [15]

    W. Li, D. Xiao, and F. M. Dekking, Non-differentiability of devil’s staircases and dimensions of subsets of Moran sets,Math. Proc. Cambridge Philos. Soc.133(2002), no. 2, 345–355

  8. [16]

    Morris, The Hausdorff dimension of the nondifferentiability set of a nonsymmetric Cantor function, Rocky Mountain J

    J. Morris, The Hausdorff dimension of the nondifferentiability set of a nonsymmetric Cantor function, Rocky Mountain J. Math.32(2002), no. 1, 357–370

  9. [17]

    Troscheit, Hölder differentiability of self-conformal devil’s staircases,Math

    S. Troscheit, Hölder differentiability of self-conformal devil’s staircases,Math. Proc. Cambridge Philos. Soc.156(2014), no. 2, 295–311

  10. [18]

    Y. Yao, Y. Zhang, and W. Li, Dimensions of non-differentiability points of Cantor functions,Studia Math.195(2009), no. 2, 113–125. Hongshen Honors School, Chongqing University, Chongqing, 401331, P.R. China Email address:yuanzhe.shi@icloud.com, shiyuanzhe@stu.cqu.edu.cn Hongsh...

Pith tools

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