1. Introduction
 A fruitful line of study relates analytic regularity conditions of a continuous function 
 $f\,:\,I\rightarrow \mathbb{R}$
 to geometric regularity properties of its graph
$f\,:\,I\rightarrow \mathbb{R}$
 to geometric regularity properties of its graph 
 $\mathrm{Gr}({\kern2pt}f)\,:\!=\,\{(t,f(t))\subset \mathbb{R}^2\,:\, t\in I \}$
. For instance, it is natural to inquire how regularity hypotheses on f influence measures for the ‘fractality’ of
$\mathrm{Gr}({\kern2pt}f)\,:\!=\,\{(t,f(t))\subset \mathbb{R}^2\,:\, t\in I \}$
. For instance, it is natural to inquire how regularity hypotheses on f influence measures for the ‘fractality’ of 
 $\mathrm{Gr}({\kern2pt}f)$
, such as the values of various metrically defined notions of dimension.
$\mathrm{Gr}({\kern2pt}f)$
, such as the values of various metrically defined notions of dimension.
 Notable examples in this regard are the continuous and nowhere differentiable functions of Weierstrass and Takagi. Given 
 $a\in (0,1)$
 and
$a\in (0,1)$
 and 
 $b\in (1/a,\infty)$
 we define the Weierstrass functions
$b\in (1/a,\infty)$
 we define the Weierstrass functions
 \begin{align*} {}W_{a,b}(t)\,:\!=\,\sum_{n=0}^{\infty} a^n \cos (b^n t), \qquad 0 \le t \le 1, {}\end{align*}
\begin{align*} {}W_{a,b}(t)\,:\!=\,\sum_{n=0}^{\infty} a^n \cos (b^n t), \qquad 0 \le t \le 1, {}\end{align*}
and the Takagi functions
 \begin{align*} {}T_{a,b}(t)=\sum_{n=0}^{\infty}a^n D(b^n t), \qquad 0 \le t \le 1, {}\end{align*}
\begin{align*} {}T_{a,b}(t)=\sum_{n=0}^{\infty}a^n D(b^n t), \qquad 0 \le t \le 1, {}\end{align*}
where D is the 1-periodic sawtooth function with 
 $D(t)=t$
 for all
$D(t)=t$
 for all 
 $t\in [0,1/2]$
 and
$t\in [0,1/2]$
 and 
 $D(t)=1-t$
 for all
$D(t)=1-t$
 for all 
 $t\in [1/2,1]$
. The graphs of these functions have seen sustained attention by the fractal geometry community for many years. For instance, a longstanding program of research focuses on the determination of metric dimensions of the graphs of the Weierstrass functions. While the upper box dimension of
$t\in [1/2,1]$
. The graphs of these functions have seen sustained attention by the fractal geometry community for many years. For instance, a longstanding program of research focuses on the determination of metric dimensions of the graphs of the Weierstrass functions. While the upper box dimension of 
 $\mathrm{Gr}(W_{a,b})$
 has been known since the early 20th century (see [Reference Hardy11]), its Hausdorff dimension was not conclusively determined until 2018 by Shen [Reference Shen14].
$\mathrm{Gr}(W_{a,b})$
 has been known since the early 20th century (see [Reference Hardy11]), its Hausdorff dimension was not conclusively determined until 2018 by Shen [Reference Shen14].
 The notions of dimension which we focus on in this paper are the Assouad dimension 
 $\dim_A$
, introduced by Assouad in [Reference Assouad2] under a different name, as well as the Assouad spectrum
$\dim_A$
, introduced by Assouad in [Reference Assouad2] under a different name, as well as the Assouad spectrum 
 $\dim_A^\theta$
 (and its regularisation
$\dim_A^\theta$
 (and its regularisation 
 $\dim_{A,reg}^\theta$
), introduced by Fraser and Yu [Reference Fraser and Yu10]. These notions of dimension quantify the covering properties of a given set or space at all locations and scales, with respect to a smaller scale which may or may not be quantitatively related to the larger scale. Precise definitions are recalled in section 2.
$\dim_{A,reg}^\theta$
), introduced by Fraser and Yu [Reference Fraser and Yu10]. These notions of dimension quantify the covering properties of a given set or space at all locations and scales, with respect to a smaller scale which may or may not be quantitatively related to the larger scale. Precise definitions are recalled in section 2.
The exact value of the Assouad dimension for the graphs of Weierstrass and Takagi functions was posed as a question by Fraser [Reference Fraser8, question 17·11·1] and remains open. It is worth noting that while there are (to the best of our knowledge) no known partial results for the Weierstrass function, partial results and bounds on the Assouad dimension of the graphs of some Takagi functions were proved by Yu [Reference Yu15] and Anttila, Bárány and Käenmäki [Reference Anttila, Bárány and Käenmäki1].
 In an effort to shed new light on this subject, we study how Hölder conditions on a function f influence bounds for the Assouad spectra of 
 $\mathrm{Gr}({\kern2pt}f)$
. Our main contributions are summarized in the following two theorems.
$\mathrm{Gr}({\kern2pt}f)$
. Our main contributions are summarized in the following two theorems.
Theorem 1·1. Let 
 $I \subset \mathbb{R}$
 be a closed interval and let
$I \subset \mathbb{R}$
 be a closed interval and let 
 $f\,:\,I\rightarrow \mathbb{R}$
 be an
$f\,:\,I\rightarrow \mathbb{R}$
 be an 
 $\alpha$
-Hölder continuous function. Then
$\alpha$
-Hölder continuous function. Then 
 \begin{equation} {}\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}f) \leq \frac{2-\alpha-\theta}{1-\theta},\end{equation}
\begin{equation} {}\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}f) \leq \frac{2-\alpha-\theta}{1-\theta},\end{equation}
for all 
 $\theta \in (0,\alpha)$
.
$\theta \in (0,\alpha)$
.
 Note that when 
 $\theta = \alpha$
, the upper bound in (1·1) reaches 2 and hence provides no nontrivial information. In fact, for values of
$\theta = \alpha$
, the upper bound in (1·1) reaches 2 and hence provides no nontrivial information. In fact, for values of 
 $\theta \in (0,\alpha)$
 the upper bound in (1·1) is sharp in the following sense:
$\theta \in (0,\alpha)$
 the upper bound in (1·1) is sharp in the following sense:
Theorem 1·2. For every 
 $\alpha\in (0,1)$
 there exists an
$\alpha\in (0,1)$
 there exists an 
 $\alpha$
-Hölder continuous function
$\alpha$
-Hölder continuous function 
 ${\tilde{f}}={\tilde{f}}_{\alpha}:[0,1]\rightarrow\mathbb{R}$
 with
${\tilde{f}}={\tilde{f}}_{\alpha}:[0,1]\rightarrow\mathbb{R}$
 with 
 \begin{equation} {} {} {}\dim_A^\theta \mathrm{Gr}({\kern2pt}{\tilde{f}})=\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}{\tilde{f}}) = \frac{2-\alpha-\theta}{1-\theta},\end{equation}
\begin{equation} {} {} {}\dim_A^\theta \mathrm{Gr}({\kern2pt}{\tilde{f}})=\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}{\tilde{f}}) = \frac{2-\alpha-\theta}{1-\theta},\end{equation}
for all 
 $\theta\in (0,\alpha)$
.
$\theta\in (0,\alpha)$
.
 Recall (see e.g. [Reference Fraser8, lemma 3·4·4]) that the Assouad spectrum 
 $\dim_A^\theta(E)$
 tends to the upper box dimension
$\dim_A^\theta(E)$
 tends to the upper box dimension 
 $\overline{\dim}_B(E)$
 as
$\overline{\dim}_B(E)$
 as 
 $\theta\searrow 0$
, for any set
$\theta\searrow 0$
, for any set 
 $E \subset \mathbb{R}^n$
. Letting
$E \subset \mathbb{R}^n$
. Letting 
 $\theta \searrow 0$
 in Theorems 1·1 and 1·2, we recover the (known) sharp upper estimate
$\theta \searrow 0$
 in Theorems 1·1 and 1·2, we recover the (known) sharp upper estimate 
 $2-\alpha$
 for the box-counting dimension of an arbitrary
$2-\alpha$
 for the box-counting dimension of an arbitrary 
 $\alpha$
-Hölder continuous function
$\alpha$
-Hölder continuous function 
 $f\,:\,I \to \mathbb{R}$
. See, for instance, [Reference Falconer6, chapter 11].
$f\,:\,I \to \mathbb{R}$
. See, for instance, [Reference Falconer6, chapter 11].
Not only is the proof of Theorem 1·2 constructive, but it provides a geometric algorithm that modifies the Assouad spectrum of the graph of an appropriate function — such as a Weierstrass or Takagi function — while leaving the upper box dimension intact. This feature is worth emphasising, since the algorithm involves countably many modifications to the graph and the upper box dimension is not countably stable in general. We believe that this method is of independent interest with potential applications to the study of other fractal sets. The key property which the algorithm seeks to ensure for the modified graph is that it lies for a uniformly sufficient amount of ‘time’ within a predetermined sequence of squares. Such a property can be exploited to numerically estimate the extent to which the graph of a given function, e.g., a Weierstrass function, deviates from satisfying (1·2), or from having Assouad dimension equal to 2.
 We also consider functions in the Sobolev class 
 $W^{1,p}$
 for
$W^{1,p}$
 for 
 $1 \le p \le \infty$
. For a closed interval I, recall that
$1 \le p \le \infty$
. For a closed interval I, recall that 
 $f \in W^{1,p}(I)$
 if f’ exists weakly as a function and
$f \in W^{1,p}(I)$
 if f’ exists weakly as a function and 
 $f,f' \in L^p(I)$
. Since we are only interested in continuous functions f we drop the integrability condition on f. We have
$f,f' \in L^p(I)$
. Since we are only interested in continuous functions f we drop the integrability condition on f. We have 
 \begin{align*} {}W^{1,\infty} \subset W^{1,q} \subset W^{1,p} \subset W^{1,1} \subset \mathrm{BV}, \qquad p \lt q, {}\end{align*}
\begin{align*} {}W^{1,\infty} \subset W^{1,q} \subset W^{1,p} \subset W^{1,1} \subset \mathrm{BV}, \qquad p \lt q, {}\end{align*}
where 
 $\mathrm{BV}(I)$
 denotes the space of functions of bounded variation on I. The space of continuous representatives of functions in
$\mathrm{BV}(I)$
 denotes the space of functions of bounded variation on I. The space of continuous representatives of functions in 
 $W^{1,\infty}(I)$
 coincides with the space of bounded Lipschitz functions on I. An elementary estimate using the Fundamental Theorem of Calculus and Hölder’s inequality shows that
$W^{1,\infty}(I)$
 coincides with the space of bounded Lipschitz functions on I. An elementary estimate using the Fundamental Theorem of Calculus and Hölder’s inequality shows that 
 $W^{1,p}$
 functions are
$W^{1,p}$
 functions are 
 $\alpha$
-Hölder continuous with
$\alpha$
-Hölder continuous with 
 $\alpha = 1-1/p$
. An application of Theorem 1·1 then gives
$\alpha = 1-1/p$
. An application of Theorem 1·1 then gives 
 \begin{equation}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le 1 + \frac{1}{(1-\theta)p}. {}\end{equation}
\begin{equation}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le 1 + \frac{1}{(1-\theta)p}. {}\end{equation}
On the other hand, the upper box dimension 
 $\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f))$
 is equal to one for any BV function
$\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f))$
 is equal to one for any BV function 
 $f\,:\,I \to \mathbb{R}$
; see Theorem 4·1. By a standard estimate for the Assouad spectrum [Reference Fraser8, lemma 3·4·4], we always have the bound
$f\,:\,I \to \mathbb{R}$
; see Theorem 4·1. By a standard estimate for the Assouad spectrum [Reference Fraser8, lemma 3·4·4], we always have the bound 
 \begin{equation}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le \frac{\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f))}{1-\theta} = 1 + \frac{\theta}{1-\theta} {}\end{equation}
\begin{equation}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le \frac{\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f))}{1-\theta} = 1 + \frac{\theta}{1-\theta} {}\end{equation}
for any BV function f and any 
 $0 \lt \theta \lt 1$
.
$0 \lt \theta \lt 1$
.
 Our next result provides an upper bound for 
 $\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f))$
 in the case when
$\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f))$
 in the case when 
 $f \in W^{1,p}(I)$
, which improves on both (1·3) and (1·4).
$f \in W^{1,p}(I)$
, which improves on both (1·3) and (1·4).
Theorem 1·3· Let 
 $f \in W^{1,p}(I)$
,
$f \in W^{1,p}(I)$
, 
 $1\le p\le\infty$
, be a continuous, real-valued function defined on an interval
$1\le p\le\infty$
, be a continuous, real-valued function defined on an interval 
 $I \subset \mathbb{R}$
· Then
$I \subset \mathbb{R}$
· Then 
 \begin{equation} {}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le 1 + \frac{\theta}{(1-\theta)p}.\end{equation}
\begin{equation} {}\dim_{A,reg}^\theta\mathrm{Gr}({\kern2pt}f) \le 1 + \frac{\theta}{(1-\theta)p}.\end{equation}
for all 
 $0 \lt \theta \lt {p}/(p+1)$
.
$0 \lt \theta \lt {p}/(p+1)$
.
 As before, observe that the upper bound in (1·5) is only of interest when 
 $\theta \lt p/(p+1)$
; once
$\theta \lt p/(p+1)$
; once 
 $\theta = p/(p+1)$
 the upper bound reaches
$\theta = p/(p+1)$
 the upper bound reaches 
 $2 = \dim \mathbb{R}^2$
 and the conclusion becomes trivial. For
$2 = \dim \mathbb{R}^2$
 and the conclusion becomes trivial. For 
 $\theta\lt p/(p+1)$
 the conclusion in Theorem 1·3 is sharp.
$\theta\lt p/(p+1)$
 the conclusion in Theorem 1·3 is sharp.
Theorem 1·4. For each 
 $1 \lt p \lt \infty$
, there exists
$1 \lt p \lt \infty$
, there exists 
 $f \in W^{1,p}([0,1])$
 so that
$f \in W^{1,p}([0,1])$
 so that 
 \begin{equation} {}\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) = 1 + \frac{\theta}{(1-\theta)p}\end{equation}
\begin{equation} {}\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) = 1 + \frac{\theta}{(1-\theta)p}\end{equation}
for all 
 $0 \lt \theta \lt p/(p+1)$
.
$0 \lt \theta \lt p/(p+1)$
.
 This paper is organised as follows. section 2 reviews basic notation and terminology, including definitions for the Assouad dimension 
 $\dim_A(E)$
 and Assouad spectrum
$\dim_A(E)$
 and Assouad spectrum 
 $\dim_A^\theta(E)$
 of a set E.
$\dim_A^\theta(E)$
 of a set E.
 Section 3 contains our results on the Assouad spectra of Hölder graphs. In particular, in Subsection 3·2 we present an algorithm for the construction of 
 $\alpha$
-Hölder continuous functions
$\alpha$
-Hölder continuous functions 
 ${\tilde{f}}:I \to \mathbb{R}$
 for which the Assouad spectrum,
${\tilde{f}}:I \to \mathbb{R}$
 for which the Assouad spectrum, 
 $\dim_A^\theta(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
, realises the upper bound in (1·1) for all
$\dim_A^\theta(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
, realises the upper bound in (1·1) for all 
 $\theta$
. Fixing
$\theta$
. Fixing 
 $\alpha\in (0,1)$
 and
$\alpha\in (0,1)$
 and 
 $\theta_0 \in (0,\alpha)$
, the algorithm takes as input an
$\theta_0 \in (0,\alpha)$
, the algorithm takes as input an 
 $\alpha$
-Hölder continuous function f which satisfies a matching lower oscillation condition with the same exponent
$\alpha$
-Hölder continuous function f which satisfies a matching lower oscillation condition with the same exponent 
 $\alpha$
. The graph of f is modified by a sequence of transformations, each of which reflects a selected subgraph across the boundary of a selected square Q. The choice of where to implement these reflections inside of Q depends in a subtle way on the parameter
$\alpha$
. The graph of f is modified by a sequence of transformations, each of which reflects a selected subgraph across the boundary of a selected square Q. The choice of where to implement these reflections inside of Q depends in a subtle way on the parameter 
 $\theta_0$
. The reflections in question are chosen to force the new graph to lie entirely inside the right or left half of squares in the designated sequence while maintaining the Hölder regularity. The output of this algorithm is a new function
$\theta_0$
. The reflections in question are chosen to force the new graph to lie entirely inside the right or left half of squares in the designated sequence while maintaining the Hölder regularity. The output of this algorithm is a new function 
 ${\tilde{f}}$
 whose graph is localised within a sequence of squares, and which consequently (by construction) attains the desired value of
${\tilde{f}}$
 whose graph is localised within a sequence of squares, and which consequently (by construction) attains the desired value of 
 $\dim_A^{\theta_0}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
. However, an elementary observation regarding the behaviour of the covering number for
$\dim_A^{\theta_0}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
. However, an elementary observation regarding the behaviour of the covering number for 
 $\mathrm{Gr}({\kern2pt}{\tilde{f}}) \cap Q$
 with respect to different choices of the smaller scale allows us to promote this conclusion from the single choice
$\mathrm{Gr}({\kern2pt}{\tilde{f}}) \cap Q$
 with respect to different choices of the smaller scale allows us to promote this conclusion from the single choice 
 $\theta = \theta_0$
 to the full range of Assouad spectra
$\theta = \theta_0$
 to the full range of Assouad spectra 
 $\dim_A^{\theta}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
 for all
$\dim_A^{\theta}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))$
 for all 
 $\theta\in (0,\alpha)$
. We explore the question of lower bounds for the Assouad spectrum further in Subsection 3·3, where we identify related (but weaker) lower oscillation and graph localization conditions which ensure the validity of other lower bounds on the Assouad spectrum.
$\theta\in (0,\alpha)$
. We explore the question of lower bounds for the Assouad spectrum further in Subsection 3·3, where we identify related (but weaker) lower oscillation and graph localization conditions which ensure the validity of other lower bounds on the Assouad spectrum.
 In section 4 we turn to the study of graphs of Sobolev functions. After some preliminary comments about box-counting dimensions of Sobolev and BV graphs, we prove Theorems 1·3 and 1·4. The construction of a Sobolev graph which realizes the upper bound in (1·5) is considerably easier than the previous algorithmic construction of a Hölder extremal function. A suitably chosen piecewise linear graph, oscillating infinitely often between the graphs of 
 $y=x$
 and
$y=x$
 and 
 $y=-x$
 and converging to the origin, realizes the desired dimensional value.
$y=-x$
 and converging to the origin, realizes the desired dimensional value.
2. Background
 We first establish notation which will be in use throughout the paper. For 
 $x\in \mathbb{R}$
, denote by
$x\in \mathbb{R}$
, denote by 
 $\lceil x \rceil$
 the ceiling function of x, i.e. the smallest integer larger than or equal to x. Similarly, we denote by
$\lceil x \rceil$
 the ceiling function of x, i.e. the smallest integer larger than or equal to x. Similarly, we denote by 
 $\lfloor x\rfloor$
 the floor function of x, i.e. the largest integer smaller than or equal to x.
$\lfloor x\rfloor$
 the floor function of x, i.e. the largest integer smaller than or equal to x.
 Points in the plane 
 $\mathbb{R}^2$
 will be denoted by
$\mathbb{R}^2$
 will be denoted by 
 ${\mathbf z},{\mathbf w},\ldots$
. We denote by
${\mathbf z},{\mathbf w},\ldots$
. We denote by 
 $Q({\mathbf z},r)$
 the closed axes-oriented square centered at a point
$Q({\mathbf z},r)$
 the closed axes-oriented square centered at a point 
 ${\mathbf z}\in \mathbb{R}^2$
 of side length 2r. For a nonempty set
${\mathbf z}\in \mathbb{R}^2$
 of side length 2r. For a nonempty set 
 $A\subset \mathbb{R}^2$
 we denote by
$A\subset \mathbb{R}^2$
 we denote by 
 $\mathrm{Proj}_x(A)$
 and
$\mathrm{Proj}_x(A)$
 and 
 $\mathrm{Proj}_y(A)$
 the projection of A onto the x-axis and the y-axis, respectively. The complement of a set
$\mathrm{Proj}_y(A)$
 the projection of A onto the x-axis and the y-axis, respectively. The complement of a set 
 $E \subset \mathbb{R}^2$
 is denoted
$E \subset \mathbb{R}^2$
 is denoted 
 $E^\complement \,:\!=\, \mathbb{R}^2 \setminus E$
.
$E^\complement \,:\!=\, \mathbb{R}^2 \setminus E$
.
 For functions A(R,r) and B(R,r) with 
 $0 \lt r\leq R \lt 1$
, we write
$0 \lt r\leq R \lt 1$
, we write 
 $A(R,r)\lesssim B(R,r)$
 if there is a constant
$A(R,r)\lesssim B(R,r)$
 if there is a constant 
 $C\gt0$
 that does not depend on R or r such that
$C\gt0$
 that does not depend on R or r such that 
 $A(R,r)\leq C B(R,r)$
 for all
$A(R,r)\leq C B(R,r)$
 for all 
 $0 \lt r\leq R\lt 1$
.
$0 \lt r\leq R\lt 1$
.
 For a bounded interval 
 $I \subset \mathbb{R}$
 we denote by
$I \subset \mathbb{R}$
 we denote by 
 $|I|$
 its length. Moreover, for a function
$|I|$
 its length. Moreover, for a function 
 $f\,:\,I\rightarrow \mathbb{R}$
, we denote the oscillation of f over J by
$f\,:\,I\rightarrow \mathbb{R}$
, we denote the oscillation of f over J by 
 $\mathrm{osc}({\kern1.5pt}f,J)=\sup\{ |{\kern1.5pt}f(t)-f(s)|: \, t,\, s \in J \}$
 for any interval
$\mathrm{osc}({\kern1.5pt}f,J)=\sup\{ |{\kern1.5pt}f(t)-f(s)|: \, t,\, s \in J \}$
 for any interval 
 $J\subset I$
. We also write
$J\subset I$
. We also write 
 $\mathrm{Gr}({\kern1.5pt}f;J) \,:\!=\, \{ (t,f(t))\,:\, t\in J \}$
 for any interval
$\mathrm{Gr}({\kern1.5pt}f;J) \,:\!=\, \{ (t,f(t))\,:\, t\in J \}$
 for any interval 
 $J\subset I$
.
$J\subset I$
.
 Recall that the Assouad dimension of a set 
 $E\subset \mathbb{R}^2$
 is defined as
$E\subset \mathbb{R}^2$
 is defined as 
 \begin{equation}\dim_A(E) \,:\!=\, \inf \left\{\alpha\gt0 \,:\, {\exists\,C\gt0\mbox{ s.t. } N(D({\mathbf z},R) \cap E,r) \le C (R/r)^{\alpha} \atop \mbox{ for all $0 \lt r\leq R$ and all ${\mathbf z} \in E$}} \right\}, {}\end{equation}
\begin{equation}\dim_A(E) \,:\!=\, \inf \left\{\alpha\gt0 \,:\, {\exists\,C\gt0\mbox{ s.t. } N(D({\mathbf z},R) \cap E,r) \le C (R/r)^{\alpha} \atop \mbox{ for all $0 \lt r\leq R$ and all ${\mathbf z} \in E$}} \right\}, {}\end{equation}
where N(F,r) denotes the least number of sets of diameter at most r needed to cover F. Assouad dimension was introduced (under a different name and with a different definition) by Assouad in [Reference Assouad2]; the formulation here is taken from [Reference Fraser8]. We also recall the notion of Assouad spectrum, introduced by Fraser and Yu [Reference Fraser and Yu10]. It is a one-parameter family of metrically defined dimensions which interpolates between the upper box-counting dimension and the (quasi-)Assouad dimension. Specifically, the Assouad spectrum of a set 
 $E \subset \mathbb{R}^2$
 is a collection of values
$E \subset \mathbb{R}^2$
 is a collection of values 
 \begin{align*} {}\{\dim_A^\theta(E)\,:\,0 \lt \theta \lt 1\}, {}\end{align*}
\begin{align*} {}\{\dim_A^\theta(E)\,:\,0 \lt \theta \lt 1\}, {}\end{align*}
where
 \begin{equation}\dim_{A}^\theta(E) \,:\!=\, \inf \left\{\alpha\gt0 \,:\, {\exists\,C\gt0\mbox{ s.t. } N(D({\mathbf z},R) \cap E,r) \le C (R/r)^{\alpha} \atop \mbox{ for all $0 \lt r= R^{1/\theta}\lt R\lt 1$ and all ${\mathbf z} \in E$}} \right\}. {}\end{equation}
\begin{equation}\dim_{A}^\theta(E) \,:\!=\, \inf \left\{\alpha\gt0 \,:\, {\exists\,C\gt0\mbox{ s.t. } N(D({\mathbf z},R) \cap E,r) \le C (R/r)^{\alpha} \atop \mbox{ for all $0 \lt r= R^{1/\theta}\lt R\lt 1$ and all ${\mathbf z} \in E$}} \right\}. {}\end{equation}
While one could replace R by 
 $r^\theta$
 in (2·2) for simplicity, which we actually implement for arguments in later sections, we prefer to state the definition of the Assouad spectrum in this form to indicate the relation to the Assouad dimension.
$r^\theta$
 in (2·2) for simplicity, which we actually implement for arguments in later sections, we prefer to state the definition of the Assouad spectrum in this form to indicate the relation to the Assouad dimension.
Remark 2·1. Note that the covering number 
 $N(D({\mathbf z},R) \cap E,r)$
 can be replaced by the number of closed (or open) sub-squares of
$N(D({\mathbf z},R) \cap E,r)$
 can be replaced by the number of closed (or open) sub-squares of 
 $Q({\mathbf z},R)$
 of side length r needed to cover
$Q({\mathbf z},R)$
 of side length r needed to cover 
 $Q({\mathbf z},R) \cap E$
 (or the interior of
$Q({\mathbf z},R) \cap E$
 (or the interior of 
 $Q({\mathbf z},R) \cap E$
) without affecting the values of the dimensions
$Q({\mathbf z},R) \cap E$
) without affecting the values of the dimensions 
 $\dim_A(E)$
 and
$\dim_A(E)$
 and 
 $\dim_A^\theta(E)$
 in (2·1) and (2·2), respectively. See, e.g., [Reference Fraser8, pp.3 and 11] and [Reference Chrontsios Garitsis and Tyson5, proposition 2·5]. In later sections, we will alternate between equivalent definitions depending on what is most convenient for each argument.
$\dim_A^\theta(E)$
 in (2·1) and (2·2), respectively. See, e.g., [Reference Fraser8, pp.3 and 11] and [Reference Chrontsios Garitsis and Tyson5, proposition 2·5]. In later sections, we will alternate between equivalent definitions depending on what is most convenient for each argument.
 The map 
 $\theta \mapsto \dim_A^\theta(E)$
 is continuous (even locally Lipschitz) when
$\theta \mapsto \dim_A^\theta(E)$
 is continuous (even locally Lipschitz) when 
 $0 \lt \theta \lt 1$
, and
$0 \lt \theta \lt 1$
, and 
 \begin{align*} {}\dim_A^\theta(E) \to {\overline{\dim_B}}(E) \quad \mbox{as $\theta \to 0$}, \qquad \dim_A^\theta(E) \to \dim_{qA}(E) \quad \mbox{as $\theta \to 1$} \, . {}\end{align*}
\begin{align*} {}\dim_A^\theta(E) \to {\overline{\dim_B}}(E) \quad \mbox{as $\theta \to 0$}, \qquad \dim_A^\theta(E) \to \dim_{qA}(E) \quad \mbox{as $\theta \to 1$} \, . {}\end{align*}
Here 
 ${\overline{\dim_B}}(E)$
 denotes the upper box-counting dimension of E, while
${\overline{\dim_B}}(E)$
 denotes the upper box-counting dimension of E, while 
 $\dim_{qA}(E)$
 denotes the quasi-Assouad dimension of E; the latter is a variant of Assouad dimension introduced by Lü and Xi [Reference Lü and Xi12]. We always have
$\dim_{qA}(E)$
 denotes the quasi-Assouad dimension of E; the latter is a variant of Assouad dimension introduced by Lü and Xi [Reference Lü and Xi12]. We always have 
 $\dim_{qA}(E) \le \dim_A(E)$
, and equality holds in many situations (see [Reference Fraser8, section 3·3] for details).
$\dim_{qA}(E) \le \dim_A(E)$
, and equality holds in many situations (see [Reference Fraser8, section 3·3] for details).
 A slightly modified version of the Assouad spectrum where the relationship 
 $R=r^\theta$
 between the two scales is relaxed to an inequality
$R=r^\theta$
 between the two scales is relaxed to an inequality 
 $R\ge r^\theta$
 leads to the notion of upper Assouad spectrum, denoted
$R\ge r^\theta$
 leads to the notion of upper Assouad spectrum, denoted 
 $\overline{\dim_A^\theta}(E)$
 in the literature: see [Reference Fraser8, section 3·3·2] for more information. The key relationship between the two values (see [Reference Fraser8, theorem 3·3·6]) is that
$\overline{\dim_A^\theta}(E)$
 in the literature: see [Reference Fraser8, section 3·3·2] for more information. The key relationship between the two values (see [Reference Fraser8, theorem 3·3·6]) is that 
 \begin{equation}\overline{\dim_A^\theta}(E) = \sup_{0 \lt \theta' \lt \theta} \dim_A^{\theta'}(E). {}\end{equation}
\begin{equation}\overline{\dim_A^\theta}(E) = \sup_{0 \lt \theta' \lt \theta} \dim_A^{\theta'}(E). {}\end{equation}
The authors have proposed in [Reference Chrontsios Garitsis and Tyson5] the term regularised Assouad spectrum in lieu of upper Assouad spectrum, and the notation 
 $\dim_{A,reg}^\theta(E)$
 in place of
$\dim_{A,reg}^\theta(E)$
 in place of 
 $\overline{\dim_A^\theta}(E)$
; this terminology and notation will be used throughout this paper.
$\overline{\dim_A^\theta}(E)$
; this terminology and notation will be used throughout this paper.
3. Dimensions of Hölder graphs
In this section we prove Theorems 1·1 and 1·2, which provide sharp upper bounds for the Assouad spectra of Hölder graphs.
3.1. Proof of Theorem 1·1
 Set 
 $\beta={2-\alpha-\theta}/{1-\theta}$
 and let
$\beta={2-\alpha-\theta}/{1-\theta}$
 and let 
 ${\mathbf z} \in \mathrm{Gr}({\kern2pt}f)$
 with
${\mathbf z} \in \mathrm{Gr}({\kern2pt}f)$
 with 
 ${\mathbf z}=(t, f(t))$
 and
${\mathbf z}=(t, f(t))$
 and 
 $R\in (0,1)$
,
$R\in (0,1)$
, 
 $\rho\in (0,R^{1/\theta}]$
.
$\rho\in (0,R^{1/\theta}]$
.
 We will prove that there is a constant C, depending only on 
 $\beta$
, such that the minimum number of sets of diameter at most
$\beta$
, such that the minimum number of sets of diameter at most 
 $\rho$
 needed to cover
$\rho$
 needed to cover 
 $D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 does not exceed
$D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 does not exceed 
 $C(R/\rho)^\beta$
, i.e.
$C(R/\rho)^\beta$
, i.e. 
 \begin{align*} {}N\,:\!=\,N(D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f),\rho)\leq C(R/\rho)^\beta. {}\end{align*}
\begin{align*} {}N\,:\!=\,N(D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f),\rho)\leq C(R/\rho)^\beta. {}\end{align*}
This estimate easily implies the desired conclusion. Set 
 $r= \rho/\sqrt{2}$
. We will use essentially disjoint squares of side-length r to cover
$r= \rho/\sqrt{2}$
. We will use essentially disjoint squares of side-length r to cover 
 $D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 and count how many such squares are needed.
$D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 and count how many such squares are needed.
 The projection of 
 $D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 onto the x-axis is included in the interval
$D({\mathbf z},R)\cap \mathrm{Gr}({\kern2pt}f)$
 onto the x-axis is included in the interval 
 $I=[t-R,t+R]$
. We need at most
$I=[t-R,t+R]$
. We need at most 
 $M\,:\!=\,2 \lceil R/r \rceil$
 intervals of the form
$M\,:\!=\,2 \lceil R/r \rceil$
 intervals of the form 
 $I_i=[t-R+ir,t-R+(i+1)r]$
,
$I_i=[t-R+ir,t-R+(i+1)r]$
, 
 $i=0, 1, \dots, M-1$
 to cover I. Split all columns
$i=0, 1, \dots, M-1$
 to cover I. Split all columns 
 $J_i \,:\!=\, I_i \times \mathbb{R}$
 into squares of side-length r. In a given column
$J_i \,:\!=\, I_i \times \mathbb{R}$
 into squares of side-length r. In a given column 
 $J_i$
 there can be at most
$J_i$
 there can be at most 
 $\mathrm{osc}({\kern1.5pt}f,I_i)/r+2$
 such squares intersecting
$\mathrm{osc}({\kern1.5pt}f,I_i)/r+2$
 such squares intersecting 
 $\mathrm{Gr}({\kern2pt}f)$
. Using all the squares in columns
$\mathrm{Gr}({\kern2pt}f)$
. Using all the squares in columns 
 $J_i$
,
$J_i$
, 
 $i=0, 1, \dots M$
, to cover
$i=0, 1, \dots M$
, to cover 
 $D({\mathbf z},R)\cap\mathrm{Gr}({\kern2pt}f)$
, and noting that each of these squares has diameter
$D({\mathbf z},R)\cap\mathrm{Gr}({\kern2pt}f)$
, and noting that each of these squares has diameter 
 $\sqrt{2}r=\rho$
, we deduce that
$\sqrt{2}r=\rho$
, we deduce that 
 \begin{align*} {}N\leq \sum_{i=0}^{M-1}(\mathrm{osc}({\kern1.5pt}f,I_i)/r+2). {}\end{align*}
\begin{align*} {}N\leq \sum_{i=0}^{M-1}(\mathrm{osc}({\kern1.5pt}f,I_i)/r+2). {}\end{align*}
By the 
 $\alpha$
-Hölder continuity of f we know that
$\alpha$
-Hölder continuity of f we know that 
 $\mathrm{osc}({\kern1.5pt}f,I_i)\lesssim r^\alpha$
 which, along with
$\mathrm{osc}({\kern1.5pt}f,I_i)\lesssim r^\alpha$
 which, along with 
 $M\leq 4R/r$
, implies that
$M\leq 4R/r$
, implies that 
 \begin{equation}N\lesssim \sum_{i=0}^{M-1}(r^{\alpha-1}+2)\leq \frac{4R}{r^{2-\alpha}}+\frac{8R}{r} \lesssim \left(\frac{R}{r}\right)^{2-\alpha} R^{\alpha-1}. {}\end{equation}
\begin{equation}N\lesssim \sum_{i=0}^{M-1}(r^{\alpha-1}+2)\leq \frac{4R}{r^{2-\alpha}}+\frac{8R}{r} \lesssim \left(\frac{R}{r}\right)^{2-\alpha} R^{\alpha-1}. {}\end{equation}
Note that the estimate 
 $R/r\leq R/r^{2-\alpha}$
 follows from the restrictions
$R/r\leq R/r^{2-\alpha}$
 follows from the restrictions 
 $r\lt 1$
 and
$r\lt 1$
 and 
 $1-\alpha \gt 0$
.
$1-\alpha \gt 0$
.
 Recalling that the choice of 
 $\rho=\sqrt{2}r\leq R^{1/\theta}$
 was arbitrary, we conclude that
$\rho=\sqrt{2}r\leq R^{1/\theta}$
 was arbitrary, we conclude that 
 \begin{equation}R^{-1/\theta}\lesssim \frac{1}{r}. {}\end{equation}
\begin{equation}R^{-1/\theta}\lesssim \frac{1}{r}. {}\end{equation}
Multiplying both sides of (3·2) by R and raising to the (positive) power of 
 $1-\alpha$
 yields
$1-\alpha$
 yields 
 \begin{align*} {}R^{(1-\alpha)(1-1/\theta)}\lesssim \left(\frac{R}{r}\right)^{1-\alpha}. {}\end{align*}
\begin{align*} {}R^{(1-\alpha)(1-1/\theta)}\lesssim \left(\frac{R}{r}\right)^{1-\alpha}. {}\end{align*}
Since 
 $R\lt 1$
,
$R\lt 1$
, 
 $\theta\in (0,1)$
, and
$\theta\in (0,1)$
, and 
 $1-1/\theta=(\theta-1)/\theta \lt 0$
, the above implies that
$1-1/\theta=(\theta-1)/\theta \lt 0$
, the above implies that 
 \begin{align*} {}R^{\alpha-1}\lesssim \left(\frac{R}{r}\right)^\frac{(1-\alpha)\theta}{1-\theta} {}\end{align*}
\begin{align*} {}R^{\alpha-1}\lesssim \left(\frac{R}{r}\right)^\frac{(1-\alpha)\theta}{1-\theta} {}\end{align*}
Combining this with (3·1) yields
 \begin{align*} {}N\leq \left(\frac{R}{r}\right)^{\frac{(1-\alpha)\theta}{1-\theta}+2-\alpha} = \left( \frac{R}{r} \right)^\beta, {}\end{align*}
\begin{align*} {}N\leq \left(\frac{R}{r}\right)^{\frac{(1-\alpha)\theta}{1-\theta}+2-\alpha} = \left( \frac{R}{r} \right)^\beta, {}\end{align*}
since
 \begin{align*} {}\frac{(1-\alpha)\theta}{1-\theta}+2-\alpha= \frac{(1-\alpha)\theta+1-\theta+(1-\alpha)(1-\theta)}{1-\theta}= \beta. {}\end{align*}
\begin{align*} {}\frac{(1-\alpha)\theta}{1-\theta}+2-\alpha= \frac{(1-\alpha)\theta+1-\theta+(1-\alpha)(1-\theta)}{1-\theta}= \beta. {}\end{align*}
Hence 
 $N\lesssim \left({R}/{r}\right)^\beta \lesssim\left({R}/{\rho}\right)^\beta$
 as needed. This concludes the proof of Theorem 1·1.
$N\lesssim \left({R}/{r}\right)^\beta \lesssim\left({R}/{\rho}\right)^\beta$
 as needed. This concludes the proof of Theorem 1·1.
3.2. Proof of Theorem 1·2
 Fix 
 $\alpha\in (0,1)$
 and fix an arbitrary function
$\alpha\in (0,1)$
 and fix an arbitrary function 
 $f\,:\,[0,\, 1]\rightarrow\mathbb{R}$
 for which there are
$f\,:\,[0,\, 1]\rightarrow\mathbb{R}$
 for which there are 
 $C\gt0$
,
$C\gt0$
, 
 $c\gt0$
 and
$c\gt0$
 and 
 $r_0\gt0$
 such that
$r_0\gt0$
 such that 
 \begin{equation}|{\kern1.5pt}f(t)-f(s)|\leq C |t-s|^\alpha {}\end{equation}
\begin{equation}|{\kern1.5pt}f(t)-f(s)|\leq C |t-s|^\alpha {}\end{equation}
for all 
 $t, s \in [0,1]$
 and
$t, s \in [0,1]$
 and 
 \begin{equation}\mathrm{osc}({\kern1.5pt}f,I)\geq c |I|^\alpha {}\end{equation}
\begin{equation}\mathrm{osc}({\kern1.5pt}f,I)\geq c |I|^\alpha {}\end{equation}
for all intervals 
 $I\subset [0,1]$
 with
$I\subset [0,1]$
 with 
 $|I|\leq r_0$
. An example of such a function is the Takagi function
$|I|\leq r_0$
. An example of such a function is the Takagi function 
 $T_{a,2}$
 where
$T_{a,2}$
 where 
 $a\,:\!=\,2^{-\alpha}$
; the
$a\,:\!=\,2^{-\alpha}$
; the 
 $\alpha$
-Hölder continuity is proved in [Reference Barański3, proposition 2·3], while [Reference Barański3, theorem 2·4] asserts the existence of
$\alpha$
-Hölder continuity is proved in [Reference Barański3, proposition 2·3], while [Reference Barański3, theorem 2·4] asserts the existence of 
 $c\gt0$
 such that for all
$c\gt0$
 such that for all 
 $t, s\in (0,1)$
 we have
$t, s\in (0,1)$
 we have 
 $|{\kern1.5pt}f(t)-f(s)|\geq c |t-s|^\alpha$
. The latter condition is a lower Hölder continuity estimate that implies (3·4). Another possible candidate for f is the Weierstrass function
$|{\kern1.5pt}f(t)-f(s)|\geq c |t-s|^\alpha$
. The latter condition is a lower Hölder continuity estimate that implies (3·4). Another possible candidate for f is the Weierstrass function 
 $W_{b^{-\alpha},b}$
 for sufficiently large
$W_{b^{-\alpha},b}$
 for sufficiently large 
 $b\gt1$
; see [Reference Hardy11, theorem 1·31 and theorem 1·32] and [Reference Falconer6, example 11·3] for details.
$b\gt1$
; see [Reference Hardy11, theorem 1·31 and theorem 1·32] and [Reference Falconer6, example 11·3] for details.
 Now fix 
 $\theta_0\in (0,\alpha)$
. We will modify the graph of f on a sequence of squares
$\theta_0\in (0,\alpha)$
. We will modify the graph of f on a sequence of squares 
 $\{Q_k\}_{k\in \mathbb{N}}$
 with decreasing side lengths
$\{Q_k\}_{k\in \mathbb{N}}$
 with decreasing side lengths 
 $r_k^{\theta_0}\searrow 0$
 to obtain the graph of a new function
$r_k^{\theta_0}\searrow 0$
 to obtain the graph of a new function 
 ${\tilde{f}}$
. This modification aims to maximize the least number of sub-squares of
${\tilde{f}}$
. This modification aims to maximize the least number of sub-squares of 
 $Q_k$
 of side length
$Q_k$
 of side length 
 $r_k$
 needed to cover the resulting graph lying in
$r_k$
 needed to cover the resulting graph lying in 
 $Q_k$
, for all
$Q_k$
, for all 
 $k\in \mathbb{N}$
. The output is a new function
$k\in \mathbb{N}$
. The output is a new function 
 ${\tilde{f}}$
 which again satisfies (3·3) and also obtains the desired equality (1·2) for the Assouad spectrum with parameter
${\tilde{f}}$
 which again satisfies (3·3) and also obtains the desired equality (1·2) for the Assouad spectrum with parameter 
 $\theta_0$
. Then, for an arbitrary
$\theta_0$
. Then, for an arbitrary 
 $\theta\in (0,\alpha)$
, a simple choice of scales
$\theta\in (0,\alpha)$
, a simple choice of scales 
 $\tilde{r}_k=r_k^{\theta_0/\theta}$
 shows that the same
$\tilde{r}_k=r_k^{\theta_0/\theta}$
 shows that the same 
 ${\tilde{f}}$
 satisfies the desired equality for
${\tilde{f}}$
 satisfies the desired equality for 
 $\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}f)$
 as well without further modifications.
$\dim_{A,reg}^\theta \mathrm{Gr}({\kern2pt}f)$
 as well without further modifications.
 The lower oscillation estimate (3·4) implies that f is nowhere differentiable, consequently, its local extrema are dense in [0,1]. Let 
 $m_0$
 and
$m_0$
 and 
 $m_1$
 be local maxima of f in the intervals
$m_1$
 be local maxima of f in the intervals 
 $(1/2-\min\{ r_0, 10^{-1} \}/2, 1/2)$
 and
$(1/2-\min\{ r_0, 10^{-1} \}/2, 1/2)$
 and 
 $(1/2, 1/2+\min\{ r_0, 10^{-1} \}/2)$
 respectively. Define
$(1/2, 1/2+\min\{ r_0, 10^{-1} \}/2)$
 respectively. Define 
 \begin{align*} {}\delta(m)\,:\!=\, \sup \{ \rho \gt 0 \,:\, f(x)\lt f(m) \,\,\,\,\, \forall x\in (m-\rho, m+\rho) \}, {}\end{align*}
\begin{align*} {}\delta(m)\,:\!=\, \sup \{ \rho \gt 0 \,:\, f(x)\lt f(m) \,\,\,\,\, \forall x\in (m-\rho, m+\rho) \}, {}\end{align*}
for each maximum 
 $m\in (0,1)$
 of f. Note that
$m\in (0,1)$
 of f. Note that 
 $\min\{\delta(m_0), \delta(m_1)\}\leq \min\{ r_0, 1/10\}$
 by the choice of
$\min\{\delta(m_0), \delta(m_1)\}\leq \min\{ r_0, 1/10\}$
 by the choice of 
 $m_0$
 and
$m_0$
 and 
 $m_1$
.
$m_1$
.
 Without loss of generality assume that 
 $f(m_1)\lt f(m_0)$
, so that
$f(m_1)\lt f(m_0)$
, so that 
 $\delta(m_1)\leq \min\{ r_0, 1/10\}$
 and
$\delta(m_1)\leq \min\{ r_0, 1/10\}$
 and 
 $\mathrm{Gr}({\kern2pt}f)$
 intersects the left side of the square
$\mathrm{Gr}({\kern2pt}f)$
 intersects the left side of the square 
 $Q_1\,:\!=\, Q({\mathbf z}_1, r_1^{\theta_0})$
 at its midpoint
$Q_1\,:\!=\, Q({\mathbf z}_1, r_1^{\theta_0})$
 at its midpoint 
 ${\mathbf z}_1'\,:\!=\, (m_1-r_1^{\theta_0}, f(m_1))$
, where
${\mathbf z}_1'\,:\!=\, (m_1-r_1^{\theta_0}, f(m_1))$
, where 
 ${\mathbf z}_1\,:\!=\,(m_1, f(m_1))$
 and
${\mathbf z}_1\,:\!=\,(m_1, f(m_1))$
 and 
 $r_1\,:\!=\,\delta(m_1)^{1/\theta_0}$
. The proof follows similarly if
$r_1\,:\!=\,\delta(m_1)^{1/\theta_0}$
. The proof follows similarly if 
 $f(m_1)\gt f(m_0)$
. By the choice of
$f(m_1)\gt f(m_0)$
. By the choice of 
 $r_1$
, the graph of f stays below the horizontal line
$r_1$
, the graph of f stays below the horizontal line 
 $y=f(m_1)$
 within the rectangle
$y=f(m_1)$
 within the rectangle 
 \begin{align*} {}R_1\,:\!=\,[m_1-r_1^{\theta_0}, m_1]\times [{\kern1.5pt}f(m_1)-r_1^{\theta_0}, f(m_1)+r_1^{\theta_0}] \subset Q_1. {}\end{align*}
\begin{align*} {}R_1\,:\!=\,[m_1-r_1^{\theta_0}, m_1]\times [{\kern1.5pt}f(m_1)-r_1^{\theta_0}, f(m_1)+r_1^{\theta_0}] \subset Q_1. {}\end{align*}
 We shall modify the graph of f in the strip 
 $(m_1-r_1^{\theta_0},m_1)\times \mathbb{R}$
 and this modification will be the graph of a new function
$(m_1-r_1^{\theta_0},m_1)\times \mathbb{R}$
 and this modification will be the graph of a new function 
 $f_1$
, with the property that
$f_1$
, with the property that 
 $\mathrm{Gr}({\kern1.5pt}f_1;[m_1-r_1^{\theta_0},m_1])$
 lies in
$\mathrm{Gr}({\kern1.5pt}f_1;[m_1-r_1^{\theta_0},m_1])$
 lies in 
 $R_1$
. The square
$R_1$
. The square 
 $Q_1$
 is the first square in the sequence alluded to above. If
$Q_1$
 is the first square in the sequence alluded to above. If 
 $\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}f)\cap R_1)=[m_1-r_1^{\theta_0},m_1]$
, i.e., if the restricted graph
$\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}f)\cap R_1)=[m_1-r_1^{\theta_0},m_1]$
, i.e., if the restricted graph 
 $\mathrm{Gr}({\kern1.5pt}f;\,[m_1-r_1^{\theta_0},m_1])$
 already lies in
$\mathrm{Gr}({\kern1.5pt}f;\,[m_1-r_1^{\theta_0},m_1])$
 already lies in 
 $R_1$
, then we set
$R_1$
, then we set 
 $f_1\,:\!=\,f$
 and we proceed to the choice of
$f_1\,:\!=\,f$
 and we proceed to the choice of 
 $Q_2$
.
$Q_2$
.
 Suppose 
 $\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}f)\cap R_1)\neq [m_1-r_1^{\theta_0},m_1]$
. The idea is to reflect
$\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}f)\cap R_1)\neq [m_1-r_1^{\theta_0},m_1]$
. The idea is to reflect 
 $\mathrm{Gr}({\kern2pt}f)$
 with respect to the lower and upper horizontal sides of
$\mathrm{Gr}({\kern2pt}f)$
 with respect to the lower and upper horizontal sides of 
 $R_1$
 in an alternating fashion until all of the graph between
$R_1$
 in an alternating fashion until all of the graph between 
 $x=m_1-r_1^{\theta_0}$
 and
$x=m_1-r_1^{\theta_0}$
 and 
 $x=m_1$
 has been “folded” inside
$x=m_1$
 has been “folded” inside 
 $R_1$
. More specifically, let
$R_1$
. More specifically, let 
 $x_1'\in(m_1-r_1^{\theta_0},m_1)$
 be the smallest value for which
$x_1'\in(m_1-r_1^{\theta_0},m_1)$
 be the smallest value for which 
 $f(x_1')=f(m_1)-r_1^{\theta_0}$
 and there is
$f(x_1')=f(m_1)-r_1^{\theta_0}$
 and there is 
 $\epsilon_1\gt 0$
 such that
$\epsilon_1\gt 0$
 such that 
 \begin{align*} {}f(x)\geq f(m_1)-r_1^{\theta_0} {}\end{align*}
\begin{align*} {}f(x)\geq f(m_1)-r_1^{\theta_0} {}\end{align*}
for all 
 $x\in (m_1-r_1^{\theta_0}, x_1')$
, and
$x\in (m_1-r_1^{\theta_0}, x_1')$
, and 
 \begin{align*} {}f(x) \lt f(m_1)-r_1^{\theta_0} {}\end{align*}
\begin{align*} {}f(x) \lt f(m_1)-r_1^{\theta_0} {}\end{align*}
for all 
 $x\in (x_1', x_1'+\epsilon_1)$
. In other words, the point
$x\in (x_1', x_1'+\epsilon_1)$
. In other words, the point 
 ${\mathbf w}_1'\,:\!=\,(x_1', f(x_1'))$
 is the first point from
${\mathbf w}_1'\,:\!=\,(x_1', f(x_1'))$
 is the first point from 
 ${\mathbf z}_1'=(m_1-r_1^{\theta_0}, f(m_1))$
 towards
${\mathbf z}_1'=(m_1-r_1^{\theta_0}, f(m_1))$
 towards 
 ${\mathbf z}_1=(m_1, f(m_1))$
 at which the graph of f intersects the lower side of
${\mathbf z}_1=(m_1, f(m_1))$
 at which the graph of f intersects the lower side of 
 $R_1$
 and stays outside
$R_1$
 and stays outside 
 $R_1$
 afterwards within some small strip
$R_1$
 afterwards within some small strip 
 $(x_1', x_1'+\epsilon_1)\times \mathbb{R}$
. Similarly, define
$(x_1', x_1'+\epsilon_1)\times \mathbb{R}$
. Similarly, define 
 ${\mathbf w}_1\,:\!=\, (x_1, f(x_1))$
 to be the last point from
${\mathbf w}_1\,:\!=\, (x_1, f(x_1))$
 to be the last point from 
 ${\mathbf z}_1'$
 towards
${\mathbf z}_1'$
 towards 
 ${\mathbf z}_1$
 where
${\mathbf z}_1$
 where 
 $\mathrm{Gr}({\kern2pt}f)$
 intersects the lower side of
$\mathrm{Gr}({\kern2pt}f)$
 intersects the lower side of 
 $R_1$
 and stays inside
$R_1$
 and stays inside 
 $R_1$
 afterwards within
$R_1$
 afterwards within 
 $(x_1, m_1)$
. See Figure 1.
$(x_1, m_1)$
. See Figure 1.

Figure 1. Choice of 
 ${\mathbf z}_1$
 with x-coordinate lying in the X-axis interval centered at
${\mathbf z}_1$
 with x-coordinate lying in the X-axis interval centered at 
 $1/2$
 of length
$1/2$
 of length 
 $\min\{ r_0, 10^{-1} \}$
.
$\min\{ r_0, 10^{-1} \}$
.
 We reflect 
 $\mathrm{Gr}({\kern1.5pt}f;(x_1',x_1))\cap R_1^\complement$
 with respect to the line
$\mathrm{Gr}({\kern1.5pt}f;(x_1',x_1))\cap R_1^\complement$
 with respect to the line 
 $y=f(m_1)-r_1^{\theta_0}$
. Note that by (3·4), if
$y=f(m_1)-r_1^{\theta_0}$
. Note that by (3·4), if 
 $r_1^{\theta_0}$
 is small enough, it is very likely that the reflected part of the graph will now intersect and exit the upper side of
$r_1^{\theta_0}$
 is small enough, it is very likely that the reflected part of the graph will now intersect and exit the upper side of 
 $R_1$
, since it could be the case that
$R_1$
, since it could be the case that 
 $c(r_1^{\theta_0})^\alpha-r_1^{\theta_0}\gt 2r_1^{\theta_0}$
. In that case, following the same argument but for the upper side of
$c(r_1^{\theta_0})^\alpha-r_1^{\theta_0}\gt 2r_1^{\theta_0}$
. In that case, following the same argument but for the upper side of 
 $R_1$
, we again reflect the part of
$R_1$
, we again reflect the part of 
 $\mathrm{Gr}({\kern2pt}f)$
 that escapes
$\mathrm{Gr}({\kern2pt}f)$
 that escapes 
 $R_1$
 from above, this time with respect to the horizontal line
$R_1$
 from above, this time with respect to the horizontal line 
 $y=f(m_1)+r_1^{\theta_0}$
. Again, it may be the case that the newly reflected part now escapes
$y=f(m_1)+r_1^{\theta_0}$
. Again, it may be the case that the newly reflected part now escapes 
 $R_1$
 from the lower side of
$R_1$
 from the lower side of 
 $R_1$
, in which case we perform yet another reflection with respect to
$R_1$
, in which case we perform yet another reflection with respect to 
 $y=f(m_1)-r_1^{\theta_0}$
. If we denote by
$y=f(m_1)-r_1^{\theta_0}$
. If we denote by 
 $M_1\,:\!=\,\lceil Cr_1^{(\alpha-1){\theta_0}}-2 \rceil$
 the smallest positive integer such that
$M_1\,:\!=\,\lceil Cr_1^{(\alpha-1){\theta_0}}-2 \rceil$
 the smallest positive integer such that 
 $C(r_1^{\theta_0})^\alpha-M_1 r_1^{\theta_0}\leq 2 r_1^{\theta_0}$
, then we are guaranteed that after at most
$C(r_1^{\theta_0})^\alpha-M_1 r_1^{\theta_0}\leq 2 r_1^{\theta_0}$
, then we are guaranteed that after at most 
 $M_1+1$
 reflections, the entire graph of f from
$M_1+1$
 reflections, the entire graph of f from 
 ${\mathbf z}_1'$
 to
${\mathbf z}_1'$
 to 
 ${\mathbf z}_1$
 must lie inside
${\mathbf z}_1$
 must lie inside 
 $R_1$
 (due to the Hölder continuity of f). The preceding process gives rise to the graph of a new continuous function which we denote
$R_1$
 (due to the Hölder continuity of f). The preceding process gives rise to the graph of a new continuous function which we denote 
 $f_1$
. Note that
$f_1$
. Note that 
 $f_1$
 satisfies
$f_1$
 satisfies 
 \begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_1)\cap R_1)= [m_1-r_1^{\theta_0},m_1], {}\end{align*}
\begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_1)\cap R_1)= [m_1-r_1^{\theta_0},m_1], {}\end{align*}
and
 \begin{align*} {}f_1|_{R_1^\complement} = f {}\end{align*}
\begin{align*} {}f_1|_{R_1^\complement} = f {}\end{align*}
 We now pick a second square 
 $Q_2$
 and modify
$Q_2$
 and modify 
 $f_1$
 within
$f_1$
 within 
 $Q_2\cap R_1^\complement$
. By the choice of
$Q_2\cap R_1^\complement$
. By the choice of 
 $r_1^{\theta_0}=\delta(m_1)$
,
$r_1^{\theta_0}=\delta(m_1)$
, 
 $f_1$
 has a global maximum at
$f_1$
 has a global maximum at 
 $m_1$
 within the interval
$m_1$
 within the interval 
 $[m_1, m_1+10^{-1}r_1^{\theta_0}/2]$
. Consequently, if
$[m_1, m_1+10^{-1}r_1^{\theta_0}/2]$
. Consequently, if 
 $m_2$
 is a local maximum of
$m_2$
 is a local maximum of 
 $f_1$
 in
$f_1$
 in 
 $(m_1, m_1 +10^{-1}r_1^{\theta_0}/2)$
, then
$(m_1, m_1 +10^{-1}r_1^{\theta_0}/2)$
, then 
 $r_2^{\theta_0}\,:\!=\, \delta(m_2)\lt 10^{-1} r_1^{\theta_0}$
. Set
$r_2^{\theta_0}\,:\!=\, \delta(m_2)\lt 10^{-1} r_1^{\theta_0}$
. Set 
 $Q_2\,:\!=\, Q({\mathbf z}_2,r_2^{\theta_0})$
. Since
$Q_2\,:\!=\, Q({\mathbf z}_2,r_2^{\theta_0})$
. Since 
 $m_1\lt m_2$
 and
$m_1\lt m_2$
 and 
 $f(m_1)\gt f(m_2)$
,
$f(m_1)\gt f(m_2)$
, 
 $\mathrm{Gr}({\kern1.5pt}f_1)$
 intersects the left side of the rectangle
$\mathrm{Gr}({\kern1.5pt}f_1)$
 intersects the left side of the rectangle 
 \begin{align*} {}R_2\,:\!=\, [m_2-r_2^{\theta_0},m_2]\times [{\kern1.5pt}f(m_2)-r_2^{\theta_0}, f(m_2)+r_2^{\theta_0}] {}\end{align*}
\begin{align*} {}R_2\,:\!=\, [m_2-r_2^{\theta_0},m_2]\times [{\kern1.5pt}f(m_2)-r_2^{\theta_0}, f(m_2)+r_2^{\theta_0}] {}\end{align*}
at its mid point 
 ${\mathbf z}_2'=(m_2-r_2^{\theta_0}, f(m_2))$
. In a similar fashion to the modifications which we performed on f to construct
${\mathbf z}_2'=(m_2-r_2^{\theta_0}, f(m_2))$
. In a similar fashion to the modifications which we performed on f to construct 
 $f_1$
, we perform at most
$f_1$
, we perform at most 
 $M_2+1 \,:\!=\, \lceil Cr_2^{(\alpha-1){\theta_0}}-1 \rceil$
 reflections with respect to the lower and upper sides of
$M_2+1 \,:\!=\, \lceil Cr_2^{(\alpha-1){\theta_0}}-1 \rceil$
 reflections with respect to the lower and upper sides of 
 $R_2$
 to construct the graph of a new continuous function
$R_2$
 to construct the graph of a new continuous function 
 $f_2$
. We conclude that
$f_2$
. We conclude that 
 \begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_2)\cap R_2)=[m_2-r_2^{\theta_0}, m_2], {}\end{align*}
\begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_2)\cap R_2)=[m_2-r_2^{\theta_0}, m_2], {}\end{align*}
 \begin{align*} {}f_2|_{R_1} = f_1, {}\end{align*}
\begin{align*} {}f_2|_{R_1} = f_1, {}\end{align*}
and
 \begin{align*} {}f_2|_{(R_1\cup R_2)^\complement} = f_1 = f. {}\end{align*}
\begin{align*} {}f_2|_{(R_1\cup R_2)^\complement} = f_1 = f. {}\end{align*}
Note that 
 $R_1\cap R_2= \emptyset$
, despite the fact that
$R_1\cap R_2= \emptyset$
, despite the fact that 
 $Q_2\subset Q_1$
. This feature of the construction ensures that modifications taking place within
$Q_2\subset Q_1$
. This feature of the construction ensures that modifications taking place within 
 $R_2$
 do not affect any previous changes made within
$R_2$
 do not affect any previous changes made within 
 $R_1$
.
$R_1$
.
 Assume that we have inductively constructed 
 $Q_k=Q({\mathbf z}_k,r_k^{\theta_0})$
 and
$Q_k=Q({\mathbf z}_k,r_k^{\theta_0})$
 and 
 $f_k$
, where
$f_k$
, where 
 $k\in \mathbb{N}$
,
$k\in \mathbb{N}$
, 
 $k\geq 2$
,
$k\geq 2$
, 
 ${\mathbf z}_k=(m_k, f(m_k))$
,
${\mathbf z}_k=(m_k, f(m_k))$
, 
 $r_k^{\theta_0}= \delta(m_k)\lt 10^{-k+1}r_{k-1}^{\theta_0}$
 and
$r_k^{\theta_0}= \delta(m_k)\lt 10^{-k+1}r_{k-1}^{\theta_0}$
 and 
 \begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_k)\cap R_k)=[m_k-r_k^{\theta_0}, m_k], {}\end{align*}
\begin{align*} {}\mathrm{Proj}_x(\mathrm{Gr}({\kern1.5pt}f_k)\cap R_k)=[m_k-r_k^{\theta_0}, m_k], {}\end{align*}
 \begin{align*} {}f_k|_{R_j} = f_j {}\end{align*}
\begin{align*} {}f_k|_{R_j} = f_j {}\end{align*}
for all positive integers 
 $j\lt k$
, and
$j\lt k$
, and 
 \begin{align*} {}\biggl. f_k\biggr|_{\left( \bigcup_{j=1}^k R_j \right)^\complement} = f. {}\end{align*}
\begin{align*} {}\biggl. f_k\biggr|_{\left( \bigcup_{j=1}^k R_j \right)^\complement} = f. {}\end{align*}
Pick a local maximum 
 $m_{k+1}$
 of
$m_{k+1}$
 of 
 $f_k$
 in
$f_k$
 in 
 $(m_k, m_k+10^{-k}r_k^{\theta_0}/2)$
, set
$(m_k, m_k+10^{-k}r_k^{\theta_0}/2)$
, set 
 $r_{k+1}^{\theta_0}\,:\!=\, \delta(m_{k+1})\lt 10^{-k}r_k^{\theta_0}$
, and perform a similar suite of reflections on the rectangle
$r_{k+1}^{\theta_0}\,:\!=\, \delta(m_{k+1})\lt 10^{-k}r_k^{\theta_0}$
, and perform a similar suite of reflections on the rectangle 
 \begin{align*} {}R_{k+1}\,:\!=\, [m_{k+1}-r_{k+1}^{\theta_0}, m_{k+1}]\times [{\kern1.5pt}f(m_{k+1})-r_{k+1}^{\theta_0}, f(m_{k+1})+r_{k+1}^{\theta_0}] {}\end{align*}
\begin{align*} {}R_{k+1}\,:\!=\, [m_{k+1}-r_{k+1}^{\theta_0}, m_{k+1}]\times [{\kern1.5pt}f(m_{k+1})-r_{k+1}^{\theta_0}, f(m_{k+1})+r_{k+1}^{\theta_0}] {}\end{align*}
to construct the graph of a new continuous function 
 $f_{k+1}$
. Note that
$f_{k+1}$
. Note that 
 $R_{k+1}$
 lies inside the square
$R_{k+1}$
 lies inside the square 
 $Q_{k+1}\,:\!=\, Q({\mathbf z}_{k+1},r_{k+1}^{\theta_0})$
, where
$Q_{k+1}\,:\!=\, Q({\mathbf z}_{k+1},r_{k+1}^{\theta_0})$
, where 
 ${\mathbf z}_{k+1}=(m_{k+1}, f(m_{k+1}))$
. See Figure 2.
${\mathbf z}_{k+1}=(m_{k+1}, f(m_{k+1}))$
. See Figure 2.

Figure 2. Choice of 
 $Q_{k+1}$
 inductively.
$Q_{k+1}$
 inductively.
 We will show that the uniform limit 
 ${\tilde{f}}$
 of the sequence
${\tilde{f}}$
 of the sequence 
 $\{ f_k \}_{k\in \mathbb{N}}$
 satisfies the desired conditions with respect to the sequence of squares
$\{ f_k \}_{k\in \mathbb{N}}$
 satisfies the desired conditions with respect to the sequence of squares 
 $\{ Q_k\}_{k\in \mathbb{N}}$
, and that these conditions ensure that
$\{ Q_k\}_{k\in \mathbb{N}}$
, and that these conditions ensure that 
 $\dim_A^{\theta_0} \mathrm{Gr}({\kern2pt}{\tilde{f}}) \geq {2-\alpha-{\theta_0}}/{1-{\theta_0}}$
. Note that by the choice of
$\dim_A^{\theta_0} \mathrm{Gr}({\kern2pt}{\tilde{f}}) \geq {2-\alpha-{\theta_0}}/{1-{\theta_0}}$
. Note that by the choice of 
 $r_k^{\theta_0}$
, all squares in the sequence lie inside
$r_k^{\theta_0}$
, all squares in the sequence lie inside 
 $Q_1$
, and stay away from the end points of the graph due to the fact that
$Q_1$
, and stay away from the end points of the graph due to the fact that 
 $r_{k+1}^{\theta_0}\lt10^{-k}r_k^{\theta_0}\lt10^{-k}r_1^{\theta_0}$
.
$r_{k+1}^{\theta_0}\lt10^{-k}r_k^{\theta_0}\lt10^{-k}r_1^{\theta_0}$
.
 We first show that 
 ${\tilde{f}}$
 is
${\tilde{f}}$
 is 
 $\alpha$
-Hölder and, more specifically, that
$\alpha$
-Hölder and, more specifically, that 
 \begin{equation}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq 3C |t-s|^\alpha \qquad \mbox{for all $t,s \in [0,1]$,} {}\end{equation}
\begin{equation}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq 3C |t-s|^\alpha \qquad \mbox{for all $t,s \in [0,1]$,} {}\end{equation}
where C is the constant from (3·3).
 Let 
 $t,s\in [0,1]$
 with
$t,s\in [0,1]$
 with 
 $t\lt s$
. If
$t\lt s$
. If 
 ${\tilde{f}}(t)=f(t)$
 and
${\tilde{f}}(t)=f(t)$
 and 
 ${\tilde{f}}(s)=f(s)$
, then (3·5) follows from (3·3) trivially. Suppose
${\tilde{f}}(s)=f(s)$
, then (3·5) follows from (3·3) trivially. Suppose 
 ${\tilde{f}}(t)\ne f(t)$
 and
${\tilde{f}}(t)\ne f(t)$
 and 
 ${\tilde{f}}(s)=f(s)$
. Then
${\tilde{f}}(s)=f(s)$
. Then 
 $t\in \mathrm{Proj}_x(R_k)$
 and
$t\in \mathrm{Proj}_x(R_k)$
 and 
 $f(t)\notin\mathrm{Proj}_y(R_k)$
 for some
$f(t)\notin\mathrm{Proj}_y(R_k)$
 for some 
 $k\in \mathbb{N}$
. Moreover, this integer k is unique due to the disjointness of the rectangles
$k\in \mathbb{N}$
. Moreover, this integer k is unique due to the disjointness of the rectangles 
 $R_k$
. If
$R_k$
. If 
 $(s,f(s))\in R_k$
, then each of the reflections which we perform on
$(s,f(s))\in R_k$
, then each of the reflections which we perform on 
 $\mathrm{Gr}({\kern2pt}f)$
 moves the point
$\mathrm{Gr}({\kern2pt}f)$
 moves the point 
 $(t,f(t))\notin R_k$
 closer to (s,f(s)) when measured along the y-axis, so
$(t,f(t))\notin R_k$
 closer to (s,f(s)) when measured along the y-axis, so 
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(s)|\leq 3C |t-s|^\alpha {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(s)|\leq 3C |t-s|^\alpha {}\end{align*}
by (3·3). Now suppose that 
 $(s, f(s))\notin R_k$
. Then
$(s, f(s))\notin R_k$
. Then 
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|+|{\kern1.5pt}{\tilde{f}}(m_k)-{\tilde{f}}(s)|=|{\kern1.5pt}{\tilde{f}}(t)-f(m_k)|+|{\kern1.5pt}f(m_k)-f(s)|. {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|+|{\kern1.5pt}{\tilde{f}}(m_k)-{\tilde{f}}(s)|=|{\kern1.5pt}{\tilde{f}}(t)-f(m_k)|+|{\kern1.5pt}f(m_k)-f(s)|. {}\end{align*}
However, the point (t, f(t)) gets closer to 
 ${\mathbf z}_k=(m_k, f(m_k))$
 along the y-axis with every reflection, implying that
${\mathbf z}_k=(m_k, f(m_k))$
 along the y-axis with every reflection, implying that 
 $|{\kern1.5pt}{\tilde{f}}(t)-f(m_k)|\leq |{\kern1.5pt}f(t)-f(m_k)|$
. Consequently, the preceding inequality in concert with (3·3) implies that
$|{\kern1.5pt}{\tilde{f}}(t)-f(m_k)|\leq |{\kern1.5pt}f(t)-f(m_k)|$
. Consequently, the preceding inequality in concert with (3·3) implies that 
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(m_k)|+|{\kern1.5pt}f(m_k)-f(s)|\leq C(|t-m_k|^\alpha+|m_k-s|^\alpha)\leq 2C |t-s|^\alpha, {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(m_k)|+|{\kern1.5pt}f(m_k)-f(s)|\leq C(|t-m_k|^\alpha+|m_k-s|^\alpha)\leq 2C |t-s|^\alpha, {}\end{align*}
since 
 $|t-m_k|, |m_k-s| \leq |t-s|$
. Then (3·5) trivially follows in this case as well. See Figure 3. The proof is similar if
$|t-m_k|, |m_k-s| \leq |t-s|$
. Then (3·5) trivially follows in this case as well. See Figure 3. The proof is similar if 
 ${\tilde{f}}(t)=f(t)$
 and
${\tilde{f}}(t)=f(t)$
 and 
 ${\tilde{f}}(s)\neq f(s)$
, with the only difference being that the point
${\tilde{f}}(s)\neq f(s)$
, with the only difference being that the point 
 ${\mathbf z}_k'$
 is used instead of
${\mathbf z}_k'$
 is used instead of 
 ${\mathbf z}_k$
.
${\mathbf z}_k$
.

Figure 3. Showing Hölder condition in case 
 ${\tilde{f}}(t)\neq f(t)$
 and
${\tilde{f}}(t)\neq f(t)$
 and 
 ${\tilde{f}}(s)=f(s)$
, with the two possibilities for (s, f(s)) (lying in
${\tilde{f}}(s)=f(s)$
, with the two possibilities for (s, f(s)) (lying in 
 $R_k$
 or not).
$R_k$
 or not).
 Now suppose that both 
 ${\tilde{f}}(t)\neq f(t)$
 and
${\tilde{f}}(t)\neq f(t)$
 and 
 ${\tilde{f}}(s)\neq f(s)$
. This implies that there are
${\tilde{f}}(s)\neq f(s)$
. This implies that there are 
 $k,\ell \in \mathbb{N}$
 with
$k,\ell \in \mathbb{N}$
 with 
 $k\leq \ell$
 such that
$k\leq \ell$
 such that 
 $(t, {\tilde{f}}(t))\in R_k$
 and
$(t, {\tilde{f}}(t))\in R_k$
 and 
 $(s, {\tilde{f}}(s))\in R_\ell$
. Suppose
$(s, {\tilde{f}}(s))\in R_\ell$
. Suppose 
 $k=\ell$
. If
$k=\ell$
. If 
 $\mathrm{Gr}({\kern1.5pt}f;\,[t,s])$
 never crosses the upper or lower side of
$\mathrm{Gr}({\kern1.5pt}f;\,[t,s])$
 never crosses the upper or lower side of 
 $R_k$
 during any of the at most
$R_k$
 during any of the at most 
 $M_k+1=\lceil Cr_k^{(\alpha-1){\theta_0}}-1 \rceil$
 reflections performed to construct
$M_k+1=\lceil Cr_k^{(\alpha-1){\theta_0}}-1 \rceil$
 reflections performed to construct 
 $f_k$
, then
$f_k$
, then 
 $\mathrm{Gr}({\tilde{f}};[t,s])$
 is isometric to
$\mathrm{Gr}({\tilde{f}};[t,s])$
 is isometric to 
 $\mathrm{Gr}({\kern1.5pt}f;\,[t,s])$
. This implies that
$\mathrm{Gr}({\kern1.5pt}f;\,[t,s])$
. This implies that 
 $|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|=|{\kern1.5pt}f(t)-f(s)|$
 and (3·5) trivially follows from (3·3). For
$|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|=|{\kern1.5pt}f(t)-f(s)|$
 and (3·5) trivially follows from (3·3). For 
 $i\leq M_k+1$
, denote by
$i\leq M_k+1$
, denote by 
 $f_{i,k}$
 the function resulting after i reflections of
$f_{i,k}$
 the function resulting after i reflections of 
 $\mathrm{Gr}({\kern2pt}f)$
 during the construction of
$\mathrm{Gr}({\kern2pt}f)$
 during the construction of 
 $f_k$
 and suppose that some
$f_k$
 and suppose that some 
 $i_0\leq M_k+1$
 is the smallest integer for which
$i_0\leq M_k+1$
 is the smallest integer for which 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,[t,s])$
 intersects the upper or lower side of
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,[t,s])$
 intersects the upper or lower side of 
 $R_k$
. While
$R_k$
. While 
 $ |{\kern1.5pt}f_{i_0,k}(t)- f_{i_0,k}(s)|= |{\kern1.5pt}f(t)-f(s)|$
 due to isometry of the two pieces of graphs, any subsequent reflection would only bring the point of
$ |{\kern1.5pt}f_{i_0,k}(t)- f_{i_0,k}(s)|= |{\kern1.5pt}f(t)-f(s)|$
 due to isometry of the two pieces of graphs, any subsequent reflection would only bring the point of 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k})$
 lying outside
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k})$
 lying outside 
 $R_k$
 closer to the one lying within
$R_k$
 closer to the one lying within 
 $R_k$
. Hence,
$R_k$
. Hence, 
 $|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(s)|\leq 3C |t-s|^\alpha$
 as desired. See Figure 4.
$|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(t)-f(s)|\leq 3C |t-s|^\alpha$
 as desired. See Figure 4.

Figure 4. Showing Hölder condition in case 
 ${\tilde{f}}(t)\neq f(t)$
 and
${\tilde{f}}(t)\neq f(t)$
 and 
 ${\tilde{f}}(s)\neq f(s)$
, with
${\tilde{f}}(s)\neq f(s)$
, with 
 $k=\ell$
, and
$k=\ell$
, and 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,[t,s])$
 intersects the lower side of
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,[t,s])$
 intersects the lower side of 
 $R_k$
 for some minimal
$R_k$
 for some minimal 
 $i_0$
.
$i_0$
.
 Now suppose instead that 
 $k\lt\ell$
, and set
$k\lt\ell$
, and set 
 $m_\ell'=m_\ell-r_\ell^{\theta_0}$
. Then
$m_\ell'=m_\ell-r_\ell^{\theta_0}$
. Then 
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|+|{\kern1.5pt}{\tilde{f}}(m_k)-{\tilde{f}}(m_\ell')|+|{\kern1.5pt}{\tilde{f}}(m_\ell')-{\tilde{f}}(s)|. {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq |{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|+|{\kern1.5pt}{\tilde{f}}(m_k)-{\tilde{f}}(m_\ell')|+|{\kern1.5pt}{\tilde{f}}(m_\ell')-{\tilde{f}}(s)|. {}\end{align*}
Since 
 ${\tilde{f}}(m_k)=f(m_k)$
 and
${\tilde{f}}(m_k)=f(m_k)$
 and 
 ${\tilde{f}}(m_\ell')=f(m_\ell')$
, similarly to the case where
${\tilde{f}}(m_\ell')=f(m_\ell')$
, similarly to the case where 
 ${\tilde{f}}(t)\neq f(t)$
 and
${\tilde{f}}(t)\neq f(t)$
 and 
 ${\tilde{f}}(s)=f(s)$
, it can be shown that
${\tilde{f}}(s)=f(s)$
, it can be shown that 
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|\leq |{\kern1.5pt}f(t)-f(m_k)| {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(m_k)|\leq |{\kern1.5pt}f(t)-f(m_k)| {}\end{align*}
and
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(m_\ell')-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(m_\ell')-f(s)|. {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(m_\ell')-{\tilde{f}}(s)|\leq |{\kern1.5pt}f(m_\ell')-f(s)|. {}\end{align*}
The above inequalities, along with (3·3), imply that
 \begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq C|t-m_k|^\alpha+C|m_k-m_\ell'|^\alpha+C|m_\ell'-s|^\alpha\leq 3C |t-s|^\alpha, {}\end{align*}
\begin{align*} {}|{\kern1.5pt}{\tilde{f}}(t)-{\tilde{f}}(s)|\leq C|t-m_k|^\alpha+C|m_k-m_\ell'|^\alpha+C|m_\ell'-s|^\alpha\leq 3C |t-s|^\alpha, {}\end{align*}
since 
 $|t-m_k|$
,
$|t-m_k|$
, 
 $|m_k-m_\ell'|$
,
$|m_k-m_\ell'|$
, 
 $|m_\ell'-s|$
 are all less than
$|m_\ell'-s|$
 are all less than 
 $|t-s|$
.
$|t-s|$
.
 In conclusion, 
 ${\tilde{f}}$
 is indeed an
${\tilde{f}}$
 is indeed an 
 $\alpha$
-Hölder continuous function, and consequently Theorem 1·1 yields the upper bound
$\alpha$
-Hölder continuous function, and consequently Theorem 1·1 yields the upper bound 
 $\dim_{A,reg}^{\theta}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))\leq{2-\alpha-{\theta}}/{1-{\theta}}$
 for all
$\dim_{A,reg}^{\theta}(\mathrm{Gr}({\kern2pt}{\tilde{f}}))\leq{2-\alpha-{\theta}}/{1-{\theta}}$
 for all 
 $\theta\in (0,\alpha)$
.
$\theta\in (0,\alpha)$
.
 Let 
 $\theta\in (0,\alpha)$
 and
$\theta\in (0,\alpha)$
 and 
 $\tilde{r}_k\,:\!=\,r_k^{\theta_0/\theta}$
 so that
$\tilde{r}_k\,:\!=\,r_k^{\theta_0/\theta}$
 so that 
 $\tilde{r}_k^\theta=r_k^{\theta_0}$
 for all
$\tilde{r}_k^\theta=r_k^{\theta_0}$
 for all 
 $k\in \mathbb{N}$
. This allows us to use the same sequence of squares
$k\in \mathbb{N}$
. This allows us to use the same sequence of squares 
 $\{ Q_k \}$
 we constructed for
$\{ Q_k \}$
 we constructed for 
 $\theta_0$
. In order to show the lower bound
$\theta_0$
. In order to show the lower bound 
 $\dim_A^\theta(\mathrm{Gr}({\kern2pt}{\tilde{f}}))\geq {2-\alpha-\theta}/{1-\theta}$
, it suffices to prove that the number
$\dim_A^\theta(\mathrm{Gr}({\kern2pt}{\tilde{f}}))\geq {2-\alpha-\theta}/{1-\theta}$
, it suffices to prove that the number 
 $N_k$
 of squares of side-length
$N_k$
 of squares of side-length 
 $\tilde{r}_k$
 of the form
$\tilde{r}_k$
 of the form 
 $[t-\tilde{r}_k^\theta+j\tilde{r}_k, t-\tilde{r}_k^\theta + (j+1) \tilde{r}_k] \times [{\tilde{f}}(t)-\tilde{r}_k^\theta+i\tilde{r}_k, {\tilde{f}}(t)-\tilde{r}_k^\theta + (i+1) \tilde{r}_k]$
,
$[t-\tilde{r}_k^\theta+j\tilde{r}_k, t-\tilde{r}_k^\theta + (j+1) \tilde{r}_k] \times [{\tilde{f}}(t)-\tilde{r}_k^\theta+i\tilde{r}_k, {\tilde{f}}(t)-\tilde{r}_k^\theta + (i+1) \tilde{r}_k]$
, 
 $i, j\in \{0, 1, \dots, \lfloor r_k^{\theta-1}-1\rfloor\}$
 needed to cover
$i, j\in \{0, 1, \dots, \lfloor r_k^{\theta-1}-1\rfloor\}$
 needed to cover 
 $R_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}}) \subset Q_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}})$
 is bounded below by a constant multiple of
$R_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}}) \subset Q_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}})$
 is bounded below by a constant multiple of 
 $\tilde{r}_k^{(\theta-1)\frac{2-\alpha-\theta}{1-\theta}}=\tilde{r}_k^{\alpha+\theta-2}$
 for all
$\tilde{r}_k^{(\theta-1)\frac{2-\alpha-\theta}{1-\theta}}=\tilde{r}_k^{\alpha+\theta-2}$
 for all 
 $k\in \mathbb{N}$
. That is because
$k\in \mathbb{N}$
. That is because 
 \begin{align*} {}N_k\leq 9N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),\tilde{r}_k), {}\end{align*}
\begin{align*} {}N_k\leq 9N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),\tilde{r}_k), {}\end{align*}
since any set of diameter at most 
 $\tilde{r}_k$
 cannot intersect more than 9 such squares. The aim is to show for all
$\tilde{r}_k$
 cannot intersect more than 9 such squares. The aim is to show for all 
 $k\in \mathbb{N}$
 a lower bound on the oscillation of
$k\in \mathbb{N}$
 a lower bound on the oscillation of 
 ${\tilde{f}}$
 on the intervals
${\tilde{f}}$
 on the intervals 
 \begin{align*} {}I_j^k\,:\!=\, [m_k-\tilde{r}_k^\theta+j\tilde{r}_k, m_k-\tilde{r}_k^\theta+(j+1)\tilde{r}_k] \subset \mathrm{Proj}_x(R_k), {}\end{align*}
\begin{align*} {}I_j^k\,:\!=\, [m_k-\tilde{r}_k^\theta+j\tilde{r}_k, m_k-\tilde{r}_k^\theta+(j+1)\tilde{r}_k] \subset \mathrm{Proj}_x(R_k), {}\end{align*}
 $j=0, 1, \dots, \lfloor \tilde{r}_k^{\theta-1}-1\rfloor$
, which resembles (3·4). This allows us to use a similar counting argument as in the proof of Theorem 1·1, but this time for the least number of subsquares needed, by counting the ones needed to cover
$j=0, 1, \dots, \lfloor \tilde{r}_k^{\theta-1}-1\rfloor$
, which resembles (3·4). This allows us to use a similar counting argument as in the proof of Theorem 1·1, but this time for the least number of subsquares needed, by counting the ones needed to cover 
 $R_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}})$
. Note the use of
$R_k\cap\mathrm{Gr}({\kern2pt}{\tilde{f}})$
. Note the use of 
 $\lfloor \tilde{r}_k^{\theta-1}-1\rfloor$
 instead of
$\lfloor \tilde{r}_k^{\theta-1}-1\rfloor$
 instead of 
 $\lceil \tilde{r}_k^{\theta-1}-1\rceil$
, which ensures that the interiors of the subsquares of side length
$\lceil \tilde{r}_k^{\theta-1}-1\rceil$
, which ensures that the interiors of the subsquares of side length 
 $\tilde{r}_k$
 that we use lie inside
$\tilde{r}_k$
 that we use lie inside 
 $R_k$
, where
$R_k$
, where 
 $\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}{\tilde{f}})\cap R_k)=[m_k-\tilde{r}_k^\theta, m_k]$
.
$\mathrm{Proj}_x(\mathrm{Gr}({\kern2pt}{\tilde{f}})\cap R_k)=[m_k-\tilde{r}_k^\theta, m_k]$
.
 Fix 
 $k\in \mathbb{N}$
 and set
$k\in \mathbb{N}$
 and set 
 $r\,:\!=\,\tilde{r}_k$
 and
$r\,:\!=\,\tilde{r}_k$
 and 
 $I_j\,:\!=\,I_j^k$
 for all j to simplify the notation. We claim that
$I_j\,:\!=\,I_j^k$
 for all j to simplify the notation. We claim that 
 \begin{equation}\mathrm{osc}({\tilde{f}},I_j)\geq \tilde{c} r^\alpha {}\end{equation}
\begin{equation}\mathrm{osc}({\tilde{f}},I_j)\geq \tilde{c} r^\alpha {}\end{equation}
for all 
 $j=0, 1, \dots, \lfloor r^{\theta-1}-1\rfloor$
, where
$j=0, 1, \dots, \lfloor r^{\theta-1}-1\rfloor$
, where 
 $\tilde{c}=\min\{ 1, c/2 \}$
 and c is the constant from (3·4). Indeed, by construction of
$\tilde{c}=\min\{ 1, c/2 \}$
 and c is the constant from (3·4). Indeed, by construction of 
 ${\tilde{f}}$
, for a given
${\tilde{f}}$
, for a given 
 $I_j$
 the part
$I_j$
 the part 
 $\mathrm{Gr}({\kern1.5pt}f;\,I_j)$
 either never crosses any of the sides of
$\mathrm{Gr}({\kern1.5pt}f;\,I_j)$
 either never crosses any of the sides of 
 $R_k$
 during the
$R_k$
 during the 
 $M_k+1$
 reflections, in which case
$M_k+1$
 reflections, in which case 
 $\mathrm{Gr}({\kern1.5pt}f;\,I_j)$
 is isometric to
$\mathrm{Gr}({\kern1.5pt}f;\,I_j)$
 is isometric to 
 $\mathrm{Gr}({\tilde{f}};\,I_j)$
 and (3·6) trivially follows from (3·4), or there is a minimal integer
$\mathrm{Gr}({\tilde{f}};\,I_j)$
 and (3·6) trivially follows from (3·4), or there is a minimal integer 
 $i_0\in [0, M_k+1)$
 for which
$i_0\in [0, M_k+1)$
 for which 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,I_j)$
 crosses and exits the lower or upper side of
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,I_j)$
 crosses and exits the lower or upper side of 
 $R_k$
. Note that
$R_k$
. Note that 
 \begin{align*} {}\mathrm{osc}({\kern1.5pt}f_{i_0,k},I_j)=\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j)+\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j)\leq 2 \max \{ \mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j),\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j) \}, {}\end{align*}
\begin{align*} {}\mathrm{osc}({\kern1.5pt}f_{i_0,k},I_j)=\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j)+\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j)\leq 2 \max \{ \mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j),\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j) \}, {}\end{align*}
where
 \begin{align*} {}\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j)\,:\!=\,\sup\{ |{\kern1.5pt}f_{i_0,k}(t)-f_{i_0,k}(s)|\,:\, \, \, t,\, s\in I_j \,\, \text{and} \,\, f_{i_0,k}(t),\, f_{i_0,k}(s)\in \mathrm{Proj}_y(R_k) \} {}\end{align*}
\begin{align*} {}\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j)\,:\!=\,\sup\{ |{\kern1.5pt}f_{i_0,k}(t)-f_{i_0,k}(s)|\,:\, \, \, t,\, s\in I_j \,\, \text{and} \,\, f_{i_0,k}(t),\, f_{i_0,k}(s)\in \mathrm{Proj}_y(R_k) \} {}\end{align*}
is the oscillation of 
 $f_{i_0,k}$
 over
$f_{i_0,k}$
 over 
 $I_j$
 inside
$I_j$
 inside 
 $R_k$
 and
$R_k$
 and 
 \begin{align*} {}\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j)\,:\!=\,\sup\{ |{\kern1.5pt}f_{i_0,k}(t)-f_{i_0,k}(s)|\,:\, \, \, t,\, s\in I_j \,\, \text{and} \,\, f_{i_0,k}(t),\, f_{i_0,k}(s)\in \mathrm{Proj}_y(R_k)^\complement \} {}\end{align*}
\begin{align*} {}\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j)\,:\!=\,\sup\{ |{\kern1.5pt}f_{i_0,k}(t)-f_{i_0,k}(s)|\,:\, \, \, t,\, s\in I_j \,\, \text{and} \,\, f_{i_0,k}(t),\, f_{i_0,k}(s)\in \mathrm{Proj}_y(R_k)^\complement \} {}\end{align*}
is the oscillation of 
 $f_{i_0,k}$
 over
$f_{i_0,k}$
 over 
 $I_j$
 outside
$I_j$
 outside 
 $R_k$
. See Figure 5.
$R_k$
. See Figure 5.

Figure 5. The oscillation of 
 $f_{i_0,k}$
 in
$f_{i_0,k}$
 in 
 $I_j$
 after
$I_j$
 after 
 $i_0$
 reflections of
$i_0$
 reflections of 
 $\mathrm{Gr}({\kern2pt}f)$
, intersecting
$\mathrm{Gr}({\kern2pt}f)$
, intersecting 
 $Q_k$
.
$Q_k$
.
 As a result, at least one more reflection is required to construct 
 $f_k$
, during which either the part of
$f_k$
, during which either the part of 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k})$
 oscillating outside
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k})$
 oscillating outside 
 $R_k$
 will be reflected inside
$R_k$
 will be reflected inside 
 $R_k$
 and exit from the opposite side, in which case
$R_k$
 and exit from the opposite side, in which case 
 \begin{equation}\mathrm{osc}({\kern1.5pt}f_k,I_j)=\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0+1,k},I_j)=r^\theta\geq r^\alpha, {}\end{equation}
\begin{equation}\mathrm{osc}({\kern1.5pt}f_k,I_j)=\mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0+1,k},I_j)=r^\theta\geq r^\alpha, {}\end{equation}
or it does not exit 
 $R_k$
, in which case
$R_k$
, in which case 
 \begin{equation}\mathrm{osc}({\kern1.5pt}f_k,I_j)=\max \{ \mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j),\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j) \}\geq \mathrm{osc}({\kern1.5pt}f_{i_0,k},I_j)/2. {}\end{equation}
\begin{equation}\mathrm{osc}({\kern1.5pt}f_k,I_j)=\max \{ \mathrm{osc}_{\text{in}}({\kern1.5pt}f_{i_0,k},I_j),\mathrm{osc}_{\text{out}}({\kern1.5pt}f_{i_0,k},I_j) \}\geq \mathrm{osc}({\kern1.5pt}f_{i_0,k},I_j)/2. {}\end{equation}
However, after 
 $i_0$
 reflections of
$i_0$
 reflections of 
 $\mathrm{Gr}({\kern2pt}f)$
, the part
$\mathrm{Gr}({\kern2pt}f)$
, the part 
 $\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,I_j)$
 stays isometric to
$\mathrm{Gr}({\kern1.5pt}f_{i_0,k};\,I_j)$
 stays isometric to 
 $\mathrm{Gr}({\kern1.5pt}f;I_j)$
, which means that (3·8) implies
$\mathrm{Gr}({\kern1.5pt}f;I_j)$
, which means that (3·8) implies 
 \begin{align*} {}\mathrm{osc}({\kern1.5pt}f_k,I_j)\geq \mathrm{osc}({\kern1.5pt}f,I_j)/2\geq c r^\alpha/2 {}\end{align*}
\begin{align*} {}\mathrm{osc}({\kern1.5pt}f_k,I_j)\geq \mathrm{osc}({\kern1.5pt}f,I_j)/2\geq c r^\alpha/2 {}\end{align*}
by (3·4). Hence, the above inequality and (3·7) imply the desired oscillation condition (3·6) of 
 ${\tilde{f}}$
.
${\tilde{f}}$
.
 We now finish the proof by applying a counting argument similar to that in the proof of Theorem 1·1. Split all columns 
 $J_j \,:\!=\, I_j \times \mathbb{R}$
 into squares of side-length r of the form
$J_j \,:\!=\, I_j \times \mathbb{R}$
 into squares of side-length r of the form 
 $[t-r^\theta+jr, t-r^\theta + (j+1) r] \times [{\tilde{f}}(t)-r^\theta+ir, {\tilde{f}}(t)-r^\theta + (i+1) r]$
,
$[t-r^\theta+jr, t-r^\theta + (j+1) r] \times [{\tilde{f}}(t)-r^\theta+ir, {\tilde{f}}(t)-r^\theta + (i+1) r]$
, 
 $ i\in \mathbb{Z}$
. In a given column
$ i\in \mathbb{Z}$
. In a given column 
 $J_j$
, by construction of
$J_j$
, by construction of 
 ${\tilde{f}}$
, since it is continuous and
${\tilde{f}}$
, since it is continuous and 
 $\mathrm{Gr}({\tilde{f}};\,I_j)\subset Q_k$
 for all j, there will be at least
$\mathrm{Gr}({\tilde{f}};\,I_j)\subset Q_k$
 for all j, there will be at least 
 $ \mathrm{osc}({\tilde{f}},I_j)/r$
 such squares needed to cover
$ \mathrm{osc}({\tilde{f}},I_j)/r$
 such squares needed to cover 
 $R_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}})\subset Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}})$
. Counting all these squares in columns
$R_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}})\subset Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}})$
. Counting all these squares in columns 
 $J_j$
,
$J_j$
, 
 $i=0, 1, \dots \lfloor r^{\theta-1}-1\rfloor$
, we get that
$i=0, 1, \dots \lfloor r^{\theta-1}-1\rfloor$
, we get that 
 \begin{align*} {}N_k \geq \sum_{i=0}^{\lfloor r^{\theta-1}-1\rfloor}\frac{\mathrm{osc}({\tilde{f}},I_i)}{r}. {}\end{align*}
\begin{align*} {}N_k \geq \sum_{i=0}^{\lfloor r^{\theta-1}-1\rfloor}\frac{\mathrm{osc}({\tilde{f}},I_i)}{r}. {}\end{align*}
Note that by (3·6), every term of the sum on the right-hand side above is at least 
 $\tilde{c}r^{\alpha-1}$
. Along with
$\tilde{c}r^{\alpha-1}$
. Along with 
 $\lfloor r^{\theta-1}\rfloor\geq r^{\theta-1}/2$
, the above implies that
$\lfloor r^{\theta-1}\rfloor\geq r^{\theta-1}/2$
, the above implies that 
 \begin{align*} {}r^{\theta-1} r^{\alpha-1} \lesssim N_k. {}\end{align*}
\begin{align*} {}r^{\theta-1} r^{\alpha-1} \lesssim N_k. {}\end{align*}
Hence, by 
 $N_k\leq 9N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),r)$
 we have shown
$N_k\leq 9N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),r)$
 we have shown 
 \begin{align*} {}r^{\alpha+\theta-2}\lesssim N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),r) {}\end{align*}
\begin{align*} {}r^{\alpha+\theta-2}\lesssim N(Q_k\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}),r) {}\end{align*}
for arbitrary 
 $k\in \mathbb{N}$
, as needed to finish the proof. This concludes the proof of Theorem 1·2.
$k\in \mathbb{N}$
, as needed to finish the proof. This concludes the proof of Theorem 1·2.
Remark 3·1. The function 
 ${\tilde{f}}$
 actually depends on the fixed arbitrary
${\tilde{f}}$
 actually depends on the fixed arbitrary 
 $\theta_0\in (0,\alpha)$
 we pick in the beginning of the proof. However, that dependence is of no real importance, since
$\theta_0\in (0,\alpha)$
 we pick in the beginning of the proof. However, that dependence is of no real importance, since 
 ${\tilde{f}}$
 is constructed once and satisfies (1·2) for all
${\tilde{f}}$
 is constructed once and satisfies (1·2) for all 
 $\theta\in (0,\alpha)$
, no matter what
$\theta\in (0,\alpha)$
, no matter what 
 $\theta_0$
 was initially picked.
$\theta_0$
 was initially picked.
Remark 3·2. The above proof in fact shows something stronger than just the indicated statement of Theorem 1·2. Namely, it provides an algorithm that can be applied to any function f satisfying both (3·3) and (3·4) which potentially increases the Assouad spectrum and dimension of its graph. For instance, while certain Takagi functions do not have graphs of full Assouad dimension (for instance 
 $T_{a,2}$
 for
$T_{a,2}$
 for 
 $a\gt 1/2$
, as studied in [Reference Anttila, Bárány and Käenmäki1]), such functions can be modified within countably many squares by following the above process in order to increase the graph’s Assouad spectrum (and also Assouad dimension).
$a\gt 1/2$
, as studied in [Reference Anttila, Bárány and Käenmäki1]), such functions can be modified within countably many squares by following the above process in order to increase the graph’s Assouad spectrum (and also Assouad dimension).
Remark 3·3. By countable stability of the Hausdorff dimension (see [Reference Falconer6, p. 49]) and the construction of 
 ${\tilde{f}}$
, it follows that the Hausdorff dimension of
${\tilde{f}}$
, it follows that the Hausdorff dimension of 
 $\mathrm{Gr}({\kern2pt}{\tilde{f}})$
 coincides with that of
$\mathrm{Gr}({\kern2pt}{\tilde{f}})$
 coincides with that of 
 $\mathrm{Gr}({\kern2pt}f)$
. As a result, the modifications in the proof of Theorem 1·2 can change some notions of dimension (e.g., the Assouad spectrum and dimension) and not others (e.g., the Hausdorff and upper box dimensions).
$\mathrm{Gr}({\kern2pt}f)$
. As a result, the modifications in the proof of Theorem 1·2 can change some notions of dimension (e.g., the Assouad spectrum and dimension) and not others (e.g., the Hausdorff and upper box dimensions).
 Note that, at first glance, the reason why the upper box dimension of the graph does not change after the modifications in the proof of Theorem 1·2 might not be obvious, since the upper box dimension is not countably stable. However, a closer look at what these modifications imply for the covering number 
 $N(D({\mathbf z},1)\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}), r)$
, for arbitrary
$N(D({\mathbf z},1)\cap \mathrm{Gr}({\kern2pt}{\tilde{f}}), r)$
, for arbitrary 
 ${\mathbf z}\in \mathrm{Gr}({\kern2pt}{\tilde{f}})$
 and
${\mathbf z}\in \mathrm{Gr}({\kern2pt}{\tilde{f}})$
 and 
 $r\gt 0$
 reveals the reason. We invite the interested reader to fill in the details.
$r\gt 0$
 reveals the reason. We invite the interested reader to fill in the details.
While Theorems 1·1 and 1·2 do not fully answer the open question [Reference Fraser8, question 17·11·1] that partially motivated this paper (namely, the precise value of the Assouad dimension of the graph of either the Weierstrass or Takagi functions), these theorems in turn raise a new question.
Question 3·4. Do there exist choices of a and b with 
 $a\in(0,1)$
 and
$a\in(0,1)$
 and 
 $b\in (1/a, \infty)$
 such that either
$b\in (1/a, \infty)$
 such that either 
 $\dim_{A,reg}^\theta \mathrm{Gr}(W_{a,b}) = {2+\log_b(a)-\theta}/{1-\theta}$
 or
$\dim_{A,reg}^\theta \mathrm{Gr}(W_{a,b}) = {2+\log_b(a)-\theta}/{1-\theta}$
 or 
 $\dim_{A,reg}^\theta \mathrm{Gr}(T_{a,b}) = {2+\log_b(a)-\theta}/{1-\theta}$
 for all relevant values of
$\dim_{A,reg}^\theta \mathrm{Gr}(T_{a,b}) = {2+\log_b(a)-\theta}/{1-\theta}$
 for all relevant values of 
 $\theta$
?
$\theta$
?
 In the context of Question 3·4, recall that both 
 $W_{a,b}$
 and
$W_{a,b}$
 and 
 $T_{a,b}$
 are
$T_{a,b}$
 are 
 $\alpha$
-Hölder continuous with
$\alpha$
-Hölder continuous with 
 $\alpha = -\log_b(a)$
.
$\alpha = -\log_b(a)$
.
3.3. Lower bounds for the Assouad spectrum of co-Hölder graphs
If the answer to Question 3·4 is negative, then no sequence of decreasing squares can be found which entirely contains the relevant part of the graph. One naturally wonders whether or not it would suffice to have only a sufficiently large part of the graph inside such squares (in order to obtain a nontrivial lower bound on the Assouad spectrum), or, alternatively, whether some flexibility is allowed in the lower Hölder oscillation condition. The following concept quantifies these ideas.
Definition 3·5. Let 
 $f\,:\,I \to \mathbb{R}$
 be defined on an interval
$f\,:\,I \to \mathbb{R}$
 be defined on an interval 
 $I \subset \mathbb{R}$
. Let
$I \subset \mathbb{R}$
. Let 
 $\alpha\in(0,1)$
 and
$\alpha\in(0,1)$
 and 
 $\eta,\epsilon\ge 0$
 with
$\eta,\epsilon\ge 0$
 with 
 $\eta+\epsilon \lt 1 - \alpha$
. We say that f has uniform
$\eta+\epsilon \lt 1 - \alpha$
. We say that f has uniform 
 $\alpha$
-co-Hölder estimates on large subintervals (with parameters
$\alpha$
-co-Hölder estimates on large subintervals (with parameters 
 $\eta$
 and
$\eta$
 and 
 $\epsilon$
) if there exist a constant
$\epsilon$
) if there exist a constant 
 $c\in (0,1)$
 and sequences
$c\in (0,1)$
 and sequences 
 $(R_n)$
,
$(R_n)$
, 
 $R_n\lt 1$
,
$R_n\lt 1$
, 
 $R_n \searrow 0$
, and
$R_n \searrow 0$
, and 
 $({\mathbf z}_n)$
,
$({\mathbf z}_n)$
, 
 ${\mathbf z}_n \in \mathrm{Gr}({\kern2pt}f)$
, so that the following two conditions hold true for the sequence of squares
${\mathbf z}_n \in \mathrm{Gr}({\kern2pt}f)$
, so that the following two conditions hold true for the sequence of squares 
 $(Q_n)$
,
$(Q_n)$
, 
 $Q_n = Q({\mathbf z}_n,R_n)$
:
$Q_n = Q({\mathbf z}_n,R_n)$
:
- 
(i) for each sub-interval  $J \subset \mathrm{Proj}_x(Q_n)$
, $J \subset \mathrm{Proj}_x(Q_n)$
, \begin{align*} {}\mathrm{osc}({\kern1.5pt}f,J) \ge c \, |\mathrm{Proj}_x(Q_n)|^\eta \, |J|^\alpha; {}\end{align*} \begin{align*} {}\mathrm{osc}({\kern1.5pt}f,J) \ge c \, |\mathrm{Proj}_x(Q_n)|^\eta \, |J|^\alpha; {}\end{align*}
- 
(ii) there exist finitely many pair-wise disjoint intervals  $I_k= I_k^n\subset \mathrm{Proj}_x(Q_n\cap \mathrm{Gr}({\kern2pt}f))$
, $I_k= I_k^n\subset \mathrm{Proj}_x(Q_n\cap \mathrm{Gr}({\kern2pt}f))$
, $k=1, \dots, M(n)$
, with $k=1, \dots, M(n)$
, with $\sum_{k=1}^{M(n)}|I_k|\geq c R_n^{1+\epsilon}$
 and (3·9)where $\sum_{k=1}^{M(n)}|I_k|\geq c R_n^{1+\epsilon}$
 and (3·9)where \begin{equation}\min\{|I_k|\,: \, k=1,\dots, M(n) \}\geq c R_n^{1/\theta_0}, {}\end{equation}
(3·10) \begin{equation}\min\{|I_k|\,: \, k=1,\dots, M(n) \}\geq c R_n^{1/\theta_0}, {}\end{equation}
(3·10) \begin{equation}\theta_0=\frac{\alpha}{1-\eta-\epsilon}. {}\end{equation} \begin{equation}\theta_0=\frac{\alpha}{1-\eta-\epsilon}. {}\end{equation}
 Informally, a map f has uniform 
 $\alpha$
-co-Hölder estimates on large subintervals if the domain of f within the x-projection of any square
$\alpha$
-co-Hölder estimates on large subintervals if the domain of f within the x-projection of any square 
 $Q_n$
 is sufficiently large in a quantitative way, and on that domain f expands distances by a fixed power factor, with coefficient which is allowed to decay (in a suitable fashion) in terms of the size of
$Q_n$
 is sufficiently large in a quantitative way, and on that domain f expands distances by a fixed power factor, with coefficient which is allowed to decay (in a suitable fashion) in terms of the size of 
 $Q_n$
. The parameters
$Q_n$
. The parameters 
 $\eta$
 and
$\eta$
 and 
 $\epsilon$
 govern the relative size of the domain of f and the decay rate of the lower Hölder constant.
$\epsilon$
 govern the relative size of the domain of f and the decay rate of the lower Hölder constant.
Remark 3·6. Note that the condition 
 $\sum_{k=1}^{M(n)}|I_k|\geq c R_n^{1+\epsilon}$
 is not truly restrictive, as long as the weaker property
$\sum_{k=1}^{M(n)}|I_k|\geq c R_n^{1+\epsilon}$
 is not truly restrictive, as long as the weaker property 
 $|\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))|\geq c R_n^{1+\epsilon}$
 holds. The reason is we can write the interior of
$|\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))|\geq c R_n^{1+\epsilon}$
 holds. The reason is we can write the interior of 
 $\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))$
 as a countable union of disjoint open intervals
$\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))$
 as a countable union of disjoint open intervals 
 $\cup_{k\in \mathbb{N}} I_k$
 with
$\cup_{k\in \mathbb{N}} I_k$
 with 
 $|I_k|$
 decreasing in k. Then there is finite
$|I_k|$
 decreasing in k. Then there is finite 
 $\tilde{M}\gt 0$
 such that
$\tilde{M}\gt 0$
 such that 
 $\sum_{k=1}^{\tilde{M}} |I_k|\geq |\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))|/2\geq c R_n^{1+\epsilon}/2$
. The critical condition in Definition 3·5 is the existence of such a finite decomposition of
$\sum_{k=1}^{\tilde{M}} |I_k|\geq |\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))|/2\geq c R_n^{1+\epsilon}/2$
. The critical condition in Definition 3·5 is the existence of such a finite decomposition of 
 $\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))$
 with the property that all intervals have length bounded from below by
$\mathrm{Proj}_x (Q_n\cap \mathrm{Gr}({\kern2pt}f))$
 with the property that all intervals have length bounded from below by 
 $R_n^{1/\theta_0}$
.
$R_n^{1/\theta_0}$
.
We now state and prove the main theorem of this subsection.
Theorem 3·7. If f has uniform 
 $\alpha$
-co-Hölder estimates on large subintervals with parameters
$\alpha$
-co-Hölder estimates on large subintervals with parameters 
 $\eta$
,
$\eta$
, 
 $\epsilon$
, then
$\epsilon$
, then 
 \begin{align*}\dim_{A,reg}^{\theta_0}\mathrm{Gr}({\kern2pt}f)=\dim_A\mathrm{Gr}({\kern2pt}f)=2,\end{align*}
\begin{align*}\dim_{A,reg}^{\theta_0}\mathrm{Gr}({\kern2pt}f)=\dim_A\mathrm{Gr}({\kern2pt}f)=2,\end{align*}
where 
 $\theta_0$
 is as in (3·10). Moreover,
$\theta_0$
 is as in (3·10). Moreover, 
 \begin{equation} {}\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) \ge \frac{2-\alpha-(1+\eta+\epsilon)\theta}{1-\theta}\end{equation}
\begin{equation} {}\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) \ge \frac{2-\alpha-(1+\eta+\epsilon)\theta}{1-\theta}\end{equation}
for each 
 $0 \lt \theta\leq\theta_0$
.
$0 \lt \theta\leq\theta_0$
.
 
Proof. Fix 
 $\theta\in (0,\alpha(1-\eta-\epsilon)^{-1}]$
 and
$\theta\in (0,\alpha(1-\eta-\epsilon)^{-1}]$
 and 
 \begin{equation} {}\gamma \lt \frac{2 - \alpha - (1+\eta+\epsilon)\theta}{1-\theta}.\end{equation}
\begin{equation} {}\gamma \lt \frac{2 - \alpha - (1+\eta+\epsilon)\theta}{1-\theta}.\end{equation}
The statements follow if we prove that 
 $\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) \gt \gamma$
.
$\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f)) \gt \gamma$
.
 To this end, let 
 $({\mathbf z}_n)$
,
$({\mathbf z}_n)$
, 
 $(R_n)$
, and
$(R_n)$
, and 
 $(Q_n)$
 be as in Definition 3·5, with
$(Q_n)$
 be as in Definition 3·5, with 
 $R_n \lt 1$
. Fix
$R_n \lt 1$
. Fix 
 $n\in \mathbb{N}$
 and using the intervals
$n\in \mathbb{N}$
 and using the intervals 
 $I_k$
 as in Definition 3·5 set
$I_k$
 as in Definition 3·5 set 
 \begin{align*}r_n\,:\!=\,\min\left\{ R_n^{1/\theta}, \min\{|I_k|\,: \, k=1,\dots, M(n) \} \right\}.\end{align*}
\begin{align*}r_n\,:\!=\,\min\left\{ R_n^{1/\theta}, \min\{|I_k|\,: \, k=1,\dots, M(n) \} \right\}.\end{align*}
Since 
 $R_n\lt 1$
 and
$R_n\lt 1$
 and 
 $\theta\leq \alpha(1-\eta-\epsilon)^{-1}=\theta_0$
, we have that
$\theta\leq \alpha(1-\eta-\epsilon)^{-1}=\theta_0$
, we have that 
 $R_n^{1/\theta}\leq R_n^{1/\theta_0}$
. In view of (3·9) we conclude
$R_n^{1/\theta}\leq R_n^{1/\theta_0}$
. In view of (3·9) we conclude 
 \begin{equation} {}c R_n^{1/\theta}\leq r_n \leq R_n^{1/\theta},\end{equation}
\begin{equation} {}c R_n^{1/\theta}\leq r_n \leq R_n^{1/\theta},\end{equation}
and we use the sequence of scaling pairs 
 $r_n,R_n$
 to show the desired lower bound on the regularised Assouad spectrum of the graph.
$r_n,R_n$
 to show the desired lower bound on the regularised Assouad spectrum of the graph.
 To bound the regularised spectrum below by 
 $\gamma$
, it is enough to show that
$\gamma$
, it is enough to show that 
 \begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f), r_n)\gtrsim\left( \frac{R_n}{r_n} \right)^\gamma.\end{align*}
\begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f), r_n)\gtrsim\left( \frac{R_n}{r_n} \right)^\gamma.\end{align*}
For any 
 $j=1,\ldots, 2\left\lceil R_n/r_n \right\rceil$
, a column of the form
$j=1,\ldots, 2\left\lceil R_n/r_n \right\rceil$
, a column of the form 
 $C_j \,:\!=\, [x_n-R_n+(j-1)r_n, x_n-R_n +jr_n]\times \mathbb{R}$
 might, or might not intersect the graph of f above an interval
$C_j \,:\!=\, [x_n-R_n+(j-1)r_n, x_n-R_n +jr_n]\times \mathbb{R}$
 might, or might not intersect the graph of f above an interval 
 $I_k$
. Consider all of the non-empty intervals obtained as intersections
$I_k$
. Consider all of the non-empty intervals obtained as intersections 
 $C_j \cap I_k$
 for
$C_j \cap I_k$
 for 
 $k=1,\ldots,M(n)$
 and
$k=1,\ldots,M(n)$
 and 
 $j=1,\ldots,2\left\lceil R_n/r_n \right\rceil$
, and let
$j=1,\ldots,2\left\lceil R_n/r_n \right\rceil$
, and let 
 $J_m$
,
$J_m$
, 
 $m = 1,\ldots,N$
, be an enumeration of these intervals, ordered according to the natural order on the x-axis. Given such an interval
$m = 1,\ldots,N$
, be an enumeration of these intervals, ordered according to the natural order on the x-axis. Given such an interval 
 $J_m$
 we define
$J_m$
 we define 
 $j_m$
 and
$j_m$
 and 
 $k_m$
 so that
$k_m$
 so that 
 $J_m = C_{j_m} \cap J_{k_m}$
. Note that
$J_m = C_{j_m} \cap J_{k_m}$
. Note that 
 \begin{align*}\sum_{m=1}^N |J_m| =\sum_{k=1}^{M(n)} |I_k|\geq c R_n^{1+\epsilon};\end{align*}
\begin{align*}\sum_{m=1}^N |J_m| =\sum_{k=1}^{M(n)} |I_k|\geq c R_n^{1+\epsilon};\end{align*}
since 
 $|J_m|\leq r_n$
 we conclude that
$|J_m|\leq r_n$
 we conclude that 
 \begin{equation} {}N\gtrsim \frac{R_n^{1+\epsilon}}{r_n}.\end{equation}
\begin{equation} {}N\gtrsim \frac{R_n^{1+\epsilon}}{r_n}.\end{equation}
Since 
 $r_n \le |I_k|$
 for each k, we deduce that if
$r_n \le |I_k|$
 for each k, we deduce that if 
 $|J_m|\lt r_n/2$
, then either
$|J_m|\lt r_n/2$
, then either 
 $C_{j_m-1}$
 or
$C_{j_m-1}$
 or 
 $C_{j_m+1}$
 intersects
$C_{j_m+1}$
 intersects 
 $I_{k_m}$
 and
$I_{k_m}$
 and 
 \begin{align*}\max\{|J_{m-1}|, |J_{m+1}|\}\geq \frac{r_n}{2},\end{align*}
\begin{align*}\max\{|J_{m-1}|, |J_{m+1}|\}\geq \frac{r_n}{2},\end{align*}
where we adopt the convention that 
 $J_{0}=J_{N+1}=\emptyset$
. The preceding fact implies that the number of intervals
$J_{0}=J_{N+1}=\emptyset$
. The preceding fact implies that the number of intervals 
 $J_m$
 with length at least
$J_m$
 with length at least 
 $r_n/2$
, denoted
$r_n/2$
, denoted 
 $\tilde{N}$
, cannot be less than
$\tilde{N}$
, cannot be less than 
 $N/6$
. Fix the maximal sub-collection of intervals
$N/6$
. Fix the maximal sub-collection of intervals 
 $J_m$
 that have length at least
$J_m$
 that have length at least 
 $r_n/2$
 and relabel them again with index m to ease notation. Then, using only sub-squares of
$r_n/2$
 and relabel them again with index m to ease notation. Then, using only sub-squares of 
 $Q_n$
 of side-length
$Q_n$
 of side-length 
 $r_n$
 that lie over such intervals
$r_n$
 that lie over such intervals 
 $J_m$
,
$J_m$
, 
 $m=1,\dots, \tilde{N}$
, to cover
$m=1,\dots, \tilde{N}$
, to cover 
 $Q_n\cap \mathrm{Gr}({\kern2pt}f)$
, we have that
$Q_n\cap \mathrm{Gr}({\kern2pt}f)$
, we have that 
 \begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f),r_n)\geq \sum_{m=1}^{\tilde{N}} \frac{\mathrm{osc}({\kern1.5pt}f,J_m)}{r_n}\gtrsim \sum_{m=1}^{\tilde{N}} \frac{R_n^\eta |J_m|^\alpha}{r_n}.\end{align*}
\begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f),r_n)\geq \sum_{m=1}^{\tilde{N}} \frac{\mathrm{osc}({\kern1.5pt}f,J_m)}{r_n}\gtrsim \sum_{m=1}^{\tilde{N}} \frac{R_n^\eta |J_m|^\alpha}{r_n}.\end{align*}
But recall that 
 $|J_m|\geq r_n/2$
 and
$|J_m|\geq r_n/2$
 and 
 $\tilde{N}\geq N/6\gtrsim R_n^{1+\epsilon}/r_n$
 by (3·14). Along with the above inequality, these imply that
$\tilde{N}\geq N/6\gtrsim R_n^{1+\epsilon}/r_n$
 by (3·14). Along with the above inequality, these imply that 
 \begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f),r_n)\gtrsim \frac{R_n^{1+\eta+\epsilon}}{r_n^{2-\alpha}}.\end{align*}
\begin{align*}N(Q_n\cap \mathrm{Gr}({\kern2pt}f),r_n)\gtrsim \frac{R_n^{1+\eta+\epsilon}}{r_n^{2-\alpha}}.\end{align*}
To complete the proof we need to show that
 \begin{equation} {}\frac{R_n^{1+\eta+\epsilon}}{r_n^{2-\alpha}}\gtrsim \left( \frac{R_n}{r_n} \right)^\gamma.\end{equation}
\begin{equation} {}\frac{R_n^{1+\eta+\epsilon}}{r_n^{2-\alpha}}\gtrsim \left( \frac{R_n}{r_n} \right)^\gamma.\end{equation}
For sufficiently large n, (3·15) follows from (3·12), (3·13), and the bounds 
 $\theta \le \theta_0$
,
$\theta \le \theta_0$
, 
 $\eta+\epsilon \lt 1-\alpha$
. This completes the proof of Theorem 3·7.
$\eta+\epsilon \lt 1-\alpha$
. This completes the proof of Theorem 3·7.
Remark 3·8.
- 
(i) Suppose f is a function as in Definition 3·5, but with  $\theta_0$
 in (3·9) replaced by some smaller value $\theta_0$
 in (3·9) replaced by some smaller value $\tilde{\theta}\in (0,\theta_0)$
. A closer analysis of the proof of Theorem 3·1 shows that the estimate then holds for all $\tilde{\theta}\in (0,\theta_0)$
. A closer analysis of the proof of Theorem 3·1 shows that the estimate then holds for all \begin{align*} {}\dim_{A,reg}^\theta (\mathrm{Gr}({\kern2pt}f))\ge \frac{2-\alpha-(1+\eta+\epsilon)\theta}{1-\theta} {}\end{align*} \begin{align*} {}\dim_{A,reg}^\theta (\mathrm{Gr}({\kern2pt}f))\ge \frac{2-\alpha-(1+\eta+\epsilon)\theta}{1-\theta} {}\end{align*} $\theta\in (0,\tilde{\theta})$
. $\theta\in (0,\tilde{\theta})$
.
- 
(ii) If f is  $\alpha$
-Hölder and has uniform $\alpha$
-Hölder and has uniform $\alpha$
-co-Hölder estimates on large subintervals with parameters $\alpha$
-co-Hölder estimates on large subintervals with parameters $\eta = \epsilon = 0$
, then the lower bound in (3·11) coincides with the upper bound in Theorem 1·1 and we have a formula for the regularised Assouad spectrum of $\eta = \epsilon = 0$
, then the lower bound in (3·11) coincides with the upper bound in Theorem 1·1 and we have a formula for the regularised Assouad spectrum of $\mathrm{Gr}({\kern2pt}f)$
. This case corresponds to the situation in which f has the lower oscillation estimate (3·4) and a definite proportion of the graph of f over $\mathrm{Gr}({\kern2pt}f)$
. This case corresponds to the situation in which f has the lower oscillation estimate (3·4) and a definite proportion of the graph of f over $\mathrm{Proj}_x(Q_n)$
 lies within $\mathrm{Proj}_x(Q_n)$
 lies within $Q_n$
, when measured with respect to the length measure on $Q_n$
, when measured with respect to the length measure on $\mathrm{Proj}_x(Q_n)$
 in the quantitative way outlined in Definition 3·5. $\mathrm{Proj}_x(Q_n)$
 in the quantitative way outlined in Definition 3·5.
- 
(iii) The restriction  $\eta+\epsilon\lt 1-\alpha$
 implies that the lower bound in (3·11) strictly exceeds $\eta+\epsilon\lt 1-\alpha$
 implies that the lower bound in (3·11) strictly exceeds $2-\alpha$
. If f is also $2-\alpha$
. If f is also $\alpha$
-Hölder, the oscillation condition of Definition 3·5 is enough to ensure that $\alpha$
-Hölder, the oscillation condition of Definition 3·5 is enough to ensure that ${\overline{\dim_B}}\mathrm{Gr}({\kern2pt}f)=2-\alpha$
. In this case, the lower bound on the regularised spectrum of ${\overline{\dim_B}}\mathrm{Gr}({\kern2pt}f)=2-\alpha$
. In this case, the lower bound on the regularised spectrum of $\mathrm{Gr}({\kern2pt}f)$
 is non-trivial (i.e., exceeds the box dimension of $\mathrm{Gr}({\kern2pt}f)$
 is non-trivial (i.e., exceeds the box dimension of $\mathrm{Gr}({\kern2pt}f)$
) for all $\mathrm{Gr}({\kern2pt}f)$
) for all $\theta\gt0$
. $\theta\gt0$
.
- 
(iv) The Takagi functions studied in [Reference Anttila, Bárány and Käenmäki1], namely  $T_{a,2}$
 for $T_{a,2}$
 for $a\gt1/2$
, do not satisfy uniform co-Hölder estimates as in Definition 3·5 with parameters $a\gt1/2$
, do not satisfy uniform co-Hölder estimates as in Definition 3·5 with parameters $\eta$
 and $\eta$
 and $\epsilon$
 such that $\epsilon$
 such that $\eta+\epsilon \lt 1 - \alpha = 1 + \log_2(a)$
. Indeed, if they did, then their graphs would have Assouad dimension equal to 2 by Theorem 3·7, which was shown not to be the case in [Reference Anttila, Bárány and Käenmäki1]. $\eta+\epsilon \lt 1 - \alpha = 1 + \log_2(a)$
. Indeed, if they did, then their graphs would have Assouad dimension equal to 2 by Theorem 3·7, which was shown not to be the case in [Reference Anttila, Bárány and Käenmäki1].
 We emphasise that Remark 3·8(iv) does not prevent other Takagi or Weierstrass functions from satisfying such estimates, and especially for 
 $T_{a,b}$
 with b non-integer. While it is known that there exist choices of a, b and
$T_{a,b}$
 with b non-integer. While it is known that there exist choices of a, b and 
 $\theta$
 for which
$\theta$
 for which 
 ${\overline{\dim_B}} \mathrm{Gr}(T_{a,b})\lt\dim_A^\theta \mathrm{Gr}(T_{a,b})$
 (see [Reference Yu15, Remark 1·2]), the following weaker version of Question 3·4 remains open.
${\overline{\dim_B}} \mathrm{Gr}(T_{a,b})\lt\dim_A^\theta \mathrm{Gr}(T_{a,b})$
 (see [Reference Yu15, Remark 1·2]), the following weaker version of Question 3·4 remains open.
Question 3·9. Does there exist any choice of a and b so that either 
 $T_{a,b}$
 or
$T_{a,b}$
 or 
 $W_{a,b}$
 has graph with (regularised) Assouad spectrum satisfying the lower bound (3·11)?
$W_{a,b}$
 has graph with (regularised) Assouad spectrum satisfying the lower bound (3·11)?
 There are other examples of Hölder functions that could potentially satisfy uniform co-Hölder estimates. Hildebrand and the first author [Reference Chrontsios Garitsis and Hildebrand4] study a class of fractal Fourier series of the form 
 $F(t)\,:\!=\,\sum_{n=1}^\infty {f(n) e^{2\pi i n^k t}}/{n^p}\,:\,[0,1]\rightarrow \mathbb{C}$
 for positive
$F(t)\,:\!=\,\sum_{n=1}^\infty {f(n) e^{2\pi i n^k t}}/{n^p}\,:\,[0,1]\rightarrow \mathbb{C}$
 for positive 
 $p\gt0$
,
$p\gt0$
, 
 $k\in \mathbb{N}$
, where
$k\in \mathbb{N}$
, where 
 $f\,:\,\mathbb{N}\rightarrow \mathbb{C}$
 satisfies a certain exponential sum growth condition. These are Hölder functions whose real and imaginary part have graphs that exhibit fractal behaviour. In fact, Weierstrass functions belong in this class (as the real part of such series) and establish the sharpness of the box dimension bounds proved for the graphs of these fractal Fourier series (see [Reference Chrontsios Garitsis and Hildebrand4]). It is possible that suitable conditions on the coefficients f(n) may yield further examples of graphs satisfying (1·2) or (3·11).
$f\,:\,\mathbb{N}\rightarrow \mathbb{C}$
 satisfies a certain exponential sum growth condition. These are Hölder functions whose real and imaginary part have graphs that exhibit fractal behaviour. In fact, Weierstrass functions belong in this class (as the real part of such series) and establish the sharpness of the box dimension bounds proved for the graphs of these fractal Fourier series (see [Reference Chrontsios Garitsis and Hildebrand4]). It is possible that suitable conditions on the coefficients f(n) may yield further examples of graphs satisfying (1·2) or (3·11).
4. Dimensions of Sobolev graphs
In this section we estimate the Assouad spectra of graphs of Sobolev functions. In particular, we prove Theorems 1·3 and 1·4.
First, we remark that box counting dimensions of graphs of Sobolev (and more generally, BV) functions are well understood. In fact, the following is a known result.
Theorem 4·1. Let 
 $f \in BV(I)$
. Then
$f \in BV(I)$
. Then 
 $\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f)) = 1$
.
$\overline{\dim}_B(\mathrm{Gr}({\kern2pt}f)) = 1$
.
 We sketch a proof of Theorem 4·1.Footnote 
1
 Recall that 
 $f \in \mathrm{BV}(I)$
 if and only if
$f \in \mathrm{BV}(I)$
 if and only if 
 $f=g-h$
 for two monotone functions g and h on I. Thus the first step of the proof of Theorem 4·1 is to show that
$f=g-h$
 for two monotone functions g and h on I. Thus the first step of the proof of Theorem 4·1 is to show that 
 $\overline{\dim}_B(\mathrm{Gr}(g)) = 1$
 for any monotone function
$\overline{\dim}_B(\mathrm{Gr}(g)) = 1$
 for any monotone function 
 $g:I \to \mathbb{R}$
. To see why this is true, observe that a clockwise rotation of
$g:I \to \mathbb{R}$
. To see why this is true, observe that a clockwise rotation of 
 $\mathbb{R}^2$
 by angle
$\mathbb{R}^2$
 by angle 
 $\pi/4$
 exhibits the graph of g as geometrically congruent to the graph of a 1-Lipschitz function h defined on a new interval I’. Since
$\pi/4$
 exhibits the graph of g as geometrically congruent to the graph of a 1-Lipschitz function h defined on a new interval I’. Since 
 $\mathrm{Gr}(h) = H(I')$
 for the function
$\mathrm{Gr}(h) = H(I')$
 for the function 
 $H(x) \,:\!=\, (x,h(x))$
, and H is a bi-Lipschitz embedding of I’ into
$H(x) \,:\!=\, (x,h(x))$
, and H is a bi-Lipschitz embedding of I’ into 
 $\mathbb{R}^2$
, we conclude that
$\mathbb{R}^2$
, we conclude that 
 $\overline{\dim}_B(\mathrm{Gr}(g)) = \overline{\dim}_B(\mathrm{Gr}(h)) = \overline{\dim}_B(H(I')) = \overline{\dim}_B(I') = 1$
 as desired.
$\overline{\dim}_B(\mathrm{Gr}(g)) = \overline{\dim}_B(\mathrm{Gr}(h)) = \overline{\dim}_B(H(I')) = \overline{\dim}_B(I') = 1$
 as desired.
Remark 4·2. Observe that the same argument in fact shows that 
 $\mathrm{Gr}(g)$
 has Assouad dimension (and all Assouad spectra) equal to 1 whenever g is monotone.
$\mathrm{Gr}(g)$
 has Assouad dimension (and all Assouad spectra) equal to 1 whenever g is monotone.
The next step in the proof is to relate the dimension of the graph of a sum of two functions to the dimensions of the graphs of the addends.
Lemma 4·3. 
 $\overline{\dim}_B\,(\mathrm{Gr}(g+h)) \le \max\{ \overline{\dim}_B\,(\mathrm{Gr}(g)), \,\overline{\dim}_B\,(\mathrm{Gr}(h)) \}$
 for functions
$\overline{\dim}_B\,(\mathrm{Gr}(g+h)) \le \max\{ \overline{\dim}_B\,(\mathrm{Gr}(g)), \,\overline{\dim}_B\,(\mathrm{Gr}(h)) \}$
 for functions 
 $g,\,h\,:\,I \to \mathbb{R}$
.
$g,\,h\,:\,I \to \mathbb{R}$
.
We call a notion of dimension D stable with respect to graph sums if
 \begin{align*}D(\mathrm{Gr}(g+h)) \le \max \{D(\mathrm{Gr}(g)),D(\mathrm{Gr}(h))\},\end{align*}
\begin{align*}D(\mathrm{Gr}(g+h)) \le \max \{D(\mathrm{Gr}(g)),D(\mathrm{Gr}(h))\},\end{align*}
where g and h are continuous functions defined on a common interval I. Thus Lemma 4·3 asserts that box-counting dimension is stable with respect to graph sums.
For a proof of Lemma 4·3, see e.g. [Reference Falconer and Fraser7, lemma 2·1]. Another approachFootnote 2 is to establish the identity
 \begin{align}&\overline{\dim}_B(\mathrm{Gr}(g)) \\\nonumber&= \inf \left\{ p \gt 0 \, : \, {\mbox{$\exists\,C \gt 0$ such that $\forall\,\delta \gt 0$ there is a partition $I = I_1\cup\cdots\cup I_N$} \atop \mbox{into subintervals with $N \le C\delta^{-p}$, $|I_j| \le\delta$, and $\mathrm{osc}(g,I_j) \le \delta$ for all }{j}} \right\}, {}\end{align}
\begin{align}&\overline{\dim}_B(\mathrm{Gr}(g)) \\\nonumber&= \inf \left\{ p \gt 0 \, : \, {\mbox{$\exists\,C \gt 0$ such that $\forall\,\delta \gt 0$ there is a partition $I = I_1\cup\cdots\cup I_N$} \atop \mbox{into subintervals with $N \le C\delta^{-p}$, $|I_j| \le\delta$, and $\mathrm{osc}(g,I_j) \le \delta$ for all }{j}} \right\}, {}\end{align}
after which the desired conclusion follows from the subadditivity of oscillation.
Remark 4·4. The preceding argument does not apply to either the Assouad spectra or the Assouad dimension, since a corresponding formula analogous to (4·1) does not hold. We therefore cannot conclude by such methods either that these Assouad-type dimensions are stable with respect to graph sums, nor that the dimensions of BV graphs are equal to one. In fact, we will argue in the opposite direction as a consequence of Theorem 1·4 and deduce that these Assouad-type dimensions are not stable with respect to graph sums. See Corollary 4·8.
With an eye towards the proof of Theorem 1·4, we introduce an example.Footnote 3
Example 4·5. Fix a decreasing sequence 
 $(a_m)$
 with
$(a_m)$
 with 
 $a_m \searrow 0$
, and define
$a_m \searrow 0$
, and define 
 $f\,:\,[0,a_1] \to \mathbb{R}$
 as follows:
$f\,:\,[0,a_1] \to \mathbb{R}$
 as follows: 
 $f(0) = 0$
 and
$f(0) = 0$
 and 
 \begin{equation} {}f(x) = \begin{cases} - a_{2\ell} + \frac{a_{2\ell} + a_{2\ell+1}}{a_{2\ell} - a_{2\ell +1}} (a_{2\ell}-x), &\mbox{if $x\in[a_{m+1},a_m]$ and $m=2\ell$ is even,} \\[5pt] a_{2\ell-1} - \frac{a_{2\ell-1} + a_{2\ell}}{a_{2\ell-1} - a_{2\ell}} (a_{2\ell-1}-x), &\mbox{if $x\in[a_{m+1},a_m]$ and $m=2\ell-1$ is odd.} {}\end{cases}\end{equation}
\begin{equation} {}f(x) = \begin{cases} - a_{2\ell} + \frac{a_{2\ell} + a_{2\ell+1}}{a_{2\ell} - a_{2\ell +1}} (a_{2\ell}-x), &\mbox{if $x\in[a_{m+1},a_m]$ and $m=2\ell$ is even,} \\[5pt] a_{2\ell-1} - \frac{a_{2\ell-1} + a_{2\ell}}{a_{2\ell-1} - a_{2\ell}} (a_{2\ell-1}-x), &\mbox{if $x\in[a_{m+1},a_m]$ and $m=2\ell-1$ is odd.} {}\end{cases}\end{equation}
Observe that the graph of f is a piecewise linear curve consisting of line segments joining the points
 \begin{equation} {}{\mathbf z}_m \,:\!=\, (a_m, (-1)^m a_m), \qquad m=1,2,\ldots\end{equation}
\begin{equation} {}{\mathbf z}_m \,:\!=\, (a_m, (-1)^m a_m), \qquad m=1,2,\ldots\end{equation}
in succession.
 We are interested in characterising when f lies in a suitable Sobolev space 
 $W^{1,p}$
,
$W^{1,p}$
, 
 $1\le p\le\infty$
. Towards this end, note that
$1\le p\le\infty$
. Towards this end, note that 
 \begin{align*}|{\kern1.5pt}f'(x)| = \sum_{m=1}^\infty \frac{a_{m}+a_{m+1}}{a_{m}-a_{m+1}} \chi_{\{x:a_{m+1} \lt x \lt a_{m}\}},\end{align*}
\begin{align*}|{\kern1.5pt}f'(x)| = \sum_{m=1}^\infty \frac{a_{m}+a_{m+1}}{a_{m}-a_{m+1}} \chi_{\{x:a_{m+1} \lt x \lt a_{m}\}},\end{align*}
and hence the p-energy of f is
 \begin{align*}E_p({\kern2pt}f)^p \,:\!=\, \int_{[0,a_1]} |{\kern1.5pt}f'(x)|^p \, dx = \sum_{m=1}^\infty \frac{(a_{m}+a_{m+1})^p}{(a_{m}-a_{m+1})^{p-1}}.\end{align*}
\begin{align*}E_p({\kern2pt}f)^p \,:\!=\, \int_{[0,a_1]} |{\kern1.5pt}f'(x)|^p \, dx = \sum_{m=1}^\infty \frac{(a_{m}+a_{m+1})^p}{(a_{m}-a_{m+1})^{p-1}}.\end{align*}
Thus the membership of f in a specific Sobolev class 
 $W^{1,p}$
 depends on the relative rates of convergence to zero of
$W^{1,p}$
 depends on the relative rates of convergence to zero of 
 $(a_m)$
 and
$(a_m)$
 and 
 $(\epsilon_m)$
, where
$(\epsilon_m)$
, where 
 \begin{align*}\epsilon_m \,:\!=\, a_{m} - a_{m+1}.\end{align*}
\begin{align*}\epsilon_m \,:\!=\, a_{m} - a_{m+1}.\end{align*}
In the proof of Theorem 1·4 we will focus on a specific example, for which we will compute the sharp range of Sobolev membership and the precise Assouad spectrum of the graph.
We leave the proof of the following assertion as an exercise for the reader.
 
Claim 4·6. If 
 $a_{m+1}/a_m \to 1$
 as
$a_{m+1}/a_m \to 1$
 as 
 $m\to \infty$
, then
$m\to \infty$
, then 
 $\mathrm{Gr}({\kern2pt}f)$
 has a full quarter-plane of
$\mathrm{Gr}({\kern2pt}f)$
 has a full quarter-plane of 
 $\mathbb{R}^2$
 as a weak tangent (when considering blow-ups centered at the origin (0,0)). Hence, in this situation, we have
$\mathbb{R}^2$
 as a weak tangent (when considering blow-ups centered at the origin (0,0)). Hence, in this situation, we have 
 \begin{equation} {}\dim_A(\mathrm{Gr}({\kern2pt}f)) = 2;\end{equation}
\begin{equation} {}\dim_A(\mathrm{Gr}({\kern2pt}f)) = 2;\end{equation}
see [Reference Fraser8, theorem 5·1·3] for a proof of the fact that the Assouad dimension of a set E is equal to the supremum of the Hausdorff dimensions of all of the weak tangents of E.
Remark 4·7. Note that it already follows from (4·4) that Assouad dimension is not stable with respect to graph sums. Indeed, there exist functions f of the form in (4·2) which lie in the BV class; then 
 $f=g-h$
 for monotone g and h but
$f=g-h$
 for monotone g and h but 
 $\dim_A(\mathrm{Gr}({\kern2pt}f))=2$
 while
$\dim_A(\mathrm{Gr}({\kern2pt}f))=2$
 while 
 $\dim_A(\mathrm{Gr}(g)) = \dim_A(\mathrm{Gr}(h)) = 1$
.
$\dim_A(\mathrm{Gr}(g)) = \dim_A(\mathrm{Gr}(h)) = 1$
.
Applying the argument from Remark 4·7, but now in the context of Theorem 1·4, yields the following corollary.
Corollary 4·8. For any 
 $0 \lt \theta \lt 1$
, the Assouad spectrum
$0 \lt \theta \lt 1$
, the Assouad spectrum 
 $\dim_A^\theta$
 is not stable with respect to graph sums.
$\dim_A^\theta$
 is not stable with respect to graph sums.
We now prove Theorems 1·3 and 1·4, which provide sharp upper bounds for the Assouad spectra of Sobolev graphs.
 
Proof of Theorem 1·3. Give 
 $f \in W^{1,p}(I)$
,
$f \in W^{1,p}(I)$
, 
 $1 \lt p \lt \infty$
, we fix a subinterval
$1 \lt p \lt \infty$
, we fix a subinterval 
 $J \subset I$
 and let
$J \subset I$
 and let 
 $x,y \in J$
. Then
$x,y \in J$
. Then 
 \begin{align*}f(x) - f(y) = \int_x^y f'(t) \, dt\end{align*}
\begin{align*}f(x) - f(y) = \int_x^y f'(t) \, dt\end{align*}
and so
 \begin{align*}|{\kern1.5pt}f(x)-f(y)| \le \int_{[x,y]} |{\kern1.5pt}f'(t)| \, dt \le |x-y|^{1-1/p} \, ( \int_J |{\kern1.5pt}f'|^p )^{1/p}\end{align*}
\begin{align*}|{\kern1.5pt}f(x)-f(y)| \le \int_{[x,y]} |{\kern1.5pt}f'(t)| \, dt \le |x-y|^{1-1/p} \, ( \int_J |{\kern1.5pt}f'|^p )^{1/p}\end{align*}
whence
 \begin{align*}\mathrm{osc}({\kern1.5pt}f,J) \le |J|^{1-1/p} \, (\int_J |{\kern1.5pt}f'|^p)^{1/p}.\end{align*}
\begin{align*}\mathrm{osc}({\kern1.5pt}f,J) \le |J|^{1-1/p} \, (\int_J |{\kern1.5pt}f'|^p)^{1/p}.\end{align*}
When 
 $p=1$
 we continue to get the inequality
$p=1$
 we continue to get the inequality 
 $\mathrm{osc}({\kern1.5pt}f,J) \le \int_J |{\kern1.5pt}f'|$
, and when
$\mathrm{osc}({\kern1.5pt}f,J) \le \int_J |{\kern1.5pt}f'|$
, and when 
 $p=\infty$
 we continue to get the inequality
$p=\infty$
 we continue to get the inequality 
 $\mathrm{osc}({\kern1.5pt}f,J) \le |J| \text{ess sup}|{\kern1.5pt}f'|$
.
$\mathrm{osc}({\kern1.5pt}f,J) \le |J| \text{ess sup}|{\kern1.5pt}f'|$
.
 Now fix 
 $0 \lt \theta \lt 1$
. We will estimate
$0 \lt \theta \lt 1$
. We will estimate 
 $\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f))$
 from above. Fix
$\dim_{A,reg}^\theta(\mathrm{Gr}({\kern2pt}f))$
 from above. Fix 
 $x_0 \in I$
 and
$x_0 \in I$
 and 
 $0 \lt R\le 1$
. We denote by
$0 \lt R\le 1$
. We denote by 
 ${\mathbf z}_0 = (x_0,f(x_0))$
 the corresponding point in
${\mathbf z}_0 = (x_0,f(x_0))$
 the corresponding point in 
 $\mathrm{Gr}({\kern2pt}f)$
. Let
$\mathrm{Gr}({\kern2pt}f)$
. Let 
 $Q_0$
 be the square with center
$Q_0$
 be the square with center 
 ${\mathbf z}_0$
 and side length 2R, and let
${\mathbf z}_0$
 and side length 2R, and let 
 $I_0 = [x_0-R,x_0+R]$
 be the projection of
$I_0 = [x_0-R,x_0+R]$
 be the projection of 
 $Q_0$
 to the x-axis.
$Q_0$
 to the x-axis.
 Given 
 $0 \lt r\le R^{1/\theta}$
 we can cover
$0 \lt r\le R^{1/\theta}$
 we can cover 
 $I_0$
 with
$I_0$
 with 
 $M\,:\!=\, \lceil {2R}/{r} \rceil$
 intervals
$M\,:\!=\, \lceil {2R}/{r} \rceil$
 intervals 
 $J_k$
, each of length r. Note that
$J_k$
, each of length r. Note that 
 \begin{align*}\frac{2R}{r} \le M \le \frac{2R}{r} + 1 \le \frac{3R}{r}.\end{align*}
\begin{align*}\frac{2R}{r} \le M \le \frac{2R}{r} + 1 \le \frac{3R}{r}.\end{align*}
Then, noting that 
 $\sum_{k=1}^M (\int_{J_k} |{\kern1.5pt}f'|^p)^{1/p}\leq M^{1-1/p} (\sum_{k=1}^M\int_{J_k} |{\kern1.5pt}f'|^p)^{1/p}$
 by Hölder’s inequality, we have
$\sum_{k=1}^M (\int_{J_k} |{\kern1.5pt}f'|^p)^{1/p}\leq M^{1-1/p} (\sum_{k=1}^M\int_{J_k} |{\kern1.5pt}f'|^p)^{1/p}$
 by Hölder’s inequality, we have 
 \begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) & \le \sum_{k=1}^M \left( \frac{\mathrm{osc}({\kern1.5pt}f,J_k)}{r} + 2 \right) \\& \le \sum_{k=1}^M \left( 2 + \left(\int \kern-10.5pt-_{J_k} |{\kern1.5pt}f'|^p\right)^{1/p} \right) \\& \le 2M + M^{1-1/p} r^{-1/p} \left( \sum_{k=1}^M \int_{J_k} |{\kern1.5pt}f'|^p \right)^{1/p} \\& \leq 2M + M^{1-1/p} r^{-1/p} \left( \int_{I} |{\kern1.5pt}f'|^p \right)^{1/p} \\& \lesssim \frac{R}{r} + \frac{R^{1-1/p}}{r} ||{\kern1.5pt}f'||_{p,I},\end{align*}
\begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) & \le \sum_{k=1}^M \left( \frac{\mathrm{osc}({\kern1.5pt}f,J_k)}{r} + 2 \right) \\& \le \sum_{k=1}^M \left( 2 + \left(\int \kern-10.5pt-_{J_k} |{\kern1.5pt}f'|^p\right)^{1/p} \right) \\& \le 2M + M^{1-1/p} r^{-1/p} \left( \sum_{k=1}^M \int_{J_k} |{\kern1.5pt}f'|^p \right)^{1/p} \\& \leq 2M + M^{1-1/p} r^{-1/p} \left( \int_{I} |{\kern1.5pt}f'|^p \right)^{1/p} \\& \lesssim \frac{R}{r} + \frac{R^{1-1/p}}{r} ||{\kern1.5pt}f'||_{p,I},\end{align*}
where 
 $||h||_{p,J} \,:\!=\, (\int_J |h|^p)^{1/p}$
. Since
$||h||_{p,J} \,:\!=\, (\int_J |h|^p)^{1/p}$
. Since 
 $R\le 1$
 we in turn conclude that
$R\le 1$
 we in turn conclude that 
 \begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) \lesssim R^{1-1/p} r^{-1} ( 1 + ||{\kern1.5pt}f'||_{p,I} ) .\end{align*}
\begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) \lesssim R^{1-1/p} r^{-1} ( 1 + ||{\kern1.5pt}f'||_{p,I} ) .\end{align*}
Next, the restriction 
 $r\le R^{1/\theta}$
 implies
$r\le R^{1/\theta}$
 implies 
 \begin{align*}R^{-1/p} \le \left( \frac{R}{r} \right)^{\tfrac{\theta}{(1-\theta)p}}\end{align*}
\begin{align*}R^{-1/p} \le \left( \frac{R}{r} \right)^{\tfrac{\theta}{(1-\theta)p}}\end{align*}
and hence, we have
 \begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) \lesssim \left( \frac{R}{r} \right)^{1+\tfrac{\theta}{(1-\theta)p}}\end{align*}
\begin{align*}N(Q_0 \cap \mathrm{Gr}({\kern2pt}f),r) \lesssim \left( \frac{R}{r} \right)^{1+\tfrac{\theta}{(1-\theta)p}}\end{align*}
where the implicit constant depends on 
 $||{\kern1.5pt}f'||_{p,I}$
. Since this conclusion holds true for all
$||{\kern1.5pt}f'||_{p,I}$
. Since this conclusion holds true for all 
 $0 \lt r\le R^{1/\theta} \lt R \le 1$
 and all
$0 \lt r\le R^{1/\theta} \lt R \le 1$
 and all 
 ${\mathbf z}_0 \in \mathrm{Gr}({\kern2pt}f)$
, we conclude that (1·5) holds as desired.
${\mathbf z}_0 \in \mathrm{Gr}({\kern2pt}f)$
, we conclude that (1·5) holds as desired.
 
Proof of Theorem 1·4. Fix 
 $p\gt1$
. For pedagogical reasons, we first construct a function f so that
$p\gt1$
. For pedagogical reasons, we first construct a function f so that 
 $f \in W^{1,q}(I)$
 for all
$f \in W^{1,q}(I)$
 for all 
 $1\le q \lt p$
 and
$1\le q \lt p$
 and 
 $\dim_A^\theta(\mathrm{Gr}({\kern2pt}f)) = 1 + \theta/((1-\theta)p)$
. At the end of the proof, we will indicate how to modify the construction to cover the borderline case
$\dim_A^\theta(\mathrm{Gr}({\kern2pt}f)) = 1 + \theta/((1-\theta)p)$
. At the end of the proof, we will indicate how to modify the construction to cover the borderline case 
 $q=p$
.
$q=p$
.
 We return to the situation of Example 4·5 and specialise to a one-parameter family of examples. For 
 $s\gt2$
, let
$s\gt2$
, let 
 \begin{equation} {}a_m = m^{1-s}.\end{equation}
\begin{equation} {}a_m = m^{1-s}.\end{equation}
Then
 \begin{align*}\epsilon_m = a_m - a_{m+1} = (s-1)(m+\delta_m)^{-s} \qquad \mbox{for some $0 \lt \delta_m\lt1$}\end{align*}
\begin{align*}\epsilon_m = a_m - a_{m+1} = (s-1)(m+\delta_m)^{-s} \qquad \mbox{for some $0 \lt \delta_m\lt1$}\end{align*}
by the Mean Value Theorem.
 We choose 
 $s\,:\!=\,p+1$
 and consider the points
$s\,:\!=\,p+1$
 and consider the points 
 $\{ {\mathbf z}_m \}$
 defined as in (4·3) and the function
$\{ {\mathbf z}_m \}$
 defined as in (4·3) and the function 
 $f=f_s\,:\,[0,a_1] \to \mathbb{R}$
 defined in (4·2). The q-energy is
$f=f_s\,:\,[0,a_1] \to \mathbb{R}$
 defined in (4·2). The q-energy is 
 \begin{align*}E_q({\kern1.5pt}f_s) = \sum_{m=1}^\infty \frac{(m^{1-s} + (m+1)^{1-s})^q}{(m^{-s} - (m+1)^{-s})^{q-1}} \simeq \sum_{m=1}^\infty \frac{m^{(1-s)q}}{m^{-s(q-1)}} \, ,\end{align*}
\begin{align*}E_q({\kern1.5pt}f_s) = \sum_{m=1}^\infty \frac{(m^{1-s} + (m+1)^{1-s})^q}{(m^{-s} - (m+1)^{-s})^{q-1}} \simeq \sum_{m=1}^\infty \frac{m^{(1-s)q}}{m^{-s(q-1)}} \, ,\end{align*}
where the notation 
 $\simeq$
 means that the sums on either side are simultaneously finite or infinite. Hence
$\simeq$
 means that the sums on either side are simultaneously finite or infinite. Hence 
 $E_q({\kern1.5pt}f_s) \lt \infty$
 if and only if
$E_q({\kern1.5pt}f_s) \lt \infty$
 if and only if 
 $q-s\lt-1$
, so
$q-s\lt-1$
, so 
 \begin{align*}f_s \in W^{1,q}([0,a_1]) \qquad \mbox{for all $q \lt s-1=p$,}\end{align*}
\begin{align*}f_s \in W^{1,q}([0,a_1]) \qquad \mbox{for all $q \lt s-1=p$,}\end{align*}
and
 \begin{align*}yf_s \not \in W^{1,s-1}([0,a_1]).\end{align*}
\begin{align*}yf_s \not \in W^{1,s-1}([0,a_1]).\end{align*}
Applying Theorem 1·3 and letting 
 $q \to s-1$
 yields
$q \to s-1$
 yields 
 \begin{align*}\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \le \dim_{A,reg}^\theta (\mathrm{Gr}({\kern1.5pt}f_s))\leq 1 + \frac{\theta}{(1-\theta)(s-1)} \, .\end{align*}
\begin{align*}\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \le \dim_{A,reg}^\theta (\mathrm{Gr}({\kern1.5pt}f_s))\leq 1 + \frac{\theta}{(1-\theta)(s-1)} \, .\end{align*}
Now fix 
 $\theta\lt(s-1)/s$
 and
$\theta\lt(s-1)/s$
 and 
 \begin{equation} {}\gamma \lt 1 + \frac{\theta}{(1-\theta)(s-1)} \, ,\end{equation}
\begin{equation} {}\gamma \lt 1 + \frac{\theta}{(1-\theta)(s-1)} \, ,\end{equation}
We will show that 
 $\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \ge \gamma$
.
$\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \ge \gamma$
.
 It suffices to find 
 $c\gt0$
 and
$c\gt0$
 and 
 $\epsilon\gt0$
 and sequences
$\epsilon\gt0$
 and sequences 
 $(r_n)$
 and
$(r_n)$
 and 
 $(R_n)$
 with
$(R_n)$
 with 
 $0 \lt r_n = R_n^{1/\theta} \lt R_n \le 1$
 so that
$0 \lt r_n = R_n^{1/\theta} \lt R_n \le 1$
 so that 
 \begin{equation} {}N(Q(0,R_n)\cap \mathrm{Gr}({\kern1.5pt}f_s),r_n) \ge c n^\epsilon \left( \frac{R_n}{r_n} \right)^\gamma.\end{equation}
\begin{equation} {}N(Q(0,R_n)\cap \mathrm{Gr}({\kern1.5pt}f_s),r_n) \ge c n^\epsilon \left( \frac{R_n}{r_n} \right)^\gamma.\end{equation}
In order to obtain (4·7) we will exhibit a large collection 
 ${\mathcal D}$
 of points in
${\mathcal D}$
 of points in 
 $Q(0,R_n) \cap \mathrm{Gr}({\kern1.5pt}f_s)$
 with pairwise distances all
$Q(0,R_n) \cap \mathrm{Gr}({\kern1.5pt}f_s)$
 with pairwise distances all 
 $\gt r_n$
. See [Reference Fraser8, section 1·2] or [Reference Luukkainen13, lemma 3·4] for more information about the relationship between packing and covering numbers.
$\gt r_n$
. See [Reference Fraser8, section 1·2] or [Reference Luukkainen13, lemma 3·4] for more information about the relationship between packing and covering numbers.
 We choose the sequence 
 $(R_n)$
 to be
$(R_n)$
 to be 
 $R_n = a_n = n^{1-s}$
 for all
$R_n = a_n = n^{1-s}$
 for all 
 $n \ge n_0$
 for a sufficiently large integer
$n \ge n_0$
 for a sufficiently large integer 
 $n_0$
 (to be determined later). Observe that
$n_0$
 (to be determined later). Observe that 
 \begin{align*}y{\mathbf z}_m \in Q(0,R_n) \, \Longleftrightarrow \, a_m \le R_n \, \Longleftrightarrow \, m \ge n.\end{align*}
\begin{align*}y{\mathbf z}_m \in Q(0,R_n) \, \Longleftrightarrow \, a_m \le R_n \, \Longleftrightarrow \, m \ge n.\end{align*}
Fix a large even integer 
 $N(n) \gt n$
 (to be determined later). The desired set
$N(n) \gt n$
 (to be determined later). The desired set 
 ${\mathcal D}$
 consists of a finite collection of equally spaced collinear points along the line segments
${\mathcal D}$
 consists of a finite collection of equally spaced collinear points along the line segments 
 $[{\mathbf z}_m,{\mathbf z}_{m+1}]$
,
$[{\mathbf z}_m,{\mathbf z}_{m+1}]$
, 
 $[{\mathbf z}_{m+2},{\mathbf z}_{m+3}]$
,
$[{\mathbf z}_{m+2},{\mathbf z}_{m+3}]$
, 
 $[{\mathbf z}_{n+N(n)-2},{\mathbf z}_{n+N(n)-1}]$
. Along each line segment
$[{\mathbf z}_{n+N(n)-2},{\mathbf z}_{n+N(n)-1}]$
. Along each line segment 
 $[{\mathbf z}_m,{\mathbf z}_{m+1}]$
, the elements of
$[{\mathbf z}_m,{\mathbf z}_{m+1}]$
, the elements of 
 ${\mathcal D}$
 are equally spaced points at distance approximately
${\mathcal D}$
 are equally spaced points at distance approximately 
 $r_n$
.
$r_n$
.
More precisely, let
 \begin{equation} {}{\mathcal D} = \{ {\mathbf w}_{m,k} \, : \, m = n,n+2,n+4,\ldots,n+N(n)-2, k=1,2,\ldots,M(n) \},\end{equation}
\begin{equation} {}{\mathcal D} = \{ {\mathbf w}_{m,k} \, : \, m = n,n+2,n+4,\ldots,n+N(n)-2, k=1,2,\ldots,M(n) \},\end{equation}
where, for each m, the points 
 $\{{\mathbf w}_{m,k}:k=1,\ldots,M(m)\}$
 constitute a maximal
$\{{\mathbf w}_{m,k}:k=1,\ldots,M(m)\}$
 constitute a maximal 
 $r_n$
-separated set in the line segment
$r_n$
-separated set in the line segment 
 $[{\mathbf z}_m,{\mathbf z}_{m+1}]$
. For each
$[{\mathbf z}_m,{\mathbf z}_{m+1}]$
. For each 
 $k=1,\ldots,M(m)-1$
, we have
$k=1,\ldots,M(m)-1$
, we have 
 \begin{align*}|{\mathbf w}_{m,k}-{\mathbf w}_{m,k+1}| = \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)}\end{align*}
\begin{align*}|{\mathbf w}_{m,k}-{\mathbf w}_{m,k+1}| = \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)}\end{align*}
and
 \begin{equation} {}\frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)-1} \gt r_n \ge \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)} .\end{equation}
\begin{equation} {}\frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)-1} \gt r_n \ge \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{M(m)} .\end{equation}
Consequently,
 \begin{equation} {}M(m) = \left \lceil \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{r_n} \right \rceil \geq \left \lceil \frac{\sqrt{2}(a_m-a_{m+1})}{r_n} \right \rceil = \left \lceil \sqrt{2} (s-1) n^{(s-1)/\theta} (m+\delta_m)^{-s} \right \rceil.\end{equation}
\begin{equation} {}M(m) = \left \lceil \frac{|{\mathbf z}_m-{\mathbf z}_{m+1}|}{r_n} \right \rceil \geq \left \lceil \frac{\sqrt{2}(a_m-a_{m+1})}{r_n} \right \rceil = \left \lceil \sqrt{2} (s-1) n^{(s-1)/\theta} (m+\delta_m)^{-s} \right \rceil.\end{equation}
We impose the condition that 
 $M(m) \ge 2$
 for each
$M(m) \ge 2$
 for each 
 $m=n,n+2,n+4,\ldots,n+N(n)-2$
; this leads to an upper bound on the choice of N(n). In fact, the condition needs only hold for
$m=n,n+2,n+4,\ldots,n+N(n)-2$
; this leads to an upper bound on the choice of N(n). In fact, the condition needs only hold for 
 $m=n+N(n)-2$
 and we observe that
$m=n+N(n)-2$
 and we observe that 
 \begin{align*}yM(n+N(n)-2) \ge 2\end{align*}
\begin{align*}yM(n+N(n)-2) \ge 2\end{align*}
holds true provided
 \begin{align*}y\sqrt{2} (s-1) n^{(s-1)/\theta} (n+N(n)-2+\delta_{n+N(n)-2})^{-s} \ge 2\end{align*}
\begin{align*}y\sqrt{2} (s-1) n^{(s-1)/\theta} (n+N(n)-2+\delta_{n+N(n)-2})^{-s} \ge 2\end{align*}
which holds if and only if
 \begin{equation} {}N(n) \le \left( \frac{s-1}{\sqrt{2}} \right)^{1/s} n^{(s-1)/(s\theta)} - (n-2) - \delta_{n+N(n)-2}.\end{equation}
\begin{equation} {}N(n) \le \left( \frac{s-1}{\sqrt{2}} \right)^{1/s} n^{(s-1)/(s\theta)} - (n-2) - \delta_{n+N(n)-2}.\end{equation}
We also impose the condition that 
 $|{\mathbf w}_{m,k} - {\mathbf w}_{m',k'}| \gt r_n$
 whenever
$|{\mathbf w}_{m,k} - {\mathbf w}_{m',k'}| \gt r_n$
 whenever 
 $m \ne m'$
 and
$m \ne m'$
 and 
 $k\in\{1,\ldots,M(m)\}$
,
$k\in\{1,\ldots,M(m)\}$
, 
 $k'\in\{1,\ldots,M(m')\}$
. Assume without loss of generality that
$k'\in\{1,\ldots,M(m')\}$
. Assume without loss of generality that 
 $m\lt m'$
. Then
$m\lt m'$
. Then 
 $m\le n+N(n)-4$
 and
$m\le n+N(n)-4$
 and 
 $m'\le n+N(n)-2$
 and hence
$m'\le n+N(n)-2$
 and hence 
 \begin{equation*}\begin{split}|{\mathbf w}_{m,k} - {\mathbf w}_{m',k'}| &\ge a_{m+1}-a_{m'} \ge a_{n+N(n)-3} - a_{n+N(n)-2} \\&= \epsilon_{n+N(n)-3} \\&= (s-1)(n+N(n)-3 + \delta_{n+N(n)-3})^{-s}.\end{split}\end{equation*}
\begin{equation*}\begin{split}|{\mathbf w}_{m,k} - {\mathbf w}_{m',k'}| &\ge a_{m+1}-a_{m'} \ge a_{n+N(n)-3} - a_{n+N(n)-2} \\&= \epsilon_{n+N(n)-3} \\&= (s-1)(n+N(n)-3 + \delta_{n+N(n)-3})^{-s}.\end{split}\end{equation*}
Thus the desired condition holds provided
 \begin{align*}(s-1)(n+N(n)-3 + \delta_{n+N(n)-3})^{-s} \gt r_n = n^{(1-s)/\theta}\end{align*}
\begin{align*}(s-1)(n+N(n)-3 + \delta_{n+N(n)-3})^{-s} \gt r_n = n^{(1-s)/\theta}\end{align*}
which in turn holds if and only if
 \begin{equation} {}N(n) \lt (s-1)^{1/s} \, n^{(s-1)/(s\theta)} - (n-3) - \delta_{n+N(n)-3}.\end{equation}
\begin{equation} {}N(n) \lt (s-1)^{1/s} \, n^{(s-1)/(s\theta)} - (n-3) - \delta_{n+N(n)-3}.\end{equation}
The following claim holds in view of the assumption 
 $\theta\lt(s-1)/s$
.
$\theta\lt(s-1)/s$
.
Claim 4·9. There exist a constant 
 $c_0(s)\gt0$
 and a large integer
$c_0(s)\gt0$
 and a large integer 
 $n_0=n_0(s)$
 so that, for all
$n_0=n_0(s)$
 so that, for all 
 $n \ge n_0$
, both (4·11) and (4·12) are satisfied when N(n) is chosen to be the largest even integer less than or equal to
$n \ge n_0$
, both (4·11) and (4·12) are satisfied when N(n) is chosen to be the largest even integer less than or equal to 
 $c_0(s) n^{(s-1)/(s\theta)}$
.
$c_0(s) n^{(s-1)/(s\theta)}$
.
 For the remainder of the proof, we consider only integers 
 $n \ge n_0$
, where
$n \ge n_0$
, where 
 $n_0$
 is chosen as in the preceding claim.
$n_0$
 is chosen as in the preceding claim.
 By the construction and the above properties, the set 
 ${\mathcal D}$
 defined in (4·8) with this choice of N(n) and integers M(m) as in (4·10) has the property that
${\mathcal D}$
 defined in (4·8) with this choice of N(n) and integers M(m) as in (4·10) has the property that 
 $|{\mathbf w}-{\mathbf w}'|\gt r_n$
 whenever
$|{\mathbf w}-{\mathbf w}'|\gt r_n$
 whenever 
 ${\mathbf w}$
 and
${\mathbf w}$
 and 
 ${\mathbf w}'$
 are distinct points in
${\mathbf w}'$
 are distinct points in 
 ${\mathcal D}$
. To finish the proof, we estimate the cardinality
${\mathcal D}$
. To finish the proof, we estimate the cardinality 
 $\# {\mathcal D}$
 of
$\# {\mathcal D}$
 of 
 ${\mathcal D}$
 from below. Note that
${\mathcal D}$
 from below. Note that 
 \begin{align*}\# {\mathcal D} = M(n) + M(n+2) + \cdots + M(n+N(n)-2)\end{align*}
\begin{align*}\# {\mathcal D} = M(n) + M(n+2) + \cdots + M(n+N(n)-2)\end{align*}
and, by (4·9),
 \begin{align*}\# {\mathcal D} \ge \frac{|{\mathbf z}_n-{\mathbf z}_{n+1}| + |{\mathbf z}_{n+2} - {\mathbf z}_{n+3}| + \cdots + |{\mathbf z}_{n+N(n)-2} - {\mathbf z}_{n+N(n)-1}|}{r_n}.\end{align*}
\begin{align*}\# {\mathcal D} \ge \frac{|{\mathbf z}_n-{\mathbf z}_{n+1}| + |{\mathbf z}_{n+2} - {\mathbf z}_{n+3}| + \cdots + |{\mathbf z}_{n+N(n)-2} - {\mathbf z}_{n+N(n)-1}|}{r_n}.\end{align*}
By the choice of the points 
 ${\mathbf z}_m=(a_m,(-1)^m a_m)$
,
${\mathbf z}_m=(a_m,(-1)^m a_m)$
, 
 \begin{align*}|{\mathbf z}_m-{\mathbf z}_{m+1}| = \sqrt{(a_m-a_{m+1})^2 + (a_m+a_{m+1})^2} = \sqrt{2} \, \sqrt{a_m^2 + a_{m+1}^2} \ge a_m + a_{m+1}.\end{align*}
\begin{align*}|{\mathbf z}_m-{\mathbf z}_{m+1}| = \sqrt{(a_m-a_{m+1})^2 + (a_m+a_{m+1})^2} = \sqrt{2} \, \sqrt{a_m^2 + a_{m+1}^2} \ge a_m + a_{m+1}.\end{align*}
Thus
 \begin{equation*}\begin{split}\# {\mathcal D}&\ge \frac{a_n+a_{n+1}+\cdots+a_{n+N(n)-1}}{r_n} \\&= n^{(s-1)/\theta} \sum_{m=n}^{n+N(n)-1} m^{1-s} \\&\ge c_1(s) n^{(s-1)/\theta} (n^{2-s} - (n+N(n)-1)^{2-s}) \\&\ge c_2(s) n^{(s-1)/\theta+2-s},\end{split}\end{equation*}
\begin{equation*}\begin{split}\# {\mathcal D}&\ge \frac{a_n+a_{n+1}+\cdots+a_{n+N(n)-1}}{r_n} \\&= n^{(s-1)/\theta} \sum_{m=n}^{n+N(n)-1} m^{1-s} \\&\ge c_1(s) n^{(s-1)/\theta} (n^{2-s} - (n+N(n)-1)^{2-s}) \\&\ge c_2(s) n^{(s-1)/\theta+2-s},\end{split}\end{equation*}
where 
 $c_1(s)$
 depends on the integral test constant, and
$c_1(s)$
 depends on the integral test constant, and 
 $c_2(s)$
 depends on
$c_2(s)$
 depends on 
 $c_0(s), c_1(s),$
 and the domination constant of
$c_0(s), c_1(s),$
 and the domination constant of 
 $n^{2-s}$
 over
$n^{2-s}$
 over 
 $(n+n^{\tfrac{s-1}{s\theta}}-1)^{2-s}$
. Note also that
$(n+n^{\tfrac{s-1}{s\theta}}-1)^{2-s}$
. Note also that 
 \begin{align*}n^\epsilon (R_n/r_n)^\gamma = n^{\epsilon + (s-1)(\tfrac1\theta-1)\gamma}.\end{align*}
\begin{align*}n^\epsilon (R_n/r_n)^\gamma = n^{\epsilon + (s-1)(\tfrac1\theta-1)\gamma}.\end{align*}
In order to verify that (4·7) holds, it suffices to show that
 \begin{equation} {}(s-1)\left(\frac1\theta-1\right)\gamma \lt \frac{s-1}{\theta} + 2-s;\end{equation}
\begin{equation} {}(s-1)\left(\frac1\theta-1\right)\gamma \lt \frac{s-1}{\theta} + 2-s;\end{equation}
then a suitable 
 $\epsilon = \epsilon(s,\gamma,\theta)$
 can be chosen so that
$\epsilon = \epsilon(s,\gamma,\theta)$
 can be chosen so that 
 \begin{align*}\epsilon + (s-1)\left(\frac1\theta-1\right)\gamma \lt \frac{s-1}{\theta} + 2-s.\end{align*}
\begin{align*}\epsilon + (s-1)\left(\frac1\theta-1\right)\gamma \lt \frac{s-1}{\theta} + 2-s.\end{align*}
The inequality in (4·13) is the same as our assumed bound (4·6).
 To extend to the borderline case, we introduce a logarithmic factor. We replace the choice of 
 $(a_m)$
 in (4·5) with the following:
$(a_m)$
 in (4·5) with the following: 
 \begin{equation} {}a_m \,:\!=\, m^{1-s} \log^{-2}(m), \qquad s\gt2, m \ge 2.\end{equation}
\begin{equation} {}a_m \,:\!=\, m^{1-s} \log^{-2}(m), \qquad s\gt2, m \ge 2.\end{equation}
In this case, we find (again by the Mean Value Theorem) that
 \begin{align*}\epsilon_m = a_m - a_{m+1} = \left. (s-1) x^{-s} \log^{-2}(x)\bigl( 1 + \tfrac{2}{\log(x)} \bigr) \right|_{x=m+\delta_m}\end{align*}
\begin{align*}\epsilon_m = a_m - a_{m+1} = \left. (s-1) x^{-s} \log^{-2}(x)\bigl( 1 + \tfrac{2}{\log(x)} \bigr) \right|_{x=m+\delta_m}\end{align*}
for some 
 $0 \lt \delta_m\lt 1$
. Setting
$0 \lt \delta_m\lt 1$
. Setting 
 $s=p+1$
 as before, we let
$s=p+1$
 as before, we let 
 $f = f_s\,:\,[0,a_1] \to \mathbb{R}$
 be the function defined in (4·2). The p-energy of f is
$f = f_s\,:\,[0,a_1] \to \mathbb{R}$
 be the function defined in (4·2). The p-energy of f is 
 \begin{align*}E_p({\kern1.5pt}f_s) \simeq \sum_{m=2}^\infty m^{-1} \log^{-2}(m) \lt \infty.\end{align*}
\begin{align*}E_p({\kern1.5pt}f_s) \simeq \sum_{m=2}^\infty m^{-1} \log^{-2}(m) \lt \infty.\end{align*}
Thus 
 $f_s \in W^{1,p}([0,a_1])$
. It remains to show that the Assouad spectrum formula
$f_s \in W^{1,p}([0,a_1])$
. It remains to show that the Assouad spectrum formula 
 \begin{align*}\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) = 1 + \frac{\theta}{(1-\theta)(s-1)}\end{align*}
\begin{align*}\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) = 1 + \frac{\theta}{(1-\theta)(s-1)}\end{align*}
continues to hold. As before, only the lower bound needs to be verified, so we fix 
 $\gamma$
 as in (4·6) and show that
$\gamma$
 as in (4·6) and show that 
 $\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \gt \gamma$
. The argument is similar to that described in detail in the first part of the proof. With the choice
$\dim_A^\theta(\mathrm{Gr}({\kern1.5pt}f_s)) \gt \gamma$
. The argument is similar to that described in detail in the first part of the proof. With the choice 
 $R_n = a_n$
,
$R_n = a_n$
, 
 $n\ge 2$
, and
$n\ge 2$
, and 
 $r_n = R_n^{1/\theta}$
 as before, we consider
$r_n = R_n^{1/\theta}$
 as before, we consider 
 $M(m) = \lceil {\sqrt{2} \epsilon_m}/{r_n} \rceil$
. The condition
$M(m) = \lceil {\sqrt{2} \epsilon_m}/{r_n} \rceil$
. The condition 
 $M(m) \ge 2$
 for all
$M(m) \ge 2$
 for all 
 $m=n, n+2,\ldots,n+\,N(n)-2$
, reduces to
$m=n, n+2,\ldots,n+\,N(n)-2$
, reduces to 
 \begin{equation} {}M(n+N(n)-2) \ge 2.\end{equation}
\begin{equation} {}M(n+N(n)-2) \ge 2.\end{equation}
Define
 \begin{align*}\eta_n \,:\!=\, \left.\left.\left( (1+\tfrac{2}{\log(x)})^{1/s} - 1 \right)\right|_{x=m+\delta_m}\right|_{m=n+N(n)-2}\end{align*}
\begin{align*}\eta_n \,:\!=\, \left.\left.\left( (1+\tfrac{2}{\log(x)})^{1/s} - 1 \right)\right|_{x=m+\delta_m}\right|_{m=n+N(n)-2}\end{align*}
and note that the condition 
 $n \ge 2$
 implies
$n \ge 2$
 implies 
 $\eta_n \lt 1$
. The desired condition (4·15) is implied by
$\eta_n \lt 1$
. The desired condition (4·15) is implied by 
 \begin{equation} {}\left. \left. x^s \log^2(x) \right|_{x=m+\delta_m} \right|_{m=n+N(n)-2} \le \frac{s-1}{\sqrt{2}} n^{(s-1)/\theta} \log^{2/\theta}(n) (1+\eta_n)^s.\end{equation}
\begin{equation} {}\left. \left. x^s \log^2(x) \right|_{x=m+\delta_m} \right|_{m=n+N(n)-2} \le \frac{s-1}{\sqrt{2}} n^{(s-1)/\theta} \log^{2/\theta}(n) (1+\eta_n)^s.\end{equation}
Fixing the Orlicz function 
 $\Phi(t) = t\,\log^{2/s}(t)$
 and setting
$\Phi(t) = t\,\log^{2/s}(t)$
 and setting 
 $c(s) = ((s-1)/\sqrt{2})^{1/s}$
 we rewrite (4·16) as
$c(s) = ((s-1)/\sqrt{2})^{1/s}$
 we rewrite (4·16) as 
 \begin{equation} {}\left. \left. \Phi(x) \right|_{x=m+\delta_m} \right|_{m=n+N(n)-2} \le c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n),\end{equation}
\begin{equation} {}\left. \left. \Phi(x) \right|_{x=m+\delta_m} \right|_{m=n+N(n)-2} \le c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n),\end{equation}
or equivalently,
 \begin{equation} {}\left. (m+\delta_m) \right|_{m=n+N(n)-2} \le \Phi^{-1} \left( c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n) \right).\end{equation}
\begin{equation} {}\left. (m+\delta_m) \right|_{m=n+N(n)-2} \le \Phi^{-1} \left( c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n) \right).\end{equation}
Inequality (4·18) translates to the following constraint on the choice of N(n):
 \begin{equation} {}N(n) \le \Phi^{-1} \left( c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n) \right) - (n-2) - \delta_{n+N(n)-2}.\end{equation}
\begin{equation} {}N(n) \le \Phi^{-1} \left( c(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\eta_n) \right) - (n-2) - \delta_{n+N(n)-2}.\end{equation}
Recall that both 
 $\eta_n$
,
$\eta_n$
, 
 $n \ge 2$
, and
$n \ge 2$
, and 
 $\delta_m$
,
$\delta_m$
, 
 $m \ge 2$
, lie in the interval (0, 1). Furthermore, the assumption
$m \ge 2$
, lie in the interval (0, 1). Furthermore, the assumption 
 $\theta \lt p/(p+1) = {(s-1)}/{s}$
 implies that
$\theta \lt p/(p+1) = {(s-1)}/{s}$
 implies that 
 $(s-1)/(s\theta)\gt1$
. For large values of the argument t, we have
$(s-1)/(s\theta)\gt1$
. For large values of the argument t, we have 
 \begin{align*}\Phi^{-1}(t) \simeq t \log^{-2/s}(t)(1+o(1))\end{align*}
\begin{align*}\Phi^{-1}(t) \simeq t \log^{-2/s}(t)(1+o(1))\end{align*}
and hence (4·19) translates to
 \begin{equation} {}N(n) \le c'(s) n^{(s-1)/(s\theta)} \log^{\tfrac2s(\tfrac1\theta-1)}(n) (1+\eta_n) (1+o(1)),\end{equation}
\begin{equation} {}N(n) \le c'(s) n^{(s-1)/(s\theta)} \log^{\tfrac2s(\tfrac1\theta-1)}(n) (1+\eta_n) (1+o(1)),\end{equation}
where 
 $c'(s) = c(s)(s\theta/(s-1))^{2/s}$
.
$c'(s) = c(s)(s\theta/(s-1))^{2/s}$
.
In a similar fashion, we analyze the previous second condition
 \begin{equation} {}\epsilon_{n+N(n)-3} \gt r_n.\end{equation}
\begin{equation} {}\epsilon_{n+N(n)-3} \gt r_n.\end{equation}
We now define
 \begin{align*}\overline\eta_n \,:\!=\, \left.\left.\left( (1+\tfrac{2}{\log(x)})^{1/s} - 1 \right)\right|_{x=m+\delta_m}\right|_{m=n+N(n)-3}\end{align*}
\begin{align*}\overline\eta_n \,:\!=\, \left.\left.\left( (1+\tfrac{2}{\log(x)})^{1/s} - 1 \right)\right|_{x=m+\delta_m}\right|_{m=n+N(n)-3}\end{align*}
and we again note that 
 $\overline\eta_n \lt 1$
 since
$\overline\eta_n \lt 1$
 since 
 $n \ge 2$
. After a similar chain of reasoning, we deduce that (4·21) is implied by the following constraint on N(n):
$n \ge 2$
. After a similar chain of reasoning, we deduce that (4·21) is implied by the following constraint on N(n): 
 \begin{equation} {}N(n) \le \Phi^{-1} \left( \overline{c}(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\overline\eta_n) \right) - (n-3) - \delta_{n+N(n)-3}.\end{equation}
\begin{equation} {}N(n) \le \Phi^{-1} \left( \overline{c}(s) n^{(s-1)/(s\theta)} \log^{2/(s\theta)}(n) (1+\overline\eta_n) \right) - (n-3) - \delta_{n+N(n)-3}.\end{equation}
Here 
 $\overline{c}(s) = (s-1)^{1/s}$
. Using the previous asymptotics for the inverse of the Orlicz function
$\overline{c}(s) = (s-1)^{1/s}$
. Using the previous asymptotics for the inverse of the Orlicz function 
 $\Phi$
, we reduce (4·22) to
$\Phi$
, we reduce (4·22) to 
 \begin{equation} {}N(n) \le \overline{c}'(s) n^{(s-1)/(s\theta)} \log^{\tfrac2s(\tfrac1\theta-1)}(n) (1+\overline\eta_n) (1 + o(1)).\end{equation}
\begin{equation} {}N(n) \le \overline{c}'(s) n^{(s-1)/(s\theta)} \log^{\tfrac2s(\tfrac1\theta-1)}(n) (1+\overline\eta_n) (1 + o(1)).\end{equation}
where 
 $\overline{c}'(s) = \overline{c}(s)(s\theta/(s-1))^{2/s}$
. Our previous Claim 4·9 is now replaced by
$\overline{c}'(s) = \overline{c}(s)(s\theta/(s-1))^{2/s}$
. Our previous Claim 4·9 is now replaced by
 
Claim 4·10. There exist a constant 
 $\overline{c}_0(s)\gt0$
 and a large integer
$\overline{c}_0(s)\gt0$
 and a large integer 
 $\overline{n}_0=\overline{n}_0(s)$
 so that, for all
$\overline{n}_0=\overline{n}_0(s)$
 so that, for all 
 $n \ge \overline{n}_0$
, both (4·20) and (4·23) are satisfied when N(n) is chosen to be the largest even integer less than or equal to
$n \ge \overline{n}_0$
, both (4·20) and (4·23) are satisfied when N(n) is chosen to be the largest even integer less than or equal to 
 $\overline{c}_0(s) n^{(s-1)/(s\theta)}$
.
$\overline{c}_0(s) n^{(s-1)/(s\theta)}$
.
 The final part of the proof is exactly the same as in the previous case and is left to the reader. The desired lower bound for the cardinality 
 $\#{\mathcal D}$
 of the set defined in (4·8) holds due to the choice of
$\#{\mathcal D}$
 of the set defined in (4·8) holds due to the choice of 
 $\gamma$
 in (4·6). Note that additional logarithmic factors show up in the relevant inequalities, however, these are irrelevant to the desired conclusion as the leading order polynomial behaviour of both sides with respect to n dominates.
$\gamma$
 in (4·6). Note that additional logarithmic factors show up in the relevant inequalities, however, these are irrelevant to the desired conclusion as the leading order polynomial behaviour of both sides with respect to n dominates.
This concludes the proof of Theorem 1·4.
Acknowledgments
We gratefully acknowledge valuable insights from Jonathan Fraser on the subject of Assouad dimensions of graphs, and especially for bringing to our attention the recent preprint [Reference Anttila, Bárány and Käenmäki1] on the Assouad dimensions of Takagi graphs. We also thank Roope Anttila for pointing out that an earlier, weaker version of Question 3·9 was in fact known. JTT acknowledges support from the Simons Foundation under grant #852888, ‘Geometric mapping theory and geometric measure theory in sub-Riemannian and metric spaces’. In addition, this material is based upon work supported by, and while JTT was serving as a Program Director at, the U.S. National Science Foundation. Any opinion, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation. Lastly, we wish to thank the anonymous referee for reading our manuscript carefully, and for providing insightful feedback that has improved the exposition.
 
 






 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 























