\documentclass[12pt,titlepage]{article}

\usepackage{amsmath}
\usepackage{mathrsfs}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{mathtools}
\usepackage{graphicx}
\usepackage{color}
\usepackage{ucs}
\usepackage[utf8x]{inputenc}
\usepackage{xparse}
\usepackage{hyperref}

%----Macros----------
%
% Unresolved issues:
%
%  \righttoleftarrow
%  \lefttorightarrow
%
%  \color{} with HTML colorspec
%  \bgcolor
%  \array with options (without options, it's equivalent to the matrix environment)

% Of the standard HTML named colors, white, black, red, green, blue and yellow
% are predefined in the color package. Here are the rest.
\definecolor{aqua}{rgb}{0, 1.0, 1.0}
\definecolor{fuschia}{rgb}{1.0, 0, 1.0}
\definecolor{gray}{rgb}{0.502, 0.502, 0.502}
\definecolor{lime}{rgb}{0, 1.0, 0}
\definecolor{maroon}{rgb}{0.502, 0, 0}
\definecolor{navy}{rgb}{0, 0, 0.502}
\definecolor{olive}{rgb}{0.502, 0.502, 0}
\definecolor{purple}{rgb}{0.502, 0, 0.502}
\definecolor{silver}{rgb}{0.753, 0.753, 0.753}
\definecolor{teal}{rgb}{0, 0.502, 0.502}

% Because of conflicts, \space and \mathop are converted to
% \itexspace and \operatorname during preprocessing.

% itex: \space{ht}{dp}{wd}
%
% Height and baseline depth measurements are in units of tenths of an ex while
% the width is measured in tenths of an em.
\makeatletter
\newdimen\itex@wd%
\newdimen\itex@dp%
\newdimen\itex@thd%
\def\itexspace#1#2#3{\itex@wd=#3em%
\itex@wd=0.1\itex@wd%
\itex@dp=#2ex%
\itex@dp=0.1\itex@dp%
\itex@thd=#1ex%
\itex@thd=0.1\itex@thd%
\advance\itex@thd\the\itex@dp%
\makebox[\the\itex@wd]{\rule[-\the\itex@dp]{0cm}{\the\itex@thd}}}
\makeatother

% \tensor and \multiscript
\makeatletter
\newif\if@sup
\newtoks\@sups
\def\append@sup#1{\edef\act{\noexpand\@sups={\the\@sups #1}}\act}%
\def\reset@sup{\@supfalse\@sups={}}%
\def\mk@scripts#1#2{\if #2/ \if@sup ^{\the\@sups}\fi \else%
  \ifx #1_ \if@sup ^{\the\@sups}\reset@sup \fi {}_{#2}%
  \else \append@sup#2 \@suptrue \fi%
  \expandafter\mk@scripts\fi}
\def\tensor#1#2{\reset@sup#1\mk@scripts#2_/}
\def\multiscripts#1#2#3{\reset@sup{}\mk@scripts#1_/#2%
  \reset@sup\mk@scripts#3_/}
\makeatother

% \slash
\makeatletter
\newbox\slashbox \setbox\slashbox=\hbox{$/$}
\def\itex@pslash#1{\setbox\@tempboxa=\hbox{$#1$}
  \@tempdima=0.5\wd\slashbox \advance\@tempdima 0.5\wd\@tempboxa
  \copy\slashbox \kern-\@tempdima \box\@tempboxa}
\def\slash{\protect\itex@pslash}
\makeatother

% math-mode versions of \rlap, etc
% from Alexander Perlis, "A complement to \smash, \llap, and lap"
%   http://math.arizona.edu/~aprl/publications/mathclap/
\def\clap#1{\hbox to 0pt{\hss#1\hss}}
\def\mathllap{\mathpalette\mathllapinternal}
\def\mathrlap{\mathpalette\mathrlapinternal}
\def\mathclap{\mathpalette\mathclapinternal}
\def\mathllapinternal#1#2{\llap{$\mathsurround=0pt#1{#2}$}}
\def\mathrlapinternal#1#2{\rlap{$\mathsurround=0pt#1{#2}$}}
\def\mathclapinternal#1#2{\clap{$\mathsurround=0pt#1{#2}$}}

% Renames \sqrt as \oldsqrt and redefine root to result in \sqrt[#1]{#2}
\let\oldroot\root
\def\root#1#2{\oldroot #1 \of{#2}}
\renewcommand{\sqrt}[2][]{\oldroot #1 \of{#2}}

% Manually declare the txfonts symbolsC font
\DeclareSymbolFont{symbolsC}{U}{txsyc}{m}{n}
\SetSymbolFont{symbolsC}{bold}{U}{txsyc}{bx}{n}
\DeclareFontSubstitution{U}{txsyc}{m}{n}

% Manually declare the stmaryrd font
\DeclareSymbolFont{stmry}{U}{stmry}{m}{n}
\SetSymbolFont{stmry}{bold}{U}{stmry}{b}{n}

% Manually declare the MnSymbolE font
\DeclareFontFamily{OMX}{MnSymbolE}{}
\DeclareSymbolFont{mnomx}{OMX}{MnSymbolE}{m}{n}
\SetSymbolFont{mnomx}{bold}{OMX}{MnSymbolE}{b}{n}
\DeclareFontShape{OMX}{MnSymbolE}{m}{n}{
    <-6>  MnSymbolE5
   <6-7>  MnSymbolE6
   <7-8>  MnSymbolE7
   <8-9>  MnSymbolE8
   <9-10> MnSymbolE9
  <10-12> MnSymbolE10
  <12->   MnSymbolE12}{}

% Declare specific arrows from txfonts without loading the full package
\makeatletter
\def\re@DeclareMathSymbol#1#2#3#4{%
    \let#1=\undefined
    \DeclareMathSymbol{#1}{#2}{#3}{#4}}
\re@DeclareMathSymbol{\neArrow}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\neArr}{\mathrel}{symbolsC}{116}
\re@DeclareMathSymbol{\seArrow}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\seArr}{\mathrel}{symbolsC}{117}
\re@DeclareMathSymbol{\nwArrow}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\nwArr}{\mathrel}{symbolsC}{118}
\re@DeclareMathSymbol{\swArrow}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\swArr}{\mathrel}{symbolsC}{119}
\re@DeclareMathSymbol{\nequiv}{\mathrel}{symbolsC}{46}
\re@DeclareMathSymbol{\Perp}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\Vbar}{\mathrel}{symbolsC}{121}
\re@DeclareMathSymbol{\sslash}{\mathrel}{stmry}{12}
\re@DeclareMathSymbol{\bigsqcap}{\mathop}{stmry}{"64}
\re@DeclareMathSymbol{\biginterleave}{\mathop}{stmry}{"6}
\re@DeclareMathSymbol{\invamp}{\mathrel}{symbolsC}{77}
\re@DeclareMathSymbol{\parr}{\mathrel}{symbolsC}{77}
\makeatother

% \llangle, \rrangle, \lmoustache and \rmoustache from MnSymbolE
\makeatletter
\def\Decl@Mn@Delim#1#2#3#4{%
  \if\relax\noexpand#1%
    \let#1\undefined
  \fi
  \DeclareMathDelimiter{#1}{#2}{#3}{#4}{#3}{#4}}
\def\Decl@Mn@Open#1#2#3{\Decl@Mn@Delim{#1}{\mathopen}{#2}{#3}}
\def\Decl@Mn@Close#1#2#3{\Decl@Mn@Delim{#1}{\mathclose}{#2}{#3}}
\Decl@Mn@Open{\llangle}{mnomx}{'164}
\Decl@Mn@Close{\rrangle}{mnomx}{'171}
\Decl@Mn@Open{\lmoustache}{mnomx}{'245}
\Decl@Mn@Close{\rmoustache}{mnomx}{'244}
\makeatother

% Widecheck
\makeatletter
\DeclareRobustCommand\widecheck[1]{{\mathpalette\@widecheck{#1}}}
\def\@widecheck#1#2{%
    \setbox\z@\hbox{\m@th$#1#2$}%
    \setbox\tw@\hbox{\m@th$#1%
       \widehat{%
          \vrule\@width\z@\@height\ht\z@
          \vrule\@height\z@\@width\wd\z@}$}%
    \dp\tw@-\ht\z@
    \@tempdima\ht\z@ \advance\@tempdima2\ht\tw@ \divide\@tempdima\thr@@
    \setbox\tw@\hbox{%
       \raise\@tempdima\hbox{\scalebox{1}[-1]{\lower\@tempdima\box
\tw@}}}%
    {\ooalign{\box\tw@ \cr \box\z@}}}
\makeatother

% \mathraisebox{voffset}[height][depth]{something}
\makeatletter
\NewDocumentCommand\mathraisebox{moom}{%
\IfNoValueTF{#2}{\def\@temp##1##2{\raisebox{#1}{$\m@th##1##2$}}}{%
\IfNoValueTF{#3}{\def\@temp##1##2{\raisebox{#1}[#2]{$\m@th##1##2$}}%
}{\def\@temp##1##2{\raisebox{#1}[#2][#3]{$\m@th##1##2$}}}}%
\mathpalette\@temp{#4}}
\makeatletter

% udots (taken from yhmath)
\makeatletter
\def\udots{\mathinner{\mkern2mu\raise\p@\hbox{.}
\mkern2mu\raise4\p@\hbox{.}\mkern1mu
\raise7\p@\vbox{\kern7\p@\hbox{.}}\mkern1mu}}
\makeatother

%% Fix array
\newcommand{\itexarray}[1]{\begin{matrix}#1\end{matrix}}
%% \itexnum is a noop
\newcommand{\itexnum}[1]{#1}

%% Renaming existing commands
\newcommand{\underoverset}[3]{\underset{#1}{\overset{#2}{#3}}}
\newcommand{\widevec}{\overrightarrow}
\newcommand{\darr}{\downarrow}
\newcommand{\nearr}{\nearrow}
\newcommand{\nwarr}{\nwarrow}
\newcommand{\searr}{\searrow}
\newcommand{\swarr}{\swarrow}
\newcommand{\curvearrowbotright}{\curvearrowright}
\newcommand{\uparr}{\uparrow}
\newcommand{\downuparrow}{\updownarrow}
\newcommand{\duparr}{\updownarrow}
\newcommand{\updarr}{\updownarrow}
\newcommand{\gt}{>}
\newcommand{\lt}{<}
\newcommand{\map}{\mapsto}
\newcommand{\embedsin}{\hookrightarrow}
\newcommand{\Alpha}{A}
\newcommand{\Beta}{B}
\newcommand{\Zeta}{Z}
\newcommand{\Eta}{H}
\newcommand{\Iota}{I}
\newcommand{\Kappa}{K}
\newcommand{\Mu}{M}
\newcommand{\Nu}{N}
\newcommand{\Rho}{P}
\newcommand{\Tau}{T}
\newcommand{\Upsi}{\Upsilon}
\newcommand{\omicron}{o}
\newcommand{\lang}{\langle}
\newcommand{\rang}{\rangle}
\newcommand{\Union}{\bigcup}
\newcommand{\Intersection}{\bigcap}
\newcommand{\Oplus}{\bigoplus}
\newcommand{\Otimes}{\bigotimes}
\newcommand{\Wedge}{\bigwedge}
\newcommand{\Vee}{\bigvee}
\newcommand{\coproduct}{\coprod}
\newcommand{\product}{\prod}
\newcommand{\closure}{\overline}
\newcommand{\integral}{\int}
\newcommand{\doubleintegral}{\iint}
\newcommand{\tripleintegral}{\iiint}
\newcommand{\quadrupleintegral}{\iiiint}
\newcommand{\conint}{\oint}
\newcommand{\contourintegral}{\oint}
\newcommand{\infinity}{\infty}
\newcommand{\bottom}{\bot}
\newcommand{\minusb}{\boxminus}
\newcommand{\plusb}{\boxplus}
\newcommand{\timesb}{\boxtimes}
\newcommand{\intersection}{\cap}
\newcommand{\union}{\cup}
\newcommand{\Del}{\nabla}
\newcommand{\odash}{\circleddash}
\newcommand{\negspace}{\!}
\newcommand{\widebar}{\overline}
\newcommand{\textsize}{\normalsize}
\renewcommand{\scriptsize}{\scriptstyle}
\newcommand{\scriptscriptsize}{\scriptscriptstyle}
\newcommand{\mathfr}{\mathfrak}
\newcommand{\statusline}[2]{#2}
\newcommand{\tooltip}[2]{#2}
\newcommand{\toggle}[2]{#2}

% Theorem Environments
\theoremstyle{plain}
\newtheorem{theorem}{Theorem}
\newtheorem{lemma}{Lemma}
\newtheorem{prop}{Proposition}
\newtheorem{cor}{Corollary}
\newtheorem*{utheorem}{Theorem}
\newtheorem*{ulemma}{Lemma}
\newtheorem*{uprop}{Proposition}
\newtheorem*{ucor}{Corollary}
\theoremstyle{definition}
\newtheorem{defn}{Definition}
\newtheorem{example}{Example}
\newtheorem*{udefn}{Definition}
\newtheorem*{uexample}{Example}
\theoremstyle{remark}
\newtheorem{remark}{Remark}
\newtheorem{note}{Note}
\newtheorem*{uremark}{Remark}
\newtheorem*{unote}{Note}

%-------------------------------------------------------------------

\begin{document}

%-------------------------------------------------------------------


\section*{Mochizuki&#39;s proof of abc}

[[!redirects Mochizuki's proof of abc]] [[!redirects Mochizuki's proof of abc]] [[!redirects Mochizuki's proof of abc]] [[!redirects Mochizuki's proof of abc]]

\begin{quote}%
In the references (to date not formally published) listed at \emph{[[inter-universal Teichmüller theory]]}, [[Shinichi Mochizuki]] has claimed in particular a proof of the \emph{[[abc conjecture]]}. A few weeks after the announcement of the proof Vesselin Dimitrov observed some problems in these documents and made these public in the form of a comment to the MathOverflow forum in the thread titled ``\href{http://mathoverflow.net/questions/106560/philosophy-behind-mochizukis-work-on-the-abc-conjecture/#107279}{Philosophy behind Mochizuki's work on the ABC conjecture}''. This page is hopefully eventually trying to record stable insights arising from this discussion.


\end{quote}
This page was originally created by an anonymous user. As the original post by Vesselin Dimitrov at MathOverflow is periodically revised, and this entry was created apparently without his knowledge, the contents of this entry should be treated with discretion and caution until the situation has been clarified. -- Todd Trimble

\begin{quote}%
The following is for the moment mostly verbatim copied from the MO discussion.


\end{quote}
\textbf{Completely rewritten. (9/26)}

It seems indeed that nothing like Theorem 1.10 from Mochizuki's IUTT-IV could hold.

Here is an infinite set of counterexamples, assuming for convenience two standard conjectures (the first being in fact a consequence of ABC), that contradict Thm. 1.10 \emph{very} badly.

\emph{Assumptions:}

\begin{itemize}%
\item A (Consequence of ABC) \emph{For all but finitely many elliptic curves over $\mathbb{Q}$, the conductor $N$ and the minimal discriminant $\Delta$ satisfy $\log{|\Delta|} \lt (\log{N})^2$.}


\item B (Uniform Serre Open Image conjecture) \emph{For each} $d \in \mathbb{N}$, \emph{there is a constant} $c(d) \lt \infty$ \emph{such that for every number field} $F/\mathbb{Q}$ with $[F:\mathbb{Q}] \leq d$, \emph{and every non-CM elliptic curve} $E$ \emph{over} $F$, \emph{and every prime} $\ell \geq c(d)$, \emph{the Galois representation of} $G_F$ \emph{on} $E[\ell]$ \emph{has full image} $\mathrm{GL}_2(\mathbb{Z}/{\ell})$. (In fact, it is sufficient to take the weaker version in which $F$ is held fixed. )



\end{itemize}
Further, as far as I can tell from the proof of Theorem 1.10 of IUTTIV, the only reason for taking $F \coloneqq F_{\mathrm{tpd}}\big( \sqrt{-1}, E_{F_{\mathrm{tpd}}}[3\cdot 5]
 \big)$ --- rather than simply $F \coloneqq F_{\mathrm{tpd}}(\sqrt{-1})$ --- was to ensure that $E$ has semistable reduction over $F$. \emph{Since I will only work in what follows with semistable elliptic curves over} $\mathbb{Q}$, \emph{I will assume, for a mild technical convenience in the examples below, that for elliptic curves already semistable over} $F_{\mathrm{tpd}}$, \emph{we may actually take} $F \coloneqq F_{\mathrm{tpd}}(\sqrt{-1})$ \emph{in Theorem 1.10.}

\emph{The infinite set of counterexamples.} They come from Masser's paper \emph{Masser: Note on a conjecture of Szpiro,}Asterisque* 1990\emph{, as follows. Masser has produced an infinite set of Frey-Hellougarch (i.e., semistable and with rational 2-torsion) elliptic curves over $\mathbb{Q}$ whose conductor $N$ and minimal discriminant $\Delta$ satisfy}

\begin{equation}
\frac{1}{6}\log{|\Delta|} \geq \log{N} + \frac{\sqrt{\log{N}}}{\log{\log{N}}}.
\label{eqone}\end{equation}
(Thus, $N$ in these examples may be taken arbitrarily large. ) By (A) above, taking $N$ big enough will ensure that

\begin{equation}
\log{|\Delta|} \lt (\log{N})^2.
\label{eqtwo}\end{equation}
Next, the sum of the logarithms of the primes in the interval $\big( (\log{N})^2, 3(\log{N})^2 \big)$ is $2(\log{N})^2 + o((\log{N})^2)$, so it is certainly $\gt (\log{N})^2$ for $N \gg 0$ big enough. Thus, by \eqref{eqtwo}, it is easy to see that the interval $\big( (\log{N})^2, 3(\log{N})^2 \big)$ contains a prime $\ell$ which divides neither $|\Delta|$ nor any of the exponents $\alpha = \mathrm{ord}_p(\Delta)$ in the prime factorization $|\Delta| = \prod p^{\alpha}$ of $|\Delta|$.

Consider now the pair $(E,\ell)$: it has $F_{\mathrm{mod}} = \mathbb{Q}$, and since $E$ has rational $2$-torsion, $F_{\mathrm{tpd}} = \mathbb{Q}$ as well. Let $F \coloneqq \mathbb{Q} \big(
\sqrt{-1}\big)$. I claim that, upon taking $N$ big enough, the pair $(E_F,\ell)$ arises from an \textbf{initial $\Theta$-datum} as in IUTT-I, Definition 3.1. Indeed:

\begin{itemize}%
\item Certainly (a), (e), (f) of IUTT-I, Def. 3.1 are satisfied (with appropriate $\underline{\mathbb{V}}, \, \underline{\epsilon}$);
\item (b) of IUTT-I, Def. 3.1 is satisfied since by construction $E$ is semistable over $\mathbb{Q}$;
\item (c) of IUTT-I, Def. 3.1 is satisfied, in view of (B) above and the choice of $\ell$, as soon as $N \gg 0$ is big enough (recall that $\ell \gt (\log{N})^2$ by construction!), and by the observation that, for $v$ a place of $F = \mathbb{Q}(\sqrt{-1})$, the order of the $v$-adic $q$-parameter of $E$ equals $\mathrm{ord}_v (\Delta)$, which equals $\mathrm{ord}_p(\Delta)$ for $v \mid p \gt 2$, and $2\cdot\mathrm{ord}_2(\Delta)$ for $v \mid 2$;

\end{itemize}
while $\mathbb{V}_{\mathrm{mod}}^{\mathrm{bad}}$ consists of the primes dividing $\Delta$;

\begin{itemize}%
\item Finally, (d) of IUTT-I, Def. 3.1 is satisfied upon excluding at most four of Masser's examples $E$. (See page 37 of IUTT-IV).

\end{itemize}
\textbf{Now}, take $\epsilon \coloneqq \big( \log{N} \big)^{-2}$ in Theorem 1.10 of IUTT-IV; this is certainly permissible for $N \gg 0$ large enough. \emph{I claim that the conclusion of Theorem 1.10 contradicts \eqref{eqone} as soon as $N \gg 0$ is large enough.}

For note that Mochizuki's quantity $\log(\mathfrak{q})$ is precisely $\log{|\Delta|}$ (reference: see e.g. Szpiro's article in the Grothendieck Festschrift, vol. 3); his $\log{(\mathfrak{d}^{\mathrm{tpd}})}$ is zero; his $d_{\mathrm{mod}}$ is $1$; and his $\log{(\mathfrak{f}^{\mathrm{tpd}})}$ is our $\log{N}$. By construction, our choice $\epsilon \coloneqq \big( \log{N} \big)^{-2}$ then makes $1/\ell \lt \epsilon$ and $\ell \lt 3/\epsilon$, whence the finaly display of Theorem 1.10 would yield

\begin{displaymath}
\frac{1}{6} \log{|\Delta|} \leq (1+29\epsilon) \cdot \log{N} + 2\log{(3\epsilon^{-8})}
\lt \log{N} + 16\log{\log{N}} + 32,
\end{displaymath}
where we have used $\epsilon \log{N} = (\log{N})^{-1} \lt 1$ for $N \gt 3$, and $2\log{3} \lt 3$.

\emph{The last display contradicts \eqref{eqone} as soon as $N \gg 0$ is big enough.}

Thus Masser's examples yield infinitely many counterexamples to Theorem 1.10 of IUTT-IV (as presently written).

\textbf{Added on 10/15.} Mochizuki has commented on the apparent contradiction between Masser's examples and Theorem 1.10:

$<$http://www.kurims.kyoto-u.ac.jp/{\tt \symbol{126}}motizuki/Inter-universal\%20Teichmuller\%20Theory\%20IV\%20(comments).pdf{\tt \symbol{62}}

(Point (4.) in those Comments was subsequently modified twice. ) He writes that he will revise portions of IUTT-III and IUTT-IV, and will make them available in the near future. Taking into account the latest version of point (4.) from Mochizuki's Comments, here is the anticipated revised version of Theorem 1.10 (after taking $\epsilon \sim 1/\ell$ - which is essentially optimal - and not worrying about the best constants or the most general version):

Take the pair $(E,\ell)$, where $E/\mathbb{Q}$ is a semistable elliptic curve with (say, for the sake of simplifying) rational $2$-torsion (i.e., a Frey-Hellegouarch curve) of minimal discriminant $\Delta$ and conductor $N$ (square-free). Assume that:

\begin{itemize}%
\item $\ell$ divides neither $N$ nor the any of the exponents in the prime factorization of $\Delta$;
\item The Galois representation of $G_{\mathbb{Q}(\sqrt{-1})}$ on $E[\ell]$ has full image $\mathrm{GL}_2(\mathbb{Z}/\ell)$. (\emph{Conjecturally, this condition should only exclude a finite list of values of $\ell$, independent of $E$. Therefore, it does not appear to be an essential condition here.})
\item The $2$-adic valuation of $\Delta$ is bounded. (\emph{Assume this for simplicity in the statement below. It is not truly an essential condition either}).
\item $\ell = O(\log{N})$ (Such a choice, compliant with the three previous conditions, can be ensured; see Section 2 in IUTT-IV, or the paper GenEll).

\end{itemize}
Let $M \coloneqq \prod_{p \mid N,  p \lt \ell} p$. \emph{Then}, with the corrections outlined by Mochizuki, the revised Theorem 1.10 should essentially read (and certainly \emph{imply}):

\begin{displaymath}
\frac{1}{6} \log{\Delta} \lt \Big( 1 + \frac{200}{\ell} \Big) \log{N}  + \omega(M) \cdot \log{\log{N}} - \log{M} + O\big( \log{\log{N}} \big),
\end{displaymath}
where $\omega(\cdot)$ denotes ``number of prime factors.'' If we take $\ell \sim \log{N}$ and $\omega(M)$ bounded (i.e., restrict to conductors $N$ which are only divisible by a bounded number of primes $\lt \log{N}$), then this consequence would yield $(1/6) \log{\Delta} \lt \log{N} + O(\log{\log{N}})$. (\emph{Must this be true for $N$ a large enough square-free integer such that the number of primes $\lt \log{N}$ dividing $N$ is bounded}? A reminder: in terms of the $abc$-triple, $\Delta$ is \emph{essentially} $(abc)^2$, and $N = \mathrm{rad}(abc)$).

A side remark: note that the inverse $1/\ell$ of the prime level from the de Rham-Etale correspondence $(E^{\dagger}, \lt \ell) \leftrightarrow E[\ell]$ in Mochizuki's ``Hodge-Arakelov theory'' ultimately figures as the $\epsilon$ in the ABC conjecture.

\emph{(I have deleted the remainder of the 10/15 Addendum, since it is now obsolete after Mochizuki's revised comments.)}

\textbf{Added on 3-13-13.} Mochizuki has posted revisions of his second and third papers on Inter-Universal Teichmuller Theory. They can be found at the bottom of his webpage \href{http://www.kurims.kyoto-u.ac.jp/~motizuki/papers-english.html}{here}.



\end{document}