Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
M
Max Destabilizer Rank
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
luke naylor latex documents
research
Max Destabilizer Rank
Commits
bd0d95ec
Commit
bd0d95ec
authored
8 months ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Iron out final theorem bound of chapter
parent
25202198
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
tex/bounds-on-semistabilisers.tex
+30
-22
30 additions, 22 deletions
tex/bounds-on-semistabilisers.tex
with
30 additions
and
22 deletions
tex/bounds-on-semistabilisers.tex
+
30
−
22
View file @
bd0d95ec
...
...
@@ -730,9 +730,9 @@ proof of Theorem
\begin{sagesilent}
from plots
_
and
_
expressions import main
_
theorem1
from plots
_
and
_
expressions import main
_
theorem1
, betamin
_
subs
\end{sagesilent}
\begin{theorem}
[Bound on
$
r
$
\#
1]
\begin{theorem}
[Bound on
$
r
$
\#
1
for Problem
\ref
{
problem:problem-statement-2
}
]
\label
{
thm:rmax
_
with
_
uniform
_
eps
}
Let
$
X
$
be a smooth projective surface with Picard rank 1 and choice of ample
line bundle
$
L
$
with
$
c
_
1
(
L
)
$
generating
$
\neronseveri
(
X
)
$
and
...
...
@@ -747,8 +747,8 @@ from plots_and_expressions import main_theorem1
\begin{align*}
\min
\left
(
\sage
{
main
_
theorem1.r
_
upper
_
bound1
}
,
\:\:
\sage
{
main
_
theorem1.r
_
upper
_
bound2
}
\sage
{
main
_
theorem1.r
_
upper
_
bound1
.subs(betamin
_
subs)
}
,
\:\:
\sage
{
main
_
theorem1.r
_
upper
_
bound2
.subs(betamin
_
subs)
}
\right
)
\end{align*}
\noindent
...
...
@@ -760,8 +760,8 @@ Both $d$ and the lower bound in
(Equation
\ref
{
eqn:positive
_
rad
_
condition
_
in
_
terms
_
of
_
q
_
beta
}
)
are elements of
$
\frac
{
1
}{
\lcm
(
m,
2
n
^
2
)
}
\ZZ
$
.
So, if any of the two upper bounds on
$
d
$
come to within
$
\frac
{
1
}{
\lcm
(
m,
2
n
^
2
)
}$
of this lower bound,
then there are no solutions for
$
d
$
.
$
\epsilon
_
v
\coloneqq
\frac
{
1
}{
\lcm
(
m,
2
n
^
2
)
}$
of this lower bound,
then there are no solutions for
$
d
$
.
Hence any corresponding
$
r
$
cannot be a rank of a
pseudo-semistabiliser for
$
v
$
.
...
...
@@ -778,8 +778,8 @@ assymptote_gap_condition1, assymptote_gap_condition2, k
\begin{align}
&
\sage
{
assymptote
_
gap
_
condition1.subs(k==1)
}
\\
&
\sage
{
assymptote
_
gap
_
condition2.subs(k==1)
}
\epsilon
_
v =
&
\sage
{
assymptote
_
gap
_
condition1.subs(k==1)
}
\\
\epsilon
_
v =
&
\sage
{
assymptote
_
gap
_
condition2.subs(k==1)
}
\end{align}
\noindent
...
...
@@ -805,7 +805,7 @@ This is equivalent to:
from plots
_
and
_
expressions import q
_
sol, bgmlv
_
v, psi
\end{sagesilent}
\begin{corollary}
[
B
ound on
$
r
$
\#
2]
\begin{corollary}
[
Global b
ound on
$
r
$
\#
2
for Problem
\ref
{
problem:problem-statement-2
}
]
\label
{
cor:direct
_
rmax
_
with
_
uniform
_
eps
}
Let
$
X
$
be a smooth projective surface with Picard rank 1 and choice of ample
line bundle
$
L
$
with
$
c
_
1
(
L
)
$
generating
$
\neronseveri
(
X
)
$
and
...
...
@@ -1042,29 +1042,37 @@ $\epsilon_{v,q}\geq\epsilon_v$, with equality when $k_{v,q}=1$.
\begin{sagesilent}
from plots
_
and
_
expressions import main
_
theorem2
\end{sagesilent}
\begin{theorem}
[Bound on
$
r
$
\#
3]
\begin{theorem}
[Bound on
$
r
$
\#
3
for Problem
\ref
{
problem:problem-statement-2
}
]
\label
{
thm:rmax
_
with
_
eps1
}
Let
$
v
$
be a fixed Chern character, with
$
\frac
{
a
_
v
}{
n
}
=
\beta\coloneqq\beta
(
v
)
$
rational and expressed in lowest terms.
Then the ranks
$
r
$
of the pseudo-semistabilisers
$
u
$
for
$
v
$
with,
which are solutions to problem
\ref
{
problem:problem-statement-2
}
,
$
\chern
_
1
^
\beta
(
u
)
=
q
=
\frac
{
b
_
q
}{
n
}$
are bounded above by the following expression:
Let
$
X
$
be a smooth projective surface with Picard rank 1 and choice of ample
line bundle
$
L
$
with
$
c
_
1
(
L
)
$
generating
$
\neronseveri
(
X
)
$
and
$
m
\coloneqq\ell
^
2
$
.
Let
$
v
$
be a fixed Chern character on this surface with positive rank
(or rank 0 and
$
c
_
1
(
v
)
>
0
$
), and
$
\Delta
(
v
)
\geq
0
$
.
Then the ranks of the pseudo-semistabilisers
$
u
$
for
$
v
$
,
which are solutions to Problem
\ref
{
problem:problem-statement-2
}
,
with
$
\chern
_
1
^{
\beta
_{
-
}
(
v
)
}
(
u
)
=
q
$
are bounded above by the following expression.
\begin{align*}
\min
\left
(
\sage
{
main
_
theorem2.r
_
upper
_
bound1
}
,
\:\:
\sage
{
main
_
theorem2.r
_
upper
_
bound2
}
\sage
{
main
_
theorem2.r
_
upper
_
bound1
.subs(betamin
_
subs)
}
,
\:\:
\sage
{
main
_
theorem2.r
_
upper
_
bound2
.subs(betamin
_
subs)
}
\right
)
\end{align*}
Where
$
k
_{
v,q
}$
is defined as in
d
efinition/Lemma
\ref
{
lemdfn:epsilon
_
q
}
,
Where
$
k
_{
v,q
}$
is defined as in
D
efinition/Lemma
\ref
{
lemdfn:epsilon
_
q
}
,
and
$
R
=
\chern
_
0
(
v
)
$
Furthermore, if
$
\aa
\not
=
0
$
then
$
r
\equiv
\aa
^{
-
1
}
b
_
q
\pmod
{
n
}$
.
\end{theorem}
\begin{proof}
Following the same proof as Theorem
\ref
{
thm:rmax
_
with
_
uniform
_
eps
}
,
$
\epsilon
_{
v,q
}
=
\frac
{
k
_{
v,q
}}{
\lcm
(
m,
2
n
^
2
)
}$
can be used instead of
$
\epsilon
_{
v
}
=
\frac
{
1
}{
\lcm
(
m,
2
n
^
2
)
}$
as it satisfies the same required
property, as per Definition/Lemma
\ref
{
lemdfn:epsilon
_
q
}
.
\end{proof}
Although the general form of this bound is quite complicated, it does simplify a
lot when
$
m
$
is small.
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment