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
f31a1463
Commit
f31a1463
authored
8 months ago
by
Luke Naylor
Browse files
Options
Downloads
Patches
Plain Diff
Complete statement of main lemma about fixing q value
parent
00baee18
No related branches found
No related tags found
No related merge requests found
Pipeline
#39694
failed
8 months ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
tex/bounds-on-semistabilisers.tex
+57
-1
57 additions, 1 deletion
tex/bounds-on-semistabilisers.tex
with
57 additions
and
1 deletion
tex/bounds-on-semistabilisers.tex
+
57
−
1
View file @
f31a1463
...
...
@@ -198,12 +198,68 @@ from plots_and_expressions import c_in_terms_of_q
\qquad
0
\leq
q
\coloneqq
\chern
_
1
^{
\beta
}
(u)
\leq
\chern
_
1
^{
\beta
}
(v)
\end{equation}
Furthermore,
if
$
\beta
$
is rational,
$
\chern
_
1
(
u
)
\in
\ZZ
$
so we only need to consider
Furthermore,
$
\chern
_
1
(
u
)
\in
\ZZ
$
,
so
if
$
\beta
$
is rational
we only need to consider
$
q
\in
\frac
{
1
}{
n
}
\ZZ
\cap
[
0
,
\chern
_
1
^{
\beta
}
(
F
)]
$
,
where
$
n
$
is the denominator of
$
\beta
$
.
For the next subsections, we consider
$
q
$
to be fixed with one of these values,
and we shall be varying
$
\chern
_
0
(
E
)
=
r
$
to see when certain inequalities fail.
\begin{lemma}
Consider the Problem
\ref
{
problem:problem-statement-1
}
(or
\ref
{
problem:problem-statement-2
}
),
and
$
\beta
_{
0
}
\coloneqq
\beta
(
P
)
$
(or
$
\beta
_{
-
}
(
v
)
$
resp.).
\noindent
If
$
u
$
is a solution to the Problem then
$
u
$
satisfies:
\begin{align}
q
\coloneqq
\chern
^{
\beta
_
0
}_
1(u)
&
\in
\left
( 0,
\chern
_
1
^{
\beta
_
0
}
(v)
\right
)
\label
{
lem:eqn:cond-for-fixed-q
}
\\
\chern
_
0(u)
&
>
\frac
{
q
}{
\mu
(v) -
\beta
_
0
}
\nonumber
\end{align}
\noindent
Conversely, any
$
u
=
(
r,c
\ell
,d
\ell
^
2
)
$
with
$
r,c
\in
\ZZ
$
and
$
d
\in
\frac
{
1
}{
\lcm
(
m,
2
)
}
\ZZ
$
satisfying the above Equations
\ref
{
lem:eqn:cond-for-fixed-q
}
is a solution to the Problem if and only if the following are satisfied:
\begin{multicols}
{
3
}
\begin{itemize}
\item
$
\Delta
(
u
)
\geq
0
$
\item
$
\Delta
(
v
-
u
)
\geq
0
$
\item
$
\chern
^
P
_
2
(
u
)
\geq
0
$
\end{itemize}
\end{multicols}
\noindent
Furthermore, suppose
$
\beta
_
0
$
is rational, and written
$
\beta
_
0
=
\frac
{
a
_
v
}{
n
}$
for
some coprime integers
$
a
_
v
$
,
$
n
$
with
$
n>
0
$
.
Then any solution
$
u
$
satisfies:
\begin{align*}
\chern
^{
\beta
_
0
}_
1(u)
&
=
\frac
{
b
_
q
}{
n
}
&
\text
{
for some
}
b
_
q
\in
\left\{
1, 2,
\ldots
, n
\chern
_
1
^{
\beta
_
0
}
(v) - 1
\right\}
\\
a
_
v r
&
\equiv
-b
_
q
\pmod
{
n
}
\end{align*}
And any
$
u
=
(
r,c
\ell
,d
\ell
^
2
)
$
with
$
r,c
\in
\ZZ
$
and
$
d
\in
\frac
{
1
}{
\lcm
(
m,
2
)
}
\ZZ
$
satisfying these equations is a solution to the Problem if and only if, again,
the following are satisfied:
\begin{multicols}
{
3
}
\begin{itemize}
\item
$
\Delta
(
u
)
\geq
0
$
\item
$
\Delta
(
v
-
u
)
\geq
0
$
\item
$
\chern
^
P
_
2
(
u
)
\geq
0
$
\end{itemize}
\end{multicols}
\end{lemma}
\begin{proof}
proof
\end{proof}
\subsection
{
Bounds on
\texorpdfstring
{
`
$
d
$
'
}{
d
}
-values for Solutions of Problems
}
...
...
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