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
589c1a33
Commit
589c1a33
authored
1 year ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Minor changes from supervision
parent
43c063de
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
main.tex
+15
-13
15 additions, 13 deletions
main.tex
with
15 additions
and
13 deletions
main.tex
+
15
−
13
View file @
589c1a33
...
...
@@ -50,8 +50,8 @@ 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
)
$
.
destabilizer, regardless of whether they are realised by actual
semistabilizers
in
$
\bddderived
(
X
)
$
.
Since real walls are a subset of pseudowalls, the irrational
$
\beta
_{
-
}$
case
follows immediately from the corresponding case for real walls.
...
...
@@ -991,7 +991,7 @@ proof of theorem \ref{thm:rmax_with_uniform_eps}:
\begin{lemmadfn}
[
Finding better alternatives to
$
\epsilon
_
F
$
:
$
\epsilon
_
q
^
1
$
and
$
\epsilon
_
q
^
2
$
$
\epsilon
_
{
q,
1
}
$
and
$
\epsilon
_
{
q,
2
}
$
]
\label
{
lemdfn:epsilon
_
q
}
Suppose
$
d
\in
\frac
{
1
}{
m
}
\ZZ
$
satisfies the condition in
...
...
@@ -1007,16 +1007,16 @@ Then we have:
\begin{equation*}
d -
\frac
{
(
\aa
r + 2
\bb
)
\aa
}{
2n
^
2
}
\geq
\epsilon
_
q
^
2
\geq
\epsilon
_
q
^
1
> 0
\geq
\epsilon
_
{
q,2
}
\geq
\epsilon
_
{
q,1
}
> 0
\end{equation*}
Where
$
\epsilon
_
q
^
1
$
and
$
\epsilon
_
q
^
2
$
are defined as follows:
Where
$
\epsilon
_
{
q,
1
}
$
and
$
\epsilon
_
{
q,
2
}
$
are defined as follows:
\begin{equation*}
\epsilon
_
q
^
1
:=
\epsilon
_
{
q,1
}
:=
\frac
{
k
_
q
^
1
}{
2mn
^
2
}
\qquad
\epsilon
_
q
^
2
:=
\epsilon
_
{
q,2
}
:=
\frac
{
k
_
q
^
2
}{
2mn
^
2
}
\end{equation*}
\begin{align*}
...
...
@@ -1033,7 +1033,8 @@ Where $\epsilon_q^1$ and $\epsilon_q^2$ are defined as follows:
\end{lemmadfn}
It's worth noting that
$
\epsilon
_
q
^
2
$
is potentially larger than
$
\epsilon
_
q
^
2
$
It is worth noting that
$
\epsilon
_{
q,
2
}$
is potentially larger than
$
\epsilon
_{
q,
2
}$
but calculating it involves a
$
\gcd
$
, a modulo reduction, and a modulo
$
n
$
inverse, for each
$
q
$
considered.
...
...
@@ -1077,11 +1078,12 @@ eqn \ref{eqn:finding_better_eps_problem}.
Since such a
$
k
$
must also satisfy eqn
\ref
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
n
}
,
we can pick the smallest
$
k
_
q
^
1
\in
\ZZ
_{
>
0
}$
which satisfies this new condition
(a computation only depending on
$
q
$
and
$
\beta
$
, but not
$
r
$
).
We are then guaranteed that the gap
$
\frac
{
k
}{
2
mn
^
2
}$
is at least
$
\epsilon
_
q
^
1
$
.
We are then guaranteed that the gap
$
\frac
{
k
}{
2
mn
^
2
}$
is at least
$
\epsilon
_{
q,
1
}$
.
Furthermore,
$
k
$
also satisfies
eqn
\ref
{
eqn:better
_
eps
_
problem
_
k
_
mod
_
gcd2n2
_
a2mn
}
so we can also pick the smallest
$
k
_
q
^
2
\in
\ZZ
_{
>
0
}$
satisfying this condition,
which also guarantees that the gap
$
\frac
{
k
}{
2
mn
^
2
}$
is at least
$
\epsilon
_
q
^
2
$
.
which also guarantees that the gap
$
\frac
{
k
}{
2
mn
^
2
}$
is at least
$
\epsilon
_
{
q,
2
}
$
.
\end{proof}
...
...
@@ -1094,7 +1096,7 @@ which also guarantees that the gap $\frac{k}{2mn^2}$ is at least $\epsilon_q^2$.
are bounded above by the following expression (with
$
i
=
1
$
or 2).
\begin{equation*}
\frac
{
1
}{
2
\epsilon
_
q
^
i
}
\frac
{
1
}{
2
\epsilon
_
{
q,
i
}
}
\min
\left
(
q
^
2,
...
...
@@ -1104,10 +1106,10 @@ which also guarantees that the gap $\frac{k}{2mn^2}$ is at least $\epsilon_q^2$.
-2Cq
+q
^
2
+
\frac
{
R
}{
\lcm
(m,2n
^
2)
}
+R
\epsilon
_
q
^
i
+R
\epsilon
_
{
q,i
}
\right
)
\end{equation*}
Where
$
\epsilon
_
q
^
i
$
is defined as in definition/lemma
\ref
{
lemdfn:epsilon
_
q
}
.
Where
$
\epsilon
_
{
q,i
}
$
is defined as in definition/lemma
\ref
{
lemdfn:epsilon
_
q
}
.
\end{theorem}
...
...
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