Pith. sign in

REVIEW 2 major objections 4 minor 5 references

A Deterministic Fractal Set Derived from the Sequence of Prime Numbers

T0 review · 2 major / 4 minor · reviewed 2026-08-02 · deepseek-v4-flash

Pith's one-line read This paper constructs a deterministic fractal set PF from the residues of primes modulo 16 and proves its Hausdorff and box-counting dimensions both equal 1/4.

desk verdict A correct but textbook-uniform Moran-set dimension computation, dressed up with prime residues that the paper itself proves are irrelevant; repairable proof gaps, but no new mathematics. read the letter →

arxiv 2603.00658 v1 pith:K6HPRPR7 submitted 2026-02-28 math.GM

classification math.GM MSC 28A8011N0528A78
keywords fractalprimenumbersHausdorffdimensionbox-countingMoransetresidueclassesmodulo16Cantordeterministicconstruction
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 defines a Cantor-like set PF inside [0,1] by a rule that reads the sequence of primes modulo 16: at stage n, each existing interval is divided into 16 equal subintervals and only the two whose positions are the residues a_n and a_n+8 are kept. The main claim is that the resulting set is a non-empty, compact, nowhere dense set of measure zero whose Hausdorff dimension and box-counting dimension are both log 2/log 16 = 1/4. The value is said to be universal: any choice of a two-digit selection rule with contraction 1/16 and branching 2 yields the same dimension, so primality enters through the geometry, not the dimension. A generalization gives dimension log k/log m for a base-m, k-branch construction.

What carries the argument

The central object is PF, defined as the intersection of a decreasing sequence F_n, where each F_n is a union of 2^n disjoint closed intervals of length 16^{-n}. The construction is a uniform Moran set: at each step, only two of the 16 subintervals are retained, and the two kept pieces are always separated by at least six discarded subintervals, so the retained intervals stay separated by a uniform gap. This uniform separation is what makes the covering count N_{16^{-n}}(PF) = 2^n exact and what supports the mass-decay estimate mu(J) ≤ C|J|^{1/4}; both feed directly into the dimension calculation. The named identity at the core is the branching/contraction relation log 2/log 16 = 1/4, which

What would settle it

A concrete check is to compute, for the prime-driven construction, the exact number of level-n intervals of length 16^{-n} that an arbitrary interval of length δ < 16^{-n} can intersect. If any such interval met three or more level-n intervals, the mass-decay exponent would fail and dim_H PF could exceed 1/4; if it never meets more than two, the lower bound stands. For the generalized theorem, testing a digit sequence where retained subintervals become adjacent and checking whether the covering number N_{m^{-n}} remains exactly k^n would directly decide whether the universal dimension log k/lo

Watch

Extended reading notes

Core claim

The central discovery is that a deterministic fractal set, PF, can be built directly from the prime residues modulo 16 and that its fractal dimension is exactly 1/4, with Hausdorff and box-counting dimensions agreeing. At each stage, every interval is split into 16 equal pieces and only two are kept, those indexed by the current prime residue a_n and its opposite a_n+8 mod 16. The proof shows that the number of length-16^{-n} intervals needed to cover PF is exactly 2^n, giving box dimension log 2/log 16. For the Hausdorff dimension, the paper constructs a natural mass distribution and proves a measure-decay estimate, then uses the mass distribution principle to get the lower bound; the upper

Load-bearing premise

The whole dimensional argument rests on the uniform separation of the retained subintervals—the fact that the two kept pieces in any parent are always separated by at least six discarded slots—because this controls how many construction pieces a small interval can meet; the printed proof of the measure-decay lemma contains an invalid inequality at that point, though a direct counting argument repairs the estimate.

Editorial extensions

If this is right

  • PF is a concrete deterministic fractal whose Hausdorff and box dimensions both equal exactly 1/4.
  • The dimension is universal: any sequence of angle choices with branching 2 and contraction 1/16 gives the same dimension, so the prime-specific choice affects only the set's geometry, not its dimension.
  • Every point of PF has a hexadecimal expansion whose nth digit is restricted to the two values a_n and a_n+8, linking prime residue statistics to digit-restricted sets.
  • PF is non-empty, compact, nowhere dense, and has Lebesgue measure zero.
  • The generalized construction yields, for any base m and branching k, a deterministic fractal with dimension log k/log m.

Reading between the lines

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

  • Because the dimension theorem is stated for any residue sequence, the equidistribution of primes among residue classes is not needed for the dimensional result; replacing the prime sequence by any deterministic or random two-choice rule should give the same dimension almost surely.
  • The same construction pattern should work with residues modulo other moduli m, producing a family of prime-driven fractals with dimension log 2/log m.
  • If the measure-decay estimate is repaired as suggested by a direct counting argument, the natural measure on PF is a Frostman measure with exponent 1/4; this could be tested numerically by measuring the measure of random short intervals.
  • The dimension result alone does not determine finer geometric properties; computing the exact Hausdorff measure or the multifractal spectrum of PF would be a natural next step that the paper leaves open.
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

2 major / 4 minor

Summary. The paper introduces a deterministic Cantor-type set PF ⊂ [0,1] defined by a recursive rule driven by the residues of consecutive primes modulo 16. At each level, every interval is divided into 16 equal subintervals and exactly two are kept, those indexed by p_n mod 16 and p_n + 8 mod 16. The paper proves that PF is non-empty, compact, nowhere dense, and of Lebesgue measure zero; that its Hausdorff and box-counting dimensions both equal log 2 / log 16 = 1/4; and that this dimension is universal, depending only on the branching number 2 and contraction ratio 1/16. A generalization to arbitrary bases and branching numbers is also claimed.

Significance. If the proof issues identified below are repaired, the paper gives a clean, fully deterministic example of a fractal set with an exact, parameter-free dimension computation. The construction has no fitted parameters and the dimension follows directly from the branching and contraction constants. The main result is a standard Moran-set computation, so the novelty is modest but the example is explicit and the universality claim is elementary. The paper does not contain machine-checked proofs or code, and the proof is written in a conventional style. The Section 6 generalization, however, is not correct as stated and needs to be restricted; the main PF theorem is still defensible with a simple repair to Lemma 12.

major comments (2)
  1. [§4.2, Lemma 12] The proof of the measure-decay estimate contains an invalid inequality. From δ ≥ 16^{-(n+1)} the text asserts 16^n δ + 3 ≤ 4 · 16^n δ. This requires 16^n δ ≥ 1, but the range 16^{-(n+1)} ≤ δ < 16^{-n} includes values with 16^n δ < 1 (e.g., δ just above 16^{-(n+1)} gives 16^n δ ≈ 1/16). This invalidates the written derivation of μ(J) ≤ 4 δ^{1/4}, and with it the lower bound dim_H PF ≥ 1/4 in Theorem 13, since the mass distribution principle is the only lower-bound argument. The estimate itself is true: because δ < 16^{-n} and any two level-n basic intervals are separated by at least 6·16^{-n}, an interval of length δ can meet at most one level-n basic interval, so μ(J) ≤ 2^{-n} ≤ 2 δ^{1/4}. The faulty step should be replaced by this (or an equivalent) argument.
  2. [§6, Definition 17 / Theorem 18] The generalized construction is not well defined for all 1 ≤ k < m. The definition assumes every component interval of F_{n-1} has length m^{-(n-1)}, but this fails when floor(m/k) = 1, because the k retained subintervals are adjacent and merge into a single component of length k m^{-n}. For example, take m = 5, k = 3, and a_n ≡ 0. Then F_1 = [0, 3/5], F_2 = [0, 9/25], and iterating gives the single point {0}, not a set of dimension log 3 / log 5. Thus Theorem 18 as stated is false. The original m = 16, k = 2 case is safe because the retained indices are separated, but the generalization must impose a separation condition (e.g., the retained indices are not adjacent) or be reformulated.
minor comments (4)
  1. [§3, Lemma 6 proof] The statement that 'between them there are exactly six odd positions that are discarded' is not accurate for the linear order: between residues r and r+8 there are seven subintervals, of which three have odd indices. The needed lower bound of 6·16^{-n} is still true, so the proof should be reworded.
  2. [§4.2, Theorem 13] Lemma 12 is stated for intervals J ⊂ [0,1], but the mass distribution principle is applied to arbitrary balls B(x,r) in R. Since μ is supported on [0,1], this is immediate by replacing B(x,r) with an interval of length 2r, but the one-sentence justification is omitted.
  3. [Throughout] Several internal cross-references use different numbering than the displayed environment (e.g., 'Lemma 4.4' for Lemma 12, 'Theorems 4.1 and 4.5' for Theorems 9 and 13, 'Theorem 4.6' in §6). These should be harmonized.
  4. [§3, Theorem 8] The 'if and only if' hexadecimal characterization needs the standard caveat that points with two different hexadecimal expansions are handled up to a countable ambiguity; the paper notes this in parentheses, but it should be part of the theorem statement.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: PF's dimension is computed directly from the construction's branching number 2 and contraction ratio 1/16, with no fitted parameter, no load-bearing self-citation, and no prediction that reduces to an input.

full rationale

The derivation is self-contained. Definition 5 fixes the branching to exactly two retained subintervals per parent and contraction 1/16; Theorems 9 and 13 compute the box and Hausdorff dimensions by direct interval counting and mass-distribution estimates, giving log 2 / log 16 = 1/4. No parameter is fitted to a target dimension, no quantity is 'predicted' from data that already contains it, and the paper contains no citation to the author's own prior work. Remark 16's universality claim is proved by the same structural counting argument rather than assumed. The primes enter only as a deterministic rule for which two of the sixteen subintervals are kept; the dimension depends only on the number kept and the contraction factor, and the proof demonstrates this dependence explicitly. The numerical slip in Lemma 12 at '16^n δ + 3 ≤ 4·16^n δ' is a proof gap, not a circular step: the intended measure-decay estimate is a genuine property of the constructed measure, not a restatement of the target dimension. The same applies to the box-counting lower bound: it relies on the separation of retained intervals, which is a geometric fact about the construction, not an imported uniqueness theorem or a definitional shortcut. Thus the central claim has independent mathematical content and does not reduce to its inputs.

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

No fitted parameters: the modulus 16 and branching number 2 are design choices for the construction, not numbers adjusted to match a target, and the universality result (Remark 16) shows any residue sequence gives the same dimension. All axioms are standard mathematical results from measure theory, dimension theory, and analytic number theory. PF itself is constructed explicitly from the residue sequence; it is a concrete subset of [0,1], not a postulated entity requiring independent evidence. The uniform separation condition needed for the Moran-type dimension computation is verified internally in Lemma 6 rather than assumed, though that proof contains an arithmetic slip.

assumptions (5)
  • standard math Cantor's intersection theorem: nested non-empty compact sets have non-empty intersection
    Used in Theorem 7 to prove PF is non-empty and compact.
  • standard math Kolmogorov extension theorem: a consistent family of finite-dimensional measures extends to a Borel measure
    Used after Lemma 11 to define the mass distribution mu on PF.
  • standard math Mass distribution principle (Frostman's lemma): if mu(B(x,r)) <= C r^s then dim_H F >= s
    Used in Theorem 13 for the lower bound dim_H PF >= 1/4.
  • standard math Dirichlet's theorem: primes are equidistributed among odd residue classes modulo 16 (each class gets proportion 1/8)
    Used only in Theorem 15, Section 5, to describe the residue statistics; it plays no role in the dimension theorems.
  • standard math Countable ambiguity of non-terminating hexadecimal expansions does not affect measure or dimension
    Invoked in Theorem 8 to handle points with two hexadecimal expansions.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Deterministic Fractal Set Derived from the Sequence of Prime Numbers." pith.science (2026). https://pith.science/paper/K6HPRPR7

@misc{pith2026260300658,
  author       = {Pith},
  title        = {Pith review of: A Deterministic Fractal Set Derived from the Sequence of Prime Numbers},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/K6HPRPR7}},
  note         = {Machine review of arXiv:2603.00658}
}
read the original abstract

We introduce a novel deterministic fractal set PF in the unit interval whose construction is driven by the sequence of prime numbers modulo 16. At each step of the recursive construction, two subintervals are retained based on the residues of consecutive primes, yielding a Cantor-like set with a uniform contraction ratio of 1/16 and a branching number of 2. We prove that PF is a non-empty, compact, nowhere dense set of Lebesgue measure zero. Its Hausdorff dimension and box-counting dimension are both equal to 1 4 . The dimension is universal in the sense that it does not depend on the specific choice of the residue sequence, but only on the branching number and the contraction ratio. A generalization to arbitrary bases and branching numbers is also provided. This construction establishes a rigorous link between number theory and fractal geometry, offering a deterministic fractal whose structure is entirely encoded by the distribution of primes.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

5 extracted references

  1. [1]

    K. J. Falconer,Fractal Geometry: Mathematical Foundations and Applications, 3rd ed., Wiley, 2014

  2. [2]

    Mattila,Geometry of Sets and Measures in Euclidean Spaces, Cambridge Univ

    P. Mattila,Geometry of Sets and Measures in Euclidean Spaces, Cambridge Univ. Press, 1995

  3. [3]

    G. H. Hardy and E. M. Wright,An Introduction to the Theory of Numbers, 6th ed., Oxford Univ. Press, 2008

  4. [4]

    Kahane and R

    J.-P. Kahane and R. Salem,Ensembles parfaits et s´ eries trigonom´ etriques, Hermann, 1963

  5. [5]

    Pesin,Dimension Theory in Dynamical Systems, Univ

    Y. Pesin,Dimension Theory in Dynamical Systems, Univ. Chicago Press, 1997. Author’s note:This manuscript presents a purely mathematical construction. Any physical interpretations (e.g., connections with information theory or quantum gravity) are beyond the scope of the present paper and may be discussed elsewhere. Email address:lqint@coc.edu.rs

Pith tools

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