\documentclass[DIV=12,%
               BCOR=0mm,%
               headinclude=false,%
               footinclude=false,open=any,%
               fontsize=11pt,%
               oneside,%
               paper=210mm:11in]%
               {scrbook}






\usepackage[noautomatic]{imakeidx}



\usepackage{microtype}
\usepackage{graphicx}
\usepackage{alltt}
\usepackage{verbatim}
\usepackage[shortlabels]{enumitem}
\usepackage{tabularx}
\usepackage[normalem]{ulem}
\def\hsout{\bgroup \ULdepth=-.55ex \ULset}
% https://tex.stackexchange.com/questions/22410/strikethrough-in-section-title
% Unclear if \protect \hsout is needed. Doesn't looks so
\DeclareRobustCommand{\sout}[1]{\texorpdfstring{\hsout{#1}}{#1}}
\usepackage{wrapfig}

% avoid breakage on multiple <br><br> and avoid the next [] to be eaten
\newcommand*{\forcelinebreak}{\strut\\*{}}

\newcommand*{\hairline}{%
  \bigskip%
  \noindent \hrulefill%
  \bigskip%
}

% reverse indentation for biblio and play

\newenvironment*{amusebiblio}{
  \leftskip=\parindent
  \parindent=-\parindent
  \smallskip
  \indent
}{\smallskip}

\newenvironment*{amuseplay}{
  \leftskip=\parindent
  \parindent=-\parindent
  \smallskip
  \indent
}{\smallskip}

\newcommand*{\Slash}{\slash\hspace{0pt}}


% http://tex.stackexchange.com/questions/3033/forcing-linebreaks-in-url
\PassOptionsToPackage{hyphens}{url}\usepackage[hyperfootnotes=false,hidelinks,breaklinks=true]{hyperref}
\usepackage{bookmark}

\usepackage[english,shorthands=off]{babel}
\babelfont{rm}[Path=/usr/share/fonts/truetype/cmu/,%
 BoldFont=cmunbx.ttf,%
 BoldItalicFont=cmunbi.ttf,%
 ItalicFont=cmunti.ttf]{cmunrm.ttf}
\babelfont{tt}[Scale=MatchLowercase,%
 Path=/usr/share/fonts/truetype/cmu/,%
 BoldFont=cmuntb.ttf,%
 BoldItalicFont=cmuntx.ttf,%
 ItalicFont=cmunit.ttf]{cmuntt.ttf}
\babelfont{sf}[Scale=MatchLowercase,%
 Path=/usr/share/fonts/truetype/cmu/,%
 BoldFont=cmunsx.ttf,%
 BoldItalicFont=cmunso.ttf,%
 ItalicFont=cmunsi.ttf]{cmunss.ttf}



\renewcommand*{\partpagestyle}{empty}


% global style

\pagestyle{plain}




\usepackage{indentfirst}

% remove the numbering
\setcounter{secnumdepth}{-2}

% remove labels from the captions
\renewcommand*{\captionformat}{}
\renewcommand*{\figureformat}{}
\renewcommand*{\tableformat}{}
\KOMAoption{captions}{belowfigure,nooneline}
\addtokomafont{caption}{\centering}







\deffootnote[3em]{0em}{4em}{\textsuperscript{\thefootnotemark}~}


\addtokomafont{disposition}{\rmfamily}
\addtokomafont{descriptionlabel}{\rmfamily}


\frenchspacing
% avoid vertical glue
\raggedbottom

% this will generate overfull boxes, so we need to set a tolerance
% \pretolerance=1000
% pretolerance is what is accepted for a paragraph without
% hyphenation, so it makes sense to be strict here and let the user
% accept tweak the tolerance instead.
\tolerance=200
% Additional tolerance for bad paragraphs only
\setlength{\emergencystretch}{30pt}

% (try to) forbid widows/orphans
\clubpenalty=10000
\widowpenalty=10000





% given that we said footinclude=false, this should be safe
\setlength{\footskip}{2\baselineskip}
\setlength{\parindent}{15pt}

\title{An uncountable union of line segments with null two-dimensional measure}
\date{October 2023}
\author{Parker Kuklinski}
\subtitle{}






% https://groups.google.com/d/topic/comp.text.tex/6fYmcVMbSbQ/discussion
\hypersetup{%
pdfencoding=auto,
pdftitle={An uncountable union of line segments with null two-dimensional measure},%
pdfauthor={Parker Kuklinski},%
pdfsubject={},%
pdfkeywords={Analysis of Ted's Ideas \& Actions}%
}


\begin{document}









  \begin{titlepage}


  \strut\vskip 2em
  \begin{center}

  {\usekomafont{title}{\huge An uncountable union of line segments with null two-dimensional measure\par}}%
  \vskip 1em
  
  \vskip 2em
  
  {\usekomafont{author}{Parker Kuklinski\par}}%
  
  \vskip 1.5em



   
   \vfill



  
  {\usekomafont{date}{October 2023\par}}%
  


  \end{center}


     \end{titlepage}
     
     \cleardoublepage





\tableofcontents
% start a new right-handed page

\cleardoublepage



\chapter{Image copy}



\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-10.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-2.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-3.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-4.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-5.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-6.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-7.jpg}
\end{figure}


\begin{figure}[htbp!]
\centering
\includegraphics[keepaspectratio=true,height=\textheight,width=\textwidth]{p-k-parker-kuklinski-an-uncountable-union-of-line-8.jpg}
\end{figure}




\bigskip

\chapter{Text copy with conversion errors}


The version below contains many errors where symbols haven't been converted to html correctly, but it may be useful for word searching, such as being able to click the hyperlinked references at the end of the document and helping this document show up in searches.


\hairline

\section{Abstract}


In this paper we construct an uncountable union of line segments \emph{T} which has full intersection with the sets (\{0 \}× [0\emph{,}1]) ∪ (\{1 \}× [0\emph{,}1]) ⊂ R2 but has null two-dimensional measure. Further results are proved on the decay rate of \emph{µ}(\emph{T}) if the line segments comprising \emph{T} are replaced with increasingly fine approximations by parallelograms.

\section{1. Introduction}


In\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, Kaczynski proves a variety of results placing restrictions on possible boundary functions of a half-plane function with some property. The last result is different; he constructs a measurable half plane function \emph{f} with a nonmeasurable boundary function. Crucial to this construction is a measure theoretic generalization of the trapezoid formula which we document here. For the remainder of the paper, let \emph{X}0 = \{(\emph{x,y}) : \emph{y} = 0\} and \emph{X}1 = \{(\emph{x,y}) : \emph{y} = 1\}, let \emph{µ} refer to Lebesgue measure in the contextually obvious dimension (we will distinguish \emph{µ}1 and \emph{µ}2 to refer to one and two-dimensional Lebesgue measure respectively when necessary), and let \emph{µ}∗ refer to outer measure.


\textbf{Definition 1} \emph{A} trapezoid \emph{T} = ∪\emph{ℓ is a disjoint union of line segments with each segment having its two endpoints on X}0 \emph{and X}1 \emph{(i.e. ℓ} = \{((1 − \emph{t})\emph{x}0 + \emph{tx}1\emph{,t}) : \emph{t} ∈ [0\emph{,}1]\}\emph{).}


If \emph{T} is a trapezoid, let \emph{T}0 = \emph{T} ∩ \emph{X}0 and \emph{T}1 = \emph{T} ∩ \emph{X}1. In\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, Kaczynski proved the following result:


\textbf{Theorem 1} \emph{If T is a trapezoid, then} \emph{.}


This theorem was used to construct a collection of non-intersecting paths (not lines) \emph{γx} corresponding to each point \emph{x} ∈ [0\emph{,}1] such that for each path lim\emph{t}→0 \emph{γx}(\emph{t}) = (\emph{x,}0) but the union satisfies


This construction immediately leads to the creation of a measurable half plane function with non-measurable boundary function\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}. We depict the situation in Figure 1.


One may wonder the extent to which this result holds if we omit the restriction that the lines of a trapezoid are not disjoint. To this end, we amend the trapezoid definition:


\textbf{Definition 2} \emph{An} unrestricted trapezoid \emph{T} = ∪\emph{ℓ is a union (not necessarily disjoint) of line segments with each segment having its two endpoints on X}0 \emph{and X}1 \emph{(i.e. ℓ} = \{((1 − \emph{t})\emph{x}0 + \emph{tx}1\emph{,t}) : \emph{t} ∈ [0\emph{,}1]\}\emph{).}


In\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, Kaczynski proves that there is no sensible upper bound in terms of \emph{µ}1(\emph{T}0) and \emph{µ}1(\emph{T}1) on the two dimensional measure of an unrestricted trapezoid.


\textbf{Theorem 2} \emph{There exists an unrestricted trapezoid T with µ}1(\emph{T}0) = \emph{µ}1(\emph{T}1) = 0 \emph{and µ}2(\emph{T}) = ∞\emph{.}


\textbf{Proof:} Let \emph{M} be a residual set of measure zero (e.x. let \emph{xk} be an enumeration of rationals and \emph{M} =


). For any point (\emph{x,y}) (\emph{y} ∈ (0\emph{,}1)) and line \emph{ℓ} passing through (\emph{x,y})


with angle \emph{θ} with the \emph{x}-axis, let \emph{F}0(\emph{θ}) = (\emph{x} − \emph{y} cot(\emph{θ})\emph{,}0) and \emph{F}1(\emph{θ}) = (\emph{x} + (1 − \emph{y})cot(\emph{θ})\emph{,}1) denote the intersections \emph{ℓ} ∩ \emph{X}0 and \emph{ℓ} ∩ \emph{X}1 respectively. \emph{F}0 and \emph{F}1 are homeomorphisms from (0\emph{,π}) onto \emph{X}0 and \emph{X}1 respectively, so) are both residual sets of measure zero. Since the intersection of residual



\bigskip


Figure 1: Plot of ∪\emph{γx} for \emph{x} ∈ [0\emph{,}1] where \emph{γx}1 ∩ \emph{γx}2 = ∅, lim\emph{t}→0 \emph{γx}(\emph{t}) = (\emph{x,}0), but = 0. Given a nonmeasurable function \emph{φ}(\emph{x}), if we define \emph{f} : (R × (0\emph{,}∞)) → R as \emph{f}(\emph{γx}) = \emph{φ}(\emph{x}) and vanishing elsewhere, then \emph{f} is measurable in the upper half plane but has a nonmeasurable boundary function \emph{φ}.


sets is nonempty, for every (\emph{x,y}) with \emph{y} ∈ (0\emph{,}1) we can choose an angle) such that the line \emph{ℓ} intersecting (\emph{x,y}) with angle \emph{α} intersects \emph{X}0 ∩\emph{M} and \emph{X}1 ∩\emph{M}. Let the unrestricted trapezoid \emph{T} be the union of all such lines so that \emph{µ}1(\emph{T}0) = \emph{µ}1(\emph{T}1) = \emph{µ}1(\emph{M}) = 0 and \emph{µ}2(\emph{T}) = \emph{µ}2(\{(\emph{x,y})\emph{,y} ∈ (0\emph{,}1)\}) = ∞. □.

\section{2. No lower bound}


In\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, Kaczynski poses the opposite question as an open problem, asking if there is a lower bound on the twodimensional measure of an unrestricted trapezoid in terms of \emph{µ}(\emph{T}0) and \emph{µ}(\emph{T}1). We will prove the following theorem indicating no lower bound exists:


\textbf{Theorem 3} \emph{There exists an unrestricted trapezoid T with µ}1(\emph{T}0) = \emph{µ}1(\emph{T}1) = ∞ \emph{and µ}2(\emph{T}) = 0\emph{.}


Since it suffices to find an unrestricted trapezoid with measure zero and sets \emph{µ}(\emph{T}0) = \emph{µ}(\emph{T}1) = \emph{µ}([0\emph{,}1]) = 1, we can formulate the question a different way:


\textbf{Proposition 1} \emph{There exists a bijection f} : [0\emph{,}1] → [0\emph{,}1] \emph{such that, for the set}


\noindent \emph{S} = [ [ ((1 − \emph{t})\emph{x} + \emph{tf}(\emph{x})\emph{,t})\emph{,}


\emph{t}∈[0\emph{,}1] \emph{x}∈[0\emph{,}1]


\emph{we have µ}(\emph{S}) = 0\emph{.}


It is clear that Theorem 3 is a corollary of Proposition 1.


It is perhaps not immediate that such a function should exist. Any monotone \emph{f} induces a standard trapezoid which abides by Theorem 1. The choice \emph{f}(\emph{x}) = 1 − \emph{x} gives measure \emph{µ}(\emph{S}) = 1\emph{\Slash{}}2, and other decreasing functions cannot be massaged to induce a smaller measure. We will instead draw inspiration



\bigskip


Figure 2: Examples of the fractal construction of an unrestricted trapezoid with null measure. (\emph{Left}) The base pattern induced by \emph{f}1 (\emph{Right}) Illustration of unrestricted trapezoid induced by \emph{f}.


from fractal geometry\footnote{Kenneth J. Falconer. \emph{Techniques in fractal geometry}, volume 3. Chichester: Wiley, 1997.}; the particular iterative scheme we choose will create one-dimensional slices in \emph{x} similar to the Cantor middle third set. In Figure 2, the basic pattern is represented by the piecewise function



\bigskip


otherwise we divide [0\emph{,}1] into three subintervals and connect them via parallelograms where \emph{f}1 essentially swaps the second and the third. In this case, \emph{µ}(\emph{S}) = 5\emph{\Slash{}}6. In each subsequent iteration we embed an affine transformed version of the base pattern in each parallelogram, thus reducing the total measure of the unrestricted trapezoid (we will prove this limits to zero as in Proposition 1).


Since this procedure iteratively divides subintervals of [0\emph{,}1] in 3, it is perhaps not surprising that this this sequence of functions \{\emph{fk}\} has a natural representation on base 3 fractions, namely


\emph{f}\emph{k}(0\emph{.x}1\emph{x}2\emph{x}3\emph{,,,}) = 0\emph{.y}1\emph{y}2\emph{\dots{}y}\emph{kx}\emph{k}+1\emph{x}\emph{k}+2\emph{\dots{}}


where \emph{yj} = 2\emph{xj} (mod 3). Let \emph{f} = lim\emph{k}→∞ \emph{fk} such that for input \emph{x} ∈ [0\emph{,}1], \emph{f} replaces every 1 in its base 3 expansion with a 2 and vice-versa. We will prove that this function satisfies proposition 1. Before we prove proposition 1, we will state a result from\footnote{Richard Kenyon. Projecting the one-dimensional sierpinski gasket. \emph{Israel Journal of Mathematics}, 97:221–238, 1997.} on modified Cantor sets: \textbf{Proposition 2} \emph{Let Ct be a modified Cantor set with representation}


\emph{.}


\emph{Then the following holds:}


\emph{in lowest terms, p} + \emph{q} ≡ 0 \emph{(mod 3)}


We are now ready to prove Proposition 1.


\textbf{Proof of Proposition 1:} Let us define \emph{f} acting on base 3 fractions as


\emph{fk}(0\emph{.x}1\emph{x}2\emph{x}3\emph{,,,}) = 0\emph{.y}1\emph{y}2\emph{y}3\emph{\dots{}}


where \emph{yj} = 2\emph{xj} (mod 3). Then the linear combination (1 − \emph{t})\emph{x} + \emph{tf}(\emph{x}) satisfies


\emph{.}


Since \emph{St} is just a scaled copy of \emph{C}(2−\emph{t})\emph{\Slash{}}(1+\emph{t}), by Proposition 2 we have the measure


in lowest terms, \emph{p} + \emph{q} ≡ 0 (mod 3)


Since \emph{µ}1(\emph{St}) takes on nonzero value at only countably many \emph{t}, the result follows from Fubini’s theorem. □

\section{3. Parallelogram formulation}


Over 30 yeara after\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, Kaczynski would outline a reformulation of the problem, offering three conjectures on the matter\footnote{Yahoo! News. The unabomber letters: A yahoo news special report, 2016. \href{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}{\texttt{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}}.}. Rather than conceiving the unrestricted trapezoid as a union of lines, Kaczynski considered unions of increasingly thinner parallelograms.


\textbf{Definition 3} \emph{Let} \emph{be a parallelogram with parallel sides} [(\emph{j} − 1)\emph{\Slash{}n,j\Slash{}n}] × \{0 \} \emph{and} [(\emph{k} − 1)\emph{\Slash{}n,k\Slash{}n}] × \{1 \}\emph{. For σ} ∈ \emph{Sym}(\emph{n})\emph{, we say that the} unrestricted trapezoid \emph{is given by the union}\emph{.}


In this way, the unrestricted trapezoid associated with \emph{f}1 above can be expressed as.


The following conjectures center around properties of the smallest unrestricted trapezoid of \emph{n} parallelograms of width 1\emph{\Slash{}n}, namely


\textbf{Conjecture 1} lim\emph{n}→∞ \emph{α}(\emph{n}) = 0\emph{.}


Kaczynski claimed to have proved this. We will show that this follows from Propoition 1 in the following section.


\textbf{Conjecture 2} \emph{There exists constants c}± \emph{>} 0 \emph{such that} \emph{.}


Kaczynski claimed to be able to prove that \emph{c}− exists and also claimed a weaker upper bound in the form of \emph{α}(\emph{n}) \emph{< c}+ (log(log\emph{n}))2 \emph{\Slash{}}log\emph{n}. We will prove a different upper bound.


\textbf{Conjecture 3} \emph{The sequence α}(\emph{n}) \emph{decreases monotonically.}


This was left as an open problem in\footnote{Yahoo! News. The unabomber letters: A yahoo news special report, 2016. \href{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}{\texttt{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}}.}.

\section{4. Proving the conjectures}


To prove conjectures from the previous section, we first connect projections of the Sierpinski gasket\footnote{Richard Kenyon. Projecting the one-dimensional sierpinski gasket. \emph{Israel Journal of Mathematics}, 97:221–238, 1997.} to our modified Cantor sets.


\textbf{Definition 4} \emph{We define the} Sierpinski gasket G ⊂ R2 \emph{as}


\emph{.}


\emph{We define the n}th partial Sierpinski gasket G\emph{n} ⊃ G \emph{similarly. Let} \emph{and let} ∆(\emph{a,b,c}) \emph{be the area bounded by the triangle with vertices a,b,c} ∈ R2\emph{.}



\bigskip


Let the projection operator proj\emph{θ} : R2 → R map points (\emph{x,y}) ∈ R2 onto a line through the origin with angle \emph{θ} to the \emph{x}-axis such that proj\emph{θ} : (\emph{x,y}) 7→ \emph{x}cos\emph{θ} + \emph{y} sin\emph{θ}. We are interested in the sets proj\emph{θ}(G\emph{n}); more generally there is an active field of research surrounding linear projections of fractals in R2\footnote{Izabella L aba. Recent progress on favard length estimates for planar cantor sets. In \emph{Operator-Related Function Theory and Time-Frequency Analysis}, pages 117–145. Cham: Springer International Publishing.}. One of the major subjects of interest is the following:


\textbf{Definition 5} \emph{The} Favard distance \emph{of a compact set E} ⊂ R2 \emph{is given by}


\emph{Fav}


While it is perhaps obvious that Fav(G) = 0 from proposition 2, a result by Bond and Volberg\footnote{Matthew Bond and Alexander Volberg. The power law for buffon’s needle landing near the sierpinski gasket. arXiv preprint arXiv:0911.0233, 2009.} gives a decay bound on the Favard distances of partial Sierpinski gaskets.


\textbf{Proposition 3} \emph{There exist constants C,p >} 0 \emph{such that Fav}(G\emph{n}) ≤ \emph{Cn}−\emph{p}\emph{.}


A later result by Bond and Volberg proves that \emph{p >} 1\emph{\Slash{}}14\footnote{Matthew Bond and Alexander Volberg. Buffon needle lands in \emph{ϵ}-neighborhood of a 1-dimensional sierpinski gasket with probability at most \textbar{}log\emph{ϵ}\textbar{}−\emph{c}. \emph{Comptes Rendus. Math´ematique}, 348(11-12):653– 656, 2010.}.


The rest of this section centers around utilizing proposition 3 to prove the conjectures from section 3. To do this, we must compare proj\emph{θ}(G\emph{n}) to the modified Cantor sets from Proposition 2 and the horizontal slices of the unrestricted trapezoid. Let us define partial variants of these sets:


\textbf{Definition 6} Let . If is the unrestricted trapezoid associated with the nth iteration induced by swapping 1 ↔ 2 in a base 3 expansion (i.e. if x − 1 = xnxn−1\dots{}x1 is an n-digit base 3 number, then σ(x − 1) + 1 = ynyn−1\dots{}y1 where yk = 2xk (mod 3)), then we write S(n)t = (R × \{t\}) ∩ Tσ3n, the slice of, as



\bigskip


\emph{We similarly define the n}th partial modified Cantor set \emph{as}



\bigskip


This allows us to make the following comparison:


\textbf{Lemma 1} \emph{For t} ∈ [0\emph{,}1] \emph{and}\emph{, we have}



\bigskip


\textbf{Proof:} We can show that for \emph{t} ≥ 0 since



\bigskip


The result then follows from noticing that for, we have proj. □


Combining these results leads us to a similar polynomial bound on the decay of the unrestricted trapezoids induced by the iterative scheme described in Definition 6.


\textbf{Proposition 4} \emph{Let σ be the permutation on base 3 numbers as defined in Definition 6. Then there exist constants C,p >} 0 \emph{such that} \emph{.}


\textbf{Proof:} By Fubini’s theorem, The measure of is given by integrating over the measures of the horizontal slices



\bigskip


From Lemma 1, this integral can be bound by an integral over projections of the Sierpinski gasket:



\bigskip


By the change of variables \emph{θ} = \emph{φ}(\emph{t}), we can write:


(proj\emph{θ}(G\emph{n}))\emph{dθ} Placing an estimate on the trigonometric portion of the integral we can write


(proj


Since Lebesgue measure is nonnegative, we can extend the limits of integration to bound the measure of by a factor of the associated Favard distance


Fav(G\emph{n})


Proposition 3 completes the proof. □


This result translates to a logarithmic bound on \emph{α}(\emph{n}) \emph{only} for \emph{n} = 3\emph{m} where \emph{m} ∈ N. If \emph{n} has the base 3 representation \emph{n} = \emph{xkxk}−1\emph{\dots{}x}0, we can define \emph{σn} as in Figure 3 such that the first \emph{xk}3\emph{k} intervals map to \emph{xk} copies of, the next \emph{xk}−13\emph{k}−1 intervals map to \emph{xk}−1 copies of, etc. Using this scheme, we can prove a weaker upper bound on Conjecture 2 (consequently proving Conjecture 1 as well):


\textbf{Theorem 4} \emph{There exist constants C,p >} 0 \emph{such that α}(\emph{n}) \emph{< C\Slash{}}(log\emph{n})\emph{p.}


Before proving this theorem, we supply a technical lemma:


\textbf{Lemma 2} \emph{For p} ∈ (0\emph{,}1)\emph{, there exists a constant C such that}



\bigskip


\textbf{Proof:} Let us make the change of variables \emph{t} = 1 − \emph{x\Slash{}n} such that this integral can be transformed into



\bigskip


For any constant \emph{C >} 1, we can find \emph{t}0 dependent only on \emph{C,p} such that \emph{pt} + 1 \emph{>} (1 − \emph{t})−\emph{p} for \emph{t} ∈ (0\emph{,t}0). This allows us to split the integral



\bigskip


Both of these integrals have closed form expressions, the leading asymptotic term 1\emph{\Slash{}n} arising from the left integral, thus completing the proof.□


\textbf{Proof of Theorem 4:} It is clear that. Let \emph{n} = \emph{xkxk}−1\emph{\dots{}x}0 be a base 3 integer representation. Then the following holds:



\bigskip



\bigskip


Figure 3: Examples of parallelogram-defined unrestricted trapezoids where \emph{σ} is as outlined in the proof of Theorem 4 (\emph{Left}) \emph{n} = 1000 which has base-3 representation 1101001 (\emph{Right}) \emph{n} = 2000 which has base-3 representation 2202002.


Each digit must satisfy \emph{xj} ≤ 2, and by Proposition 4 there exist constants \emph{C,p >} 0 such that, so we may write



\bigskip


Since the function \emph{f}(\emph{x}) = 3\emph{xx}−\emph{p} is increasing for \emph{x >p\Slash{}}log3(\emph{x}), we can bound this sum by the integral



\bigskip


By making the change of variables \emph{x} = \emph{u}log3 \emph{e}, we can write



\bigskip


The result follows from applying Lemma 2 and collecting constants. □ \textbf{5 Application to Cluster Sets}


While Theorem 1 assisted in constructing a measurable half-plane function with nonmeasurable boundary function in\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, the open questions from\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.} and\footnote{Yahoo! News. The unabomber letters: A yahoo news special report, 2016. \href{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}{\texttt{https://www.yahoo.com/entertainment/the-unabomber-letters---a-yahoo-news-special-report-170846210.html}}.} answered by Propositions 1 and 4 were also initially conceived to address problems related to boundary functions and cluster sets. We state the relevant material here for completeness.


\textbf{Definition 7} \emph{Given a function defined on the open unit disk f} : D → C \emph{and a Jordan arc γ with an endpoint on the boundary of the disk, we say that C}(\emph{f,γ}) \emph{is the} cluster set \emph{of f on γ where}


\emph{C}(\emph{f,γ}) = \{\emph{w} ∈ C : ∃\{\emph{zn}\} \emph{s.t. zn} ∈ \emph{γ,}\textbar{}lim\emph{zn}\textbar{} = 1\emph{,}lim\emph{f}(\emph{zn}) = \emph{w}\}


\textbf{Definition 8} \emph{Let γ}1\emph{,γ}2\emph{,γ}3 ⊂ D \emph{be Jordan arcs with a similar endpoint z on the unit circle. If, for a disk function f, the intersection satisfies C}(\emph{f,γ}1) ∩ \emph{C}(\emph{f,γ}2) ∩ \emph{C}(\emph{f,γ}3) = ∅\emph{, then f has the} three-arc property \emph{at z. If each γ}1\emph{,γ}2\emph{,γ}3 \emph{is a union of rectilinear segments, then we say f has the} three-segment property \emph{at z.}


In\footnote{Theodore John Kaczynski. \emph{Boundary Functions}. PhD thesis, University of Michigan, 1967.}, a version of conjecture 1 was suggested to assist in answering the following open question from\footnote{Frederick Bagemihl, George Piranian, and G. S. Young. Intersections of cluster sets. \emph{Bulletin of the Polytechnic Institute of Ias}\emph{,i}, 5(9):29–34, 1959.} (presented as conjecture):


\textbf{Conjecture 4} \emph{There exists a continuous function in} D \emph{having the three-segment property at each point of a set of positive measure or second category on} \textbar{}\emph{z}\textbar{} = 1\emph{.}


Weaker versions of this conjecture have been proved. Jarn´ık\footnote{Vojtˇech Jarn´ık. Sur les fonctions de deux variables r´eelles. \emph{Fundamenta Mathematicae}, 27:147–150, 1936.} gave an example of a function having the three-segment property at uncountably many points. Piranian was cited in\footnote{Frederick Bagemihl, George Piranian, and G. S. Young. Intersections of cluster sets. \emph{Bulletin of the Polytechnic Institute of Ias}\emph{,i}, 5(9):29–34, 1959.} as having proved the existence of a continuous disk function with the three-arc (not segment) property. Bagemihl later proved the existence of a normal meromorphic (not continuous) disk function with the three-segment property\footnote{Frederick Bagemihl. The three-arc and three-separated-arc properties of meromorphic functions. \emph{Nagoya Mathematical Journal}, 53:137–140, 1974.}.

\section{References}









% begin final page

\clearpage



% new page for the colophon

\thispagestyle{empty}

\begin{center}

The Ted K Archive





\strut

\end{center}

\strut

\vfill

\begin{center}


Parker Kuklinski

An uncountable union of line segments with null two-dimensional measure



October 2023


\bigskip


<\href{https://arxiv.org/abs/2311.16210}{arxiv.org\Slash{}abs\Slash{}2311.16210}>
   

       

       
         See the attached file below and furthest right for the original PDF.
       

       

       

       

       

   



\bigskip
\textbf{www.thetedkarchive.com}


\end{center}

% end final page with colophon


% end closing pages



\end{document}


% No format ID passed.



