Skip to content
Snippets Groups Projects
Commit 79f9d3fa authored by Luke Naylor's avatar Luke Naylor
Browse files

Simplify expression in proof of theorem 6.1

parent b5521d59
No related branches found
No related tags found
No related merge requests found
Pipeline #27454 passed
...@@ -919,15 +919,18 @@ radius of the pseudo-wall being positive ...@@ -919,15 +919,18 @@ radius of the pseudo-wall being positive
\begin{sagesilent} \begin{sagesilent}
var("Delta", domain="real") # placeholder for the specific values of 1/epsilon var("Delta", domain="real") # placeholder for the specific values of 1/epsilon
assymptote_gap_condition1 = (1/Delta < bgmlv2_d_upperbound_exp_term)
assymptote_gap_condition2 = (1/Delta < bgmlv3_d_upperbound_exp_term_alt2)
r_upper_bound1 = ( r_upper_bound1 = (
(1/Delta < bgmlv2_d_upperbound_exp_term) assymptote_gap_condition1
* r * Delta * r * Delta
) )
assert r_upper_bound1.lhs() == r assert r_upper_bound1.lhs() == r
r_upper_bound2 = ( r_upper_bound2 = (
(1/Delta < bgmlv3_d_upperbound_exp_term_alt2) assymptote_gap_condition2
* (r-R) * Delta + R * (r-R) * Delta + R
) )
...@@ -951,7 +954,6 @@ assert r_upper_bound2.lhs() == r ...@@ -951,7 +954,6 @@ assert r_upper_bound2.lhs() == r
\sage{r_upper_bound2.rhs()} \sage{r_upper_bound2.rhs()}
\right) \right)
\end{align*} \end{align*}
\egroup
Taking the maximum of this expression over Taking the maximum of this expression over
$q \in [0, \chern_1^{\beta}(F)]\cap \frac{1}{n}\ZZ$ $q \in [0, \chern_1^{\beta}(F)]\cap \frac{1}{n}\ZZ$
...@@ -967,12 +969,14 @@ are elements of $\frac{1}{\lcm(m,2n^2)}\ZZ$. ...@@ -967,12 +969,14 @@ are elements of $\frac{1}{\lcm(m,2n^2)}\ZZ$.
So, if any of the two upper bounds on $d$ come to within So, if any of the two upper bounds on $d$ come to within
$\frac{1}{\lcm(m,2n^2)}$ of this lower bound, then there are no solutions for $\frac{1}{\lcm(m,2n^2)}$ of this lower bound, then there are no solutions for
$d$. $d$.
Hence any corresponding $r$ cannot be a rank of a
pseudo-semistabilizer for $v$.
Considering equations To avoid this, we must have,
considering equations
\ref{eqn:bgmlv2_d_bound_betamin}, \ref{eqn:bgmlv2_d_bound_betamin},
\ref{eqn:bgmlv3_d_bound_betamin}, \ref{eqn:bgmlv3_d_bound_betamin},
\ref{eqn:positive_rad_d_bound_betamin}, \ref{eqn:positive_rad_d_bound_betamin}.
this happens when:
\bgroup \bgroup
...@@ -995,13 +999,16 @@ bounds_too_tight_condition2 = ( ...@@ -995,13 +999,16 @@ bounds_too_tight_condition2 = (
) )
\end{sagesilent} \end{sagesilent}
\bgroup
\def\psi{\chern_1^{\beta}(F)}
\begin{equation} \begin{equation}
\min\left( \min\left(
\sage{bgmlv2_d_upperbound_exp_term}, \sage{bgmlv2_d_upperbound_exp_term},
\sage{bgmlv3_d_upperbound_exp_term_alt.subs(chbv==0)} \sage{bgmlv3_d_upperbound_exp_term_alt2}
\right) \right)
< \epsilon := \frac{1}{\lcm(m,2n^2)} \geq \epsilon := \frac{1}{\lcm(m,2n^2)}
\end{equation} \end{equation}
\egroup
\begin{sagesilent} \begin{sagesilent}
# rearrange the "tightness" conditions in terms of r # rearrange the "tightness" conditions in terms of r
...@@ -1023,26 +1030,22 @@ assert bounds_too_tight_condition2.rhs() == r ...@@ -1023,26 +1030,22 @@ assert bounds_too_tight_condition2.rhs() == r
\noindent \noindent
This is equivalent to: This is equivalent to:
\bgroup
\def\psi{\chern_1^{\beta}(F)}
\def\Delta{\lcm(m,2n^2)}
\begin{equation} \begin{equation}
r > \label{eqn:thm-bound-for-r-impossible-cond-for-r}
r \leq
\min\left( \min\left(
\sage{ \sage{
bounds_too_tight_condition1.lhs() r_upper_bound1.rhs()
.expand()
.factor()
} , } ,
\sage{ \sage{
bounds_too_tight_condition2.lhs() r_upper_bound2.rhs()
.expand()
.factor()
} }
\right) \right)
\end{equation} \end{equation}
\egroup
If this condition holds for all $q$, then there are no solutions for $d$,
and therefore $r$ cannot satisfy this condition for all $q$.
Taking the maximum of all these expressions over $q$, and substituting the value
for $\epsilon$ gives the result.
\egroup % end scope where epsilon redefined \egroup % end scope where epsilon redefined
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment