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
53ffe344
Commit
53ffe344
authored
8 months ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Sort out statements and introduction leading up to bounds on d
parent
805b5419
No related branches found
Branches containing commit
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
+38
-25
38 additions, 25 deletions
tex/bounds-on-semistabilisers.tex
with
38 additions
and
25 deletions
tex/bounds-on-semistabilisers.tex
+
38
−
25
View file @
53ffe344
...
...
@@ -161,27 +161,8 @@ corresponding $\chern_1^{\beta}(u)$ fail one of the inequalities (which is what
was implicitly happening before in the proof of Theorem
\ref
{
thm:loose-bound-on-r
}
).
First, let us fix a Chern character
$
v
$
with
$
\Delta
(
v
)
\geq
0
$
,
$
\chern
_
0
(
v
)
>
0
$
, or
$
\chern
_
0
(
v
)=
0
$
and
$
\chern
_
1
(
v
)
>
0
$
,
and some solution
$
u
$
to the Problem
\ref
{
problem:problem-statement-1
}
or
\ref
{
problem:problem-statement-2
}
.
Take
$
\beta
_
0
=
\beta
(
P
)
$
where
$
P
\in\Theta
_
v
^
-
$
is the choice made in problem
\ref
{
problem:problem-statement-1
}
(or
$
\beta
_
0
=
\beta
_{
-
}$
for problem
\ref
{
problem:problem-statement-2
}
).
\begin{align}
\chern
(F) =
\vcentcolon\:
v
\:
=
&
\:
(R,C
\ell
,D
\ell
^
2)
&&
\text
{
where
$
R,C
\in
\ZZ
$
and
$
D
\in
\frac
{
1
}{
\lcm
(
m,
2
)
}
\ZZ
$}
\nonumber
\\
u
\coloneqq
&
\:
(r,c
\ell
,d
\ell
^
2)
&&
\text
{
where
$
r,c
\in
\ZZ
$
and
$
d
\in
\frac
{
1
}{
\lcm
(
m,
2
)
}
\ZZ
$}
\label
{
eqn:u-coords
}
\end{align}
\begin{lemma}
\label
{
lem:fixed-q-semistabs-criterion
}
Consider the Problem
\ref
{
problem:problem-statement-1
}
(or
\ref
{
problem:problem-statement-2
}
),
and
$
\beta
_{
0
}
\coloneqq
\beta
(
P
)
$
(or
$
\beta
_{
-
}
(
v
)
$
resp.).
...
...
@@ -214,6 +195,7 @@ Take $\beta_0 = \beta(P)$ where $P\in\Theta_v^-$ is the choice made in problem
\end{proof}
\begin{corollary}
\label
{
cor:rational-beta:fixed-q-semistabs-criterion
}
Consider the Problem
\ref
{
problem:problem-statement-1
}
(or
\ref
{
problem:problem-statement-2
}
),
and suppose that
$
\beta
_{
0
}
\coloneqq
\beta
(
P
)
$
(or
$
\beta
_{
-
}
(
v
)
$
resp.) is
rational, and written
$
\beta
_
0
=
\frac
{
a
_
v
}{
n
}$
for
...
...
@@ -248,11 +230,40 @@ Take $\beta_0 = \beta(P)$ where $P\in\Theta_v^-$ is the choice made in problem
\subsection
{
Bounds on
\texorpdfstring
{
`
$
d
$
'
}{
d
}
-values for Solutions of Problems
}
This section studies the numerical conditions that
$
u
$
must satisfy as per
lemma
\ref
{
lem:num
_
test
_
prob1
}
(or corollary
\ref
{
cor:num
_
test
_
prob2
}
)
and reformulates them as bounds on
$
d
$
from Equation
\ref
{
eqn:u-coords
}
.
This is done to determine which
$
r
$
values lead to no possible values for
$
d
$
.
Let
$
v
$
be a Chern character with
$
\Delta
(
v
)
\geq
0
$
,
$
\chern
_
0
(
v
)
>
0
$
, or
$
\chern
_
0
(
v
)=
0
$
and
$
\chern
_
1
(
v
)
>
0
$
,
and consider Problem
\ref
{
problem:problem-statement-1
}
or
\ref
{
problem:problem-statement-2
}
.
Take
$
\beta
_
0
=
\beta
(
P
)
$
where
$
P
\in\Theta
_
v
^
-
$
is the choice made in problem
\ref
{
problem:problem-statement-1
}
(or
$
\beta
_
0
=
\beta
_{
-
}$
for problem
\ref
{
problem:problem-statement-2
}
).
Lemma
\ref
{
lem:fixed-q-semistabs-criterion
}
states that any solution
\[
u
\coloneqq
\:
(
r,c
\ell
,d
\ell
^
2
)
\qquad
\text
{
where $r,c
\in
\ZZ
$ and $d
\in
\frac
{
1
}{
\lcm
(
m,
2
)
}
\ZZ
$
}
\label
{
eqn:u
-
coords
}
\]
to the Problem satisfies
\[
q
\coloneqq
\chern
_
1
^{
\beta
_
0
}
(
u
)
\in
\left
(
0
,
\chern
_
1
^{
\beta
_
0
}
(
v
)
\right
)
\]
and also gives a lower bound for
$
r
$
when considering
$
u
$
with a fixed
$
q
$
.
This Section studies the extra numerical conditions that such
$
u
$
must satisfy
as per that Lemma, and will express them as bounds on
$
d
$
in terms of
$
r
$
(for a
fixed
$
q
$
).
These bounds will later be used in Subsections
\ref
{
subsec:bounds-on-semistab-rank-prob-1
}
and
\ref
{
subsec:bounds-on-semistab-rank-prob-2
}
to construct upper bounds on
$
r
$
(in a similar way to how a bound on
$
\chern
_
0
(
u
)
$
was found in the proof of
Theorem
\ref
{
thm:loose-bound-on-r
}
by considering bounds on
$
\chern
^{
\beta
_
0
}_
0
(
u
)
$
in terms of the former).
\subsubsection
{
Size of pseudo-wall
\texorpdfstring
{
:
$
\chern
_
2
^
P
(
u
)
>
0
$}{}}
\label
{
subsect-d-bound-radiuscond
}
...
...
@@ -594,6 +605,7 @@ A generic example of this is plotted in Figure
\subsection
{
Bounds on Semistabilizer Rank
\texorpdfstring
{$
r
$}{}
in Problem
\ref
{
problem:problem-statement-1
}}
\label
{
subsec:bounds-on-semistab-rank-prob-1
}
As discussed at the end of subsection
\ref
{
subsubsect:all-bounds-on-d-prob1
}
(and illustrated in Figure
\ref
{
fig:problem1:d
_
bounds
_
xmpl
_
gnrc
_
q
}
),
...
...
@@ -671,6 +683,7 @@ following Lemma \ref{lem:prob1:convenient_r_bound}.
\subsection
{
Bounds on Semistabilizer Rank
\texorpdfstring
{$
r
$}{}
in Problem
\ref
{
problem:problem-statement-2
}}
\label
{
subsec:bounds-on-semistab-rank-prob-2
}
Now, the inequalities from the above subsubsection
\ref
{
subsubsect:all-bounds-on-d-prob2
}
will be used to find, for
...
...
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