Skip to content
Snippets Groups Projects
main.tex 25.3 KiB
Newer Older
Luke Naylor's avatar
Luke Naylor committed
%% Write basic article template

\documentclass[12pt]{article}
\usepackage{amsmath}
\usepackage{amssymb}
\usepackage{amsthm}
\usepackage{graphicx}
\usepackage{hyperref}
\usepackage{color}
\usepackage{sagetex}
\usepackage{minted}
\usepackage[]{breqn}
Luke Naylor's avatar
Luke Naylor committed

Luke Naylor's avatar
Luke Naylor committed
\newcommand{\QQ}{\mathbb{Q}}
Luke Naylor's avatar
Luke Naylor committed
\newcommand{\ZZ}{\mathbb{Z}}
\newcommand{\RR}{\mathbb{R}}
Luke Naylor's avatar
Luke Naylor committed
\newcommand{\chern}{\operatorname{ch}}
Luke Naylor's avatar
Luke Naylor committed
\newcommand{\lcm}{\operatorname{lcm}}
Luke Naylor's avatar
Luke Naylor committed
\newcommand{\firsttilt}[1]{\mathcal{B}^{#1}}
\newcommand{\bddderived}{\mathcal{D}^{b}}
\newcommand{\centralcharge}{\mathcal{Z}}
\newcommand{\minorheading}[1]{{\noindent\normalfont\normalsize\bfseries #1}}
Luke Naylor's avatar
Luke Naylor committed

\begin{document}

Luke Naylor's avatar
Luke Naylor committed
\title{Explicit Formulae for Bounds on the Ranks of Tilt Destabilizers and
Practical Methods for Finding Pseudowalls}
Luke Naylor's avatar
Luke Naylor committed

\author{Luke Naylor}

\maketitle

\section{Introduction}
\label{sec:intro}
Luke Naylor's avatar
Luke Naylor committed

[ref] shows that for any rational $\beta_0$,
the vertical line $\{\sigma_{\alpha,\beta_0} \colon \alpha \in \RR_{>0}\}$ only
Luke Naylor's avatar
Luke Naylor committed
intersects finitely many walls. A consequence of this is that if
$\beta_{-}$ is rational, then there can only be finitely many circular walls to the
Luke Naylor's avatar
Luke Naylor committed
left of the vertical wall $\beta = \mu$.
On the other hand, when $\beta_{-}$ is not rational, [ref] showed that there are
Luke Naylor's avatar
Luke Naylor committed
infinitely many walls.

This dichotomy does not only hold for real walls, realised by actual objects in
$\bddderived(X)$, but also for pseudowalls. Here pseudowalls are defined as
`potential' walls, induced by hypothetical Chern characters of destabilizers
which satisfy certain numerical conditions which would be satisfied by any real
destabilizer, regardless of whether they are realised by actual elements of
$\bddderived(X)$.

Since real walls are a subset of pseudowalls, the irrational $\beta_{-}$ case
Luke Naylor's avatar
Luke Naylor committed
follows immediately from the corresponding case for real walls.
However, the rational $\beta_{-}$ case involves showing that the following
Luke Naylor's avatar
Luke Naylor committed
conditions only admit finitely many solutions (despite the fact that the same
conditions admit infinitely many solutions when $\beta_{-}$ is irrational).
Luke Naylor's avatar
Luke Naylor committed


For a destabilizing sequence
$E \hookrightarrow F \twoheadrightarrow G$ in $\mathcal{B}^\beta$
we have the following conditions.
There are some Bogomolov-Gieseker type inequalities:
$0 \leq \Delta(E), \Delta(G)$ and $\Delta(E) + \Delta(G) \leq \Delta(F)$.
We also have a condition relating to the tilt category $\firsttilt\beta$:
$0 \leq \chern^\beta_1(E) \leq \chern^\beta_1(F)$.
Finally, there's a condition ensuring that the radius of the circular wall is
strictly positive: $\chern^\beta_2(E) > 0$.

For any fixed $\chern_0(E)$, the inequality
$0 \leq \chern^{\beta_{-}}_1(E) \leq \chern^{\beta_{-}}_1(F)$,
allows us to bound $\chern_1(E)$. Then, the other inequalities allow us to
bound $\chern_2(E)$. The final part to showing the finiteness of pseudowalls
would be bounding $\chern_0(E)$. This has been hinted at in [ref] and done
explicitly by Benjamin Schmidt within a computer program which computes
pseudowalls. Here we discuss these bounds in more detail, along with the methods
used, followed by refinements on them which give explicit formulae for tighter
bounds on $\chern_0(E)$ of potential destabilizers $E$ of $F$.

Luke Naylor's avatar
Luke Naylor committed

\section{Characteristic Curves of Stability Conditions Associated to Chern
Characters}
Luke Naylor's avatar
Luke Naylor committed

\section{Twisted Chern Characters of Pseudo Destabilizers}
\label{sec:twisted-chern}

For a given $\beta$, we can define a twisted Chern character
$\chern^\beta(E) = \chern(E) \cdot \exp(-\beta \ell)$:

\begin{align*}
	\chern^\beta_0(E) &= \chern_0(E)
\\
	\chern^\beta_1(E) &= \chern_1(E) - \beta \chern_0(E)
\\
	\chern^\beta_2(E) &= \chern_2(E) - \beta \chern_1(E) + \frac{\beta^2}{2} \chern_0(E)
\end{align*}

Luke Naylor's avatar
Luke Naylor committed
% TODO I think this^ needs adjusting for general Surface with $\ell$

$\chern^\beta_1(E)$ is the imaginary component of the central charge
$\centralcharge_{\alpha,\beta}(E)$ and any element of $\firsttilt\beta$
satisfies $\chern^\beta_1 \geq 0$. This, along with additivity gives us, for any
destabilizing sequence [ref]:
\begin{equation}
	\label{eqn-tilt-cat-cond}
	0 \leq \chern^\beta_1(E) \leq \chern^\beta_1(F)

When finding Chern characters of potential destabilizers $E$ for some fixed
Chern character $\chern(F)$, this bounds $\chern_1(E)$.

The Bogomolov form applied to the twisted Chern character is the same as the
normal one. So $0 \leq \Delta(E)$ yields:

\begin{equation}
	\label{eqn-bgmlv-on-E}
Luke Naylor's avatar
Luke Naylor committed
	2\chern^\beta_0(E) \chern^\beta_2(E) \leq \chern^\beta_1(E)^2
\end{equation}

The restrictions on $\chern^\beta_0(E)$ and $\chern^\beta_2(E)$
is best seen with the following graph:

% TODO: hyperbola restriction graph (shaded)
\begin{sagesilent}
var("m") # Initialize symbol for variety parameter
\end{sagesilent}
Luke Naylor's avatar
Luke Naylor committed

Luke Naylor's avatar
Luke Naylor committed
This is where the $\beta_{-}$ criterion comes in. If $\beta_{-} = \frac{*}{n}$
for some $*,n \in \ZZ$.
Then $\chern^\beta_2(E) \in \frac{1}{\lcm(m,2n^2)}\ZZ$ where $m$ is the integer
which guarantees $\chern_2(E) \in \frac{1}{m}\ZZ$ (determined by the variety).
In particular, since $\chern_2(E) > 0$ we must also have
$\chern^\beta_2(E) \geq \frac{1}{\lcm(m,2n^2)}$, which then in turn gives a bound
for the rank of $E$:

\begin{align}
	\chern_0(E) &= \chern^\beta_0(E) \\
	&\leq \frac{\lcm(m,2n^2) \chern^\beta_1(E)^2}{2} \\
	&\leq \frac{mn^2 \chern^\beta_1(F)^2}{\gcd(m,2n^2)}
\end{align}

\section{B.Schmidt's Method}

\section{Limitations}

\section{Refinement}
\label{sec:refinement}
Luke Naylor's avatar
Luke Naylor committed

Luke Naylor's avatar
Luke Naylor committed
To get tighter bounds on the rank of destabilizers $E$ of some $F$ with some
fixed Chern character, we will need to consider each of the values which
$\chern_1^{\beta_{-}}(E)$ can take.
Doing this will allow us to eliminate possible values of $\chern_0(E)$ for which
each $\chern_1^{\beta_{-}}(E)$ leads to the failure of at least one of the inequalities.
As opposed to only eliminating possible values of $\chern_0(E)$ for which all
corresponding $\chern_1^{\beta_{-}}(E)$ fail one of the inequalities (which is what
was implicitly happening before).

First, let us fix a Chern character for $F$,
Luke Naylor's avatar
Luke Naylor committed
$\chern(F) = (R,C,D)$, and consider the possible Chern characters
$\chern(E) = (r,c,d)$ of some semistabilizer $E$.
 
\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
# Requires extra package:
#! sage -pip install "pseudowalls==0.0.3" --extra-index-url https://gitlab.com/api/v4/projects/43962374/packages/pypi/simple
Luke Naylor's avatar
Luke Naylor committed
from pseudowalls import *
Luke Naylor's avatar
Luke Naylor committed

Luke Naylor's avatar
Luke Naylor committed
v = Chern_Char(*var("R C D", domain="real"))
u = Chern_Char(*var("r c d", domain="real"))
Luke Naylor's avatar
Luke Naylor committed
Δ = lambda v: v.Q_tilt()
Luke Naylor's avatar
Luke Naylor committed
\end{sagesilent}

Recall [ref] that $\chern_1^{\beta_{-}}$ has fixed bounds in terms of
$\chern(F)$, and so we can write:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
ts = stability.Tilt
var("beta", domain="real")
Luke Naylor's avatar
Luke Naylor committed
c_lower_bound = -(
Luke Naylor's avatar
Luke Naylor committed
	/ts().alpha
).expand() + c
Luke Naylor's avatar
Luke Naylor committed
var("q", domain="real")
c_in_terms_of_q = c_lower_bound + q
Luke Naylor's avatar
Luke Naylor committed
\begin{equation}
	\label{eqn-cintermsofm}
	c=\chern_1(E) = \sage{c_in_terms_of_q}
	\qquad 0 \leq q \leq \chern_1^{\beta_{-}}(F)
Luke Naylor's avatar
Luke Naylor committed
\end{equation}

Furthermore, $\chern_1 \in \ZZ$ so we only need to consider
$q \in \frac{1}{n} \ZZ \cap [0, \chern_1^{\beta_{-}}(F)]$.
For the next subsections, we consider $q$ to be fixed with one of these values,
Luke Naylor's avatar
Luke Naylor committed
and we shall be varying $\chern_0(E) = r$ to see when certain inequalities fail.

\subsection{
	\texorpdfstring{
		$\Delta(E) + \Delta(G) \leq \Delta(F)$
	}{
		Δ(E) + Δ(G) ≤ Δ(F)
	}
}
\label{subsect-d-bound-bgmlv1}

This condition expressed in terms of $R,C,D,r,c,d$ looks as follows:

Luke Naylor's avatar
Luke Naylor committed
\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
# First Bogomolov-Gieseker form expression that must be non-negative:
bgmlv1 = Δ(v) - Δ(u) - Δ(v-u)
\end{sagesilent}
Luke Naylor's avatar
Luke Naylor committed

\begin{equation}
	\sage{0 <= bgmlv1.expand() }
Expressing $c$ in terms of $q$ as defined in (eqn \ref{eqn-cintermsofm})
we get the following:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
bgmlv1_with_q = (
	bgmlv1
	.expand()
	.subs(c == c_in_terms_of_q)
)
\end{sagesilent}

\begin{equation}
	\sage{0 <= bgmlv1_with_q}
This can be rearranged to express a bound on $d$ as follows:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
var("r_alt",domain="real") # r_alt = r - R/2 temporary substitution
Luke Naylor's avatar
Luke Naylor committed
bgmlv1_with_q_reparam = (bgmlv1_with_q.subs(r == r_alt + R/2)/r_alt).expand()
Luke Naylor's avatar
Luke Naylor committed
bgmlv1_d_ineq = (
	((0 >= -bgmlv1_with_q_reparam)/4 + d) # Rearrange for d
	.subs(r_alt == r - R/2) # Resubstitute r back in
	.expand()
)
Luke Naylor's avatar
Luke Naylor committed
bgmlv1_d_lowerbound = bgmlv1_d_ineq.rhs() # Keep hold of lower bound for d
\end{sagesilent}

	\label{eqn-bgmlv1_d_lowerbound}
	\sage{bgmlv1_d_ineq}
Luke Naylor's avatar
Luke Naylor committed
# Separate out the terms of the lower bound for d
bgmlv1_d_lowerbound_without_hyp = bgmlv1_d_lowerbound.subs(1/(R-2*r) == 0)

bgmlv1_d_lowerbound_exp_term = (
	bgmlv1_d_lowerbound
	- bgmlv1_d_lowerbound_without_hyp
).expand()

bgmlv1_d_lowerbound_const_term = bgmlv1_d_lowerbound_without_hyp.subs(r==0)

bgmlv1_d_lowerbound_linear_term = (
	bgmlv1_d_lowerbound_without_hyp
	- bgmlv1_d_lowerbound_const_term
).expand()

# Verify the simplified forms of the terms that will be mentioned in text
var("chbv",domain="real") # symbol to represent ch_1^\beta(v)
Luke Naylor's avatar
Luke Naylor committed
assert bgmlv1_d_lowerbound_const_term == (
	(
		# Keep hold of this alternative expression:
		bgmlv1_d_lowerbound_const_term_alt :=
		(
			chbv/2
	.subs(chbv == v.twist(beta).ch[2])
Luke Naylor's avatar
Luke Naylor committed
)

assert bgmlv1_d_lowerbound_exp_term == (
	(
		# Keep hold of this alternative expression:
		bgmlv1_d_lowerbound_exp_term_alt :=
		(
			- R*chbv/2
	.subs(chbv == v.twist(beta).ch[2])
\noindent
Viewing equation \ref{eqn-bgmlv1_d_lowerbound} as a lower bound for $d$ given
as a function of $r$, the terms can be rewritten as follows.
The constant term in $r$ is
$\chern^{\beta}_2(F)/2 + \beta q$.
The linear term in $r$ is
$\sage{bgmlv1_d_lowerbound_linear_term}$.
Finally, there's an hyperbolic term in $r$ which tends to 0 as $r \to \infty$,
and can be written:
$\frac{R\chern^{\beta}_2(F)/2 + R\beta q - Cq + q^2  }{2r-R}$.
In the case $\beta = \beta_{-}$ (or $\beta_{+}$) we have
$\chern^{\beta}_2(F) = 0$,
so some of these expressions simplify.
\subsection{
	\texorpdfstring{
		$\Delta(E) \geq 0$
	}{
		Δ(E) ≥ 0
	}
}

This condition expressed in terms of $R,C,D,r,c,d$ looks as follows:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
# First Bogomolov-Gieseker form expression that must be non-negative:
bgmlv2 = Δ(u)
\end{sagesilent}

\begin{equation}
	\sage{0 <= bgmlv2.expand() }
\end{equation}


\noindent
Expressing $c$ in terms of $q$ as defined in (eqn \ref{eqn-cintermsofm})
we get the following:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
bgmlv2_with_q = (
	bgmlv2
	.expand()
	.subs(c == c_in_terms_of_q)
)
\end{sagesilent}

\begin{equation}
	\sage{0 <= bgmlv2_with_q}
\end{equation}


\noindent
This can be rearranged to express a bound on $d$ as follows:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
bgmlv2_d_ineq = (
	(0 <= bgmlv2_with_q)/2/r # rescale assuming r > 0
	+ d # Rearrange for d
).expand()
Luke Naylor's avatar
Luke Naylor committed
# Keep hold of lower bound for d
bgmlv2_d_upperbound = bgmlv2_d_ineq.rhs()
\end{sagesilent}

\begin{equation}
	\label{eqn-bgmlv2_d_upperbound}
	\sage{bgmlv2_d_ineq}
\end{equation}

Luke Naylor's avatar
Luke Naylor committed
# Seperate out the terms of the lower bound for d
bgmlv2_d_upperbound_without_hyp = (
	bgmlv2_d_upperbound
	.subs(1/r == 0)
)

bgmlv2_d_upperbound_const_term = (
	bgmlv2_d_upperbound_without_hyp
bgmlv2_d_upperbound_linear_term = (
	bgmlv2_d_upperbound_without_hyp
	- bgmlv2_d_upperbound_const_term
Luke Naylor's avatar
Luke Naylor committed
).expand()
bgmlv2_d_upperbound_exp_term = (
	bgmlv2_d_upperbound
	- bgmlv2_d_upperbound_without_hyp
Luke Naylor's avatar
Luke Naylor committed
).expand()
Viewing equation \ref{eqn-bgmlv2_d_upperbound} as a lower bound for $d$ in term
of $r$ again, there's a constant term
$\sage{bgmlv2_d_upperbound_const_term}$,
$\sage{bgmlv2_d_upperbound_linear_term}$,
$\sage{bgmlv2_d_upperbound_exp_term}$.
Notice that for $\beta = \beta_{-}$ (or $\beta_{+}$), that is when
$\chern^{\beta}_2(F)=0$, the constant and linear terms match up with the ones
for the bound found for $d$ in subsection \ref{subsect-d-bound-bgmlv1}.
Luke Naylor's avatar
Luke Naylor committed

\subsection{
	\texorpdfstring{
		$\Delta(G) \geq 0$
	}{
		Δ(G) ≥ 0
	}
}
\label{subsect-d-bound-bgmlv3}

This condition expressed in terms of $R,C,D,r,c,d$ looks as follows:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
# Third Bogomolov-Gieseker form expression that must be non-negative:
bgmlv3 = Δ(v-u)
\end{sagesilent}

\begin{equation}
	\sage{0 <= bgmlv3.expand() }
\end{equation}


\noindent
Expressing $c$ in terms of $q$ as defined in (eqn \ref{eqn-cintermsofm})
we get the following:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
bgmlv3_with_q = (
	bgmlv3
	.expand()
	.subs(c == c_in_terms_of_q)
)
\end{sagesilent}

\begin{equation}
	\sage{0 <= bgmlv3_with_q}
\end{equation}


\noindent
This can be rearranged to express a bound on $d$ as follows:

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
var("r_alt",domain="real") # r_alt = r - R temporary substitution

bgmlv3_with_q_reparam = (
	bgmlv3_with_q
	.subs(r == r_alt + R)
	/r_alt # This operation assumes r_alt > 0
).expand()

bgmlv3_d_ineq = (
	((0 <= bgmlv3_with_q_reparam)/2 + d) # Rearrange for d
	.subs(r_alt == r - R) # Resubstitute r back in
	.expand()
)

# Check that this equation represents a bound for d
assert bgmlv3_d_ineq.lhs() == d

Luke Naylor's avatar
Luke Naylor committed
bgmlv3_d_upperbound = bgmlv3_d_ineq.rhs() # Keep hold of lower bound for d
\end{sagesilent}

\begin{dmath}
	\label{eqn-bgmlv3_d_upperbound}
	\sage{bgmlv3_d_ineq}
\end{dmath}

\begin{sagesilent}
Luke Naylor's avatar
Luke Naylor committed
# Seperate out the terms of the lower bound for d
bgmlv3_d_upperbound_without_hyp = (
	bgmlv3_d_upperbound
	.subs(1/(R-r) == 0)
)
bgmlv3_d_upperbound_const_term = (
	bgmlv3_d_upperbound_without_hyp
	.subs(r==0)
)
Luke Naylor's avatar
Luke Naylor committed
bgmlv3_d_upperbound_linear_term = (
	bgmlv3_d_upperbound_without_hyp
	- bgmlv3_d_upperbound_const_term
).expand()
Luke Naylor's avatar
Luke Naylor committed
bgmlv3_d_upperbound_exp_term = (
	bgmlv3_d_upperbound
	- bgmlv3_d_upperbound_without_hyp
).expand()
Luke Naylor's avatar
Luke Naylor committed
# Verify the simplified forms of the terms that will be mentioned in text
var("chbv",domain="real") # symbol to represent ch_1^\beta(v)

Luke Naylor's avatar
Luke Naylor committed
assert bgmlv3_d_upperbound_const_term == ( 
	(
		# keep hold of this alternative expression:
		bgmlv3_d_upperbound_const_term_alt := (
	.subs(chbv == v.twist(beta).ch[2]) # subs real val of ch_1^\beta(v)
Luke Naylor's avatar
Luke Naylor committed
assert bgmlv3_d_upperbound_exp_term == (
		# Keep hold of this alternative expression:
	.subs(chbv == v.twist(beta).ch[2]) # subs real val of ch_1^\beta(v)
\end{sagesilent}


\noindent
Viewing equation \ref{eqn-bgmlv3_d_upperbound} as an upper bound for $d$ give:
as a function of $r$, the terms can be rewritten as follows.
The constant term in $r$ is
$\chern^{\beta}_2(F) + \beta q$.
The linear term in $r$ is
$\sage{bgmlv3_d_upperbound_linear_term}$.
Finally, there's an hyperbolic term in $r$ which tends to 0 as $r \to \infty$,
and can be written:
$\frac{R\chern^{\beta}_2(F) + (C-q)^2/2 + R\beta q - DR}{r-R}$.
In the case $\beta = \beta_{-}$ (or $\beta_{+}$) we have
$\chern^{\beta}_2(F) = 0$,
so some of these expressions simplify, and in particular, the constant and
linear terms match those of the other bounds in the previous subsections.

\subsection{Bounds on \texorpdfstring{$r$}{r}}

Now, the inequalities from the last three subsections will be used to find, for
each given $q=\chern^{\beta}_1(E)$, how large $r$ needs to be in order to leave
no possible solutions for $d$. At that point, there are no Chern characters
$(r,c,d)$ that satisfy all inequalities to give a pseudowall.

\subsubsection{All circular pseudowalls left of vertical wall}
Suppose we take $\beta = \beta_{-}$ (so that $\chern^{\beta}_2(F)=0$)
in the previous subsections, to find all circular walls to the left of the
vertical wall (TODO as discussed in ref).
% redefine \beta (especially coming from rendered SageMath expressions)
% to be \beta_{-} for the rest of this subsubsection
\bgroup
\let\originalbeta\beta
\renewcommand\beta{{\originalbeta_{-}}}

\begin{align}
	d &\geq&
	\sage{bgmlv1_d_lowerbound_linear_term}
	&+ \sage{bgmlv1_d_lowerbound_const_term_alt.subs(chbv == 0)}
	+& \sage{bgmlv1_d_lowerbound_exp_term_alt.subs(chbv == 0)},
	 &\qquad\text{when\:} r > \frac{R}{2}
	 \label{eqn:bgmlv1_d_bound_betamin}
	\sage{bgmlv2_d_upperbound_linear_term}
	&+ \sage{bgmlv2_d_upperbound_const_term}
	+& \sage{bgmlv2_d_upperbound_exp_term},
	 &\qquad\text{when\:} r > 0
	 \label{eqn:bgmlv2_d_bound_betamin}
	\sage{bgmlv3_d_upperbound_linear_term}
	&+ \sage{bgmlv3_d_upperbound_const_term_alt.subs(chbv == 0)}
	+& \sage{bgmlv3_d_upperbound_exp_term_alt.subs(chbv == 0)},
	 &\qquad\text{when\:} r > R
	 \label{eqn:bgmlv3_d_bound_betamin}
Furthermore, we get an extra bound for $d$ resulting from the condition that the
radius of the circular wall must be positive. As discussed in (TODO ref), this
is equivalent to $\chern^{\beta}_2(E) > 0$, which yields:

\begin{sagesilent}
positive_radius_condition = (
	(
		(0 > - u.twist(beta).ch[2])
		+ d # rearrange for d
	.subs(solve(q == u.twist(beta).ch[1], c)[0]) # express c in term of q
	.expand()
)
\end{sagesilent}

\begin{equation}
	\label{eqn:positive_rad_d_bound_betamin}
	\sage{positive_radius_condition}
\begin{sagesilent}
def beta_min(chern):
  ts = stability.Tilt()
  return min(
    map(
      lambda soln: soln.rhs(),
      solve(
        (ts.degree(chern))
          .expand()
          .subs(ts.alpha == 0),
        beta
      )
    )
  )

v_example = Chern_Char(3,2,-2)
q_example = 7/3

def plot_d_bound(
  v_example,
  q_example,
  ymax=5,
  ymin=-2,
  xmax=20,
  aspect_ratio=None
):

  # Equations to plot imminently representing the bounds on d:
  eq1 = (
    bgmlv1_d_lowerbound
    .subs(R == v_example.ch[0])
    .subs(C == v_example.ch[1])
    .subs(D == v_example.ch[2])
    .subs(beta = beta_min(v_example))
    .subs(q == q_example)
  )

  eq2 = (
    bgmlv2_d_upperbound
    .subs(R == v_example.ch[0])
    .subs(C == v_example.ch[1])
    .subs(D == v_example.ch[2])
    .subs(beta = beta_min(v_example))
    .subs(q == q_example)
  )

  eq3 = (
    bgmlv3_d_upperbound
    .subs(R == v_example.ch[0])
    .subs(C == v_example.ch[1])
    .subs(D == v_example.ch[2])
    .subs(beta = beta_min(v_example))
    .subs(q == q_example)
  )

  eq4 = (
    positive_radius_condition.rhs()
    .subs(q == q_example)
    .subs(beta = beta_min(v_example))
  )

  example_bounds_on_d_plot = (
    plot(
      eq3,
      (r,v_example.ch[0],xmax),
      color='green',
			linestyle = "dashed",
      legend_label=r"upper bound: $\Delta(G) \geq 0$",
    )
    + plot(
      eq2,
      (r,0,xmax),
      color='blue',
			linestyle = "dashed",
      legend_label=r"upper bound: $\Delta(E) \geq 0$"
    )
    + plot(
      eq4,
      (r,0,xmax),
      color='orange',
			linestyle = "dotted",
      legend_label=r"lower bound: $\mathrm{ch}_2^{\beta_{-}}(E)>0$"
    )
    + plot(
      eq1,
      (r,v_example.ch[0]/2,xmax),
      color='red',
			linestyle = "dotted",
      legend_label=r"lower bound: $\Delta(E) + \Delta(G) \leq \Delta(F)$"
    )
  )
  example_bounds_on_d_plot.ymin(ymin)
  example_bounds_on_d_plot.ymax(ymax)
  example_bounds_on_d_plot.axes_labels(['$r$', '$d$'])
  if aspect_ratio:
    example_bounds_on_d_plot.set_aspect_ratio(aspect_ratio)
  return example_bounds_on_d_plot

\end{sagesilent}

Luke Naylor's avatar
Luke Naylor committed
\begin{subfigure}{.45\textwidth}
  \centering
	\sageplot[width=\linewidth]{plot_d_bound(v_example, 0)}
	\caption{$q = 0$ (all bounds other than green coincide on line)}
  \label{fig:d_bounds_xmpl_min_q}
\end{subfigure}%
Luke Naylor's avatar
Luke Naylor committed
\hfill
\begin{subfigure}{.45\textwidth}
  \centering
	\sageplot[width=\linewidth]{plot_d_bound(v_example, 4)}
	\caption{$q = \chern^{\beta}(F)$ (all bounds other than blue coincide on line)}
  \label{fig:d_bounds_xmpl_max_q}
\end{subfigure}
\caption{
	Bounds on $d:=\chern_2(E)$ in terms of $r:=\chern_0(E)$ for fixed, extreme,
	values of $q:=\chern_1^{\beta}(E)$.
	Where $\chern(F) = (3,2,-2)$.
}
\label{fig:d_bounds_xmpl_extrm_q}
\end{figure}

Recalling that $q := \chern^{\beta}_1(E) \in [0, \chern^{\beta}_1(F)]$,
it's worth noting that the extreme values of $q$ in this range lead to the
tightest bounds on $d$, as illustrated in figure
(\ref{fig:d_bounds_xmpl_extrm_q}).
In fact, in each case, one of the weak upper bounds coincides with one of the
weak lower bounds, (implying no possible destabilizers $E$ with
$\chern_0(E)=:r>R:=\chern_0(F)$ for these $q$-values).
This indeed happens in general since the right hand sides of
(eqn \ref{eqn:bgmlv2_d_bound_betamin}) and
(eqn \ref{eqn:positive_rad_d_bound_betamin}) match when $q=0$.
In the other case, $q=\chern^{\beta}_1(F)$, it's the right hand sides of
(eqn \ref{eqn:bgmlv3_d_bound_betamin}) and
(eqn \ref{eqn:positive_rad_d_bound_betamin}) which match.


The more generic case, when $0 < q:=\chern_1{\beta}(E) < \chern_1^{\beta}(F)$
for the bounds on $d$ in terms of $r$ is illustrated in figure
(\ref{fig:d_bounds_xmpl_gnrc_q}).
The question of whether there are pseudo-destabilizers of arbitrarily large
rank, in the context of the graph, comes down to whether there are points
$(r,d) \in \ZZ \oplus \frac{1}{m} \ZZ$ (with large $r$)
% TODO have a proper definition for pseudo-destabilizers/walls
that fit above the yellow line (ensuring positive radius of wall) but below the
blue and green (ensuring $\Delta(E), \Delta(G) > 0$).
These lines have the same assymptote at $r \to \infty$
(eqns \ref{eqn:bgmlv2_d_bound_betamin},
\ref{eqn:bgmlv3_d_bound_betamin},
\ref{eqn:positive_rad_d_bound_betamin}).
As mentioned in the introduction (sec \ref{sec:intro}), the finiteness of these
solutions is entirely determined by whether $\beta$ is rational or irrational.
Some of the details around the associated numerics are explored next.
\begin{figure}
\centering
\sageplot[
	width=\linewidth
]{plot_d_bound(v_example, 2, ymax=6, ymin=-0.5, aspect_ratio=1)}
\caption{
	Bounds on $d:=\chern_2(E)$ in terms of $r:=\chern_0(E)$ for a fixed
	value $\chern_1^{\beta}(F)/2$ of $q:=\chern_1^{\beta}(E)$.
	Where $\chern(F) = (3,2,-2)$.
}
\label{fig:d_bounds_xmpl_gnrc_q}
\end{figure}
\minorheading{Rational $\beta\not=0$}

The strategy here is similar to what was shown in (sect \ref{sec:twisted-chern}),
% ref to Schmidt?
\renewcommand{\aa}{{a_F}}
\newcommand{\bb}{{b_q}}
Suppose $\beta = \frac{\aa}{n}$ for some coprime $n \in \NN,\aa \in \ZZ$.
Then fix a value of $q$:
\begin{equation}
	q:=\chern_1^{\beta}(E)
	\in
	\frac{1}{n} \ZZ
	\cap [0, \chern_1^{\beta}(F)]
\end{equation}
as noted at the beginning of this section (\ref{sec:refinement}).
Firstly, we only consider $r$-values for which $c:=\chern_1(E)$ is integral:
var("a_F b_q n") # Define symbols introduce for values of beta and q
beta_value_expr = (beta == a_F/n)
q_value_expr = (q == b_q/n)
\end{sagesilent}

\begin{equation}
	c =
	\sage{c_in_terms_of_q.subs([q_value_expr,beta_value_expr])}
	\in \ZZ
\end{equation}

That is, $r \equiv -\aa^{-1}\bb$ mod $n$ ($\aa$ is coprime to
$n$, and so invertible mod $n$).
Substituting the current values of $q$ and $\beta$ into the condition for the
radius of the pseudo-wall being positive
(eqn \ref{eqn:positive_rad_d_bound_betamin}) we get:

\begin{equation}
\label{eqn:positive_rad_condition_in_terms_of_q_beta}
	\frac{1}{m}\ZZ
	\sage{positive_radius_condition.subs([q_value_expr,beta_value_expr]).factor()}
\noindent
Both $d$ and the lower bound are elements of $\frac{1}{\lcm(m,2n^2)}\ZZ$.
So, if any of the two upper bounds on $d$ come to within
$\frac{1}{\lcm(m,2n^2)}$ of this lower bound, then there are no solutions for
$d$.

Considering equations
\ref{eqn:bgmlv2_d_bound_betamin},
\ref{eqn:bgmlv3_d_bound_betamin},
\ref{eqn:positive_rad_d_bound_betamin},
this happens when:

\bgroup

\let\originalepsilon\epsilon
\renewcommand\epsilon{{\originalepsilon_{F}}}

\begin{sagesilent}
var("epsilon")

# Tightness conditions:

bounds_too_tight_condition1 = (
	bgmlv2_d_upperbound_exp_term
	< epsilon
)

bounds_too_tight_condition2 = (
	bgmlv3_d_upperbound_exp_term_alt.subs(chbv==0)
	< epsilon
)
\end{sagesilent}

\begin{equation}
	\min\left(
		\sage{bgmlv2_d_upperbound_exp_term},
		\sage{bgmlv3_d_upperbound_exp_term_alt.subs(chbv==0)}
	\right)
	< \epsilon := \frac{1}{\lcm(m,2n^2)}
\end{equation}

\begin{sagesilent}
# rearrange the "tightness" conditions in terms of r

bounds_too_tight_condition1 = (
	(bounds_too_tight_condition1 * r / epsilon)
	.expand()
)
bounds_too_tight_condition2 = (
	(bounds_too_tight_condition2 * (r - R) / epsilon + R)
	.expand()
)

# Check that these are indeed rearranged for r
assert bounds_too_tight_condition1.rhs() == r
assert bounds_too_tight_condition2.rhs() == r
\end{sagesilent}

\begin{equation}
	r >
	\min\left(
		\sage{
			bounds_too_tight_condition1.lhs()
			.expand()
			.factor()
		} ,
		\sage{
			bounds_too_tight_condition2.lhs()
			.expand()
			.factor()
		}
	\right)
\end{equation}
%% refinements using specific values of q and beta

\begin{sagesilent}
rhs_numerator = (
	positive_radius_condition
	.rhs()
	.subs([q_value_expr,beta_value_expr])
	.factor()
	.numerator()
)
\end{sagesilent}

\noindent
Considering the numerator of the right-hand-side of
(eqn \ref{eqn:positive_rad_condition_in_terms_of_q_beta}):

\begin{align}
	\sage{rhs_numerator}
	&\equiv (\aa(-\aa^{-1}\bb)+2\bb)\aa &\mod n
And so, we also have $\aa(\aa r+2\bb) \equiv \aa\bb$ (mod $2n^2$).
\minorheading{Irrational $\beta$}

\egroup % end scope where epsilon redefined
\egroup % end scope where beta redefined to beta_{-}
Luke Naylor's avatar
Luke Naylor committed
\section{Conclusion}

\section{Appendix - SageMath code}

\begin{footnotesize}
Luke Naylor's avatar
Luke Naylor committed
\inputminted[
	obeytabs=true,
	tabsize=2,
	breaklines=true,
	breakbefore=./
]{python}{filtered_sage.txt}
\end{footnotesize}
Luke Naylor's avatar
Luke Naylor committed
\end{document}