Skip to content
Snippets Groups Projects
main.tex 14.5 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[]{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}}
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}

[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}

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)
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}
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
beta_min = var("beta", domain="real")
Luke Naylor's avatar
Luke Naylor committed
c_lower_bound = -(
	ts(beta=beta_min).rank(u)
	/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{$\Delta(E) + \Delta(G) \leq \Delta(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
assert bgmlv1_d_lowerbound_const_term == (
	v.twist(beta_min).ch[2]/2
	+ beta_min*q
)

assert bgmlv1_d_lowerbound_exp_term == (
	(
		- R*v.twist(beta_min).ch[2]/2
		- R*beta_min*q
		+ C*q
		- q^2
	)/(R-2*r)
).expand()
\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{$\Delta(E) \geq 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_lowerbound = bgmlv2_d_ineq.rhs()
\end{sagesilent}

\begin{equation}
	\label{eqn-bgmlv2_d_lowerbound}
	\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_lowerbound_without_hyp = (
	bgmlv2_d_lowerbound
	.subs(1/r == 0)
)

bgmlv2_d_lowerbound_const_term = (
	bgmlv2_d_lowerbound_without_hyp
	.subs(r==0)
)

Luke Naylor's avatar
Luke Naylor committed
bgmlv2_d_lowerbound_linear_term = (
	bgmlv2_d_lowerbound_without_hyp
	- bgmlv2_d_lowerbound_const_term
).expand()
Luke Naylor's avatar
Luke Naylor committed
bgmlv2_d_lowerbound_exp_term = (
	bgmlv2_d_lowerbound
	- bgmlv2_d_lowerbound_without_hyp
).expand()
Viewing equation \ref{eqn-bgmlv2_d_lowerbound} as a lower bound for $d$ in term
of $r$ again, there's a constant term
$\sage{bgmlv2_d_lowerbound_const_term}$,
a linear term
$\sage{bgmlv2_d_lowerbound_linear_term}$,
and a hyperbolic term
$\sage{bgmlv2_d_lowerbound_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{$\Delta(G) \geq 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
Luke Naylor's avatar
Luke Naylor committed
assert bgmlv3_d_upperbound_const_term == ( 
	v.twist(beta_min).ch[2]
	+ beta_min*q
).expand()
Luke Naylor's avatar
Luke Naylor committed
assert bgmlv3_d_upperbound_exp_term == (
		R*v.twist(beta_min).ch[2]
		+ (C - q)^2/2
		+ R*beta_min*q
		- D*R
	)/(r-R)
\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.

Luke Naylor's avatar
Luke Naylor committed
\section{Conclusion}

\section{Appendix - SageMath code}

\definecolor{codegreen}{rgb}{0,0.6,0}
\definecolor{codegray}{rgb}{0.5,0.5,0.5}
\definecolor{codepurple}{rgb}{0.58,0,0.82}
Luke Naylor's avatar
Luke Naylor committed
%\definecolor{backcolour}{rgb}{0.95,0.95,0.92}

\lstdefinestyle{mystyle}{
Luke Naylor's avatar
Luke Naylor committed
  %backgroundcolor=\color{backcolour},
  commentstyle=\color{codegreen},
  keywordstyle=\color{magenta},
  numberstyle=\tiny\color{codegray},
  stringstyle=\color{codepurple},
  basicstyle=\ttfamily\footnotesize,
Luke Naylor's avatar
Luke Naylor committed
  breakatwhitespace=false,
  breaklines=true,
  captionpos=b,
  keepspaces=true,
  numbers=left,
  numbersep=5pt,
  showspaces=false,
  showstringspaces=false,
Luke Naylor's avatar
Luke Naylor committed
  showtabs=false,
  tabsize=2
}

\lstset{style=mystyle}

\lstinputlisting[language=python]{filtered_sage.txt}

Luke Naylor's avatar
Luke Naylor committed
\end{document}