Algebraic Curves Lecture 20

The 20th (probably?) lecture of algebraic curves by Karl Christ
  1. Reminder from before spring break
  2. Castlenuova's Bound
  3. Extremal Curves

Reminder from before spring break

We had a curve CPrC\subseteq \mathbb P^r and a divisor D=HCD = H\cap C given by intersecting CC with a hyperplane HH. Set α=rank(D)\alpha_\ell = \operatorname{rank}(\ell D), EH0(C,D)E_\ell \subseteq H^0(C,\ell \cdot D) given as the image of H0(Pr,OPr())H0(C,D)H^0(\mathbb P^r, \mathcal O_{\mathbb P^r}(\ell))\to H^0(C, \ell\cdot D) and β=rank(E)\beta_\ell =\operatorname{rank}(E_\ell). Note that in particular αβ\alpha_\ell \geq \beta_\ell.

With these definitions we have that

ββ1=h0(Pr,OPr())h6)(Pr,ID())=:S,\begin{aligned} \beta_\ell - \beta_{\ell - 1} &= h^0(\mathbb P^r,\mathcal O_{\mathbb P^r}(\ell)) - h6)(\mathbb P^r, I_D(\ell)) \\ &=: S_\ell, \end{aligned}

which is the "number of conditions imposed by DD on hyperplanes of degree \ell. The long exact sequence on cohomology gives

0H0(Pr,ID())H0(Pr,OPr())φH0(D,OD()),\begin{aligned} 0\to H^0(\mathbb P^r, I_D(\ell)) \to H^0(\mathbb P^r, \mathcal O_{\mathbb P^r}(\ell)) \xrightarrow{\varphi} H^0(D,\mathcal O_{D}(\ell)), \end{aligned}

and S=dim(kerφ)S_\ell = \operatorname{dim}(\operatorname{ker} \varphi). We wanted to estimate SS_\ell, and we had this theorem that said as long as the points comprising DD are in general linear position (which we can assume as long as HH is generic) then Smin{(r1),1}S_\ell \geq \min\{\ell(r - 1), 1\} implies

ββ1Smin{d,(r1)+1}.\begin{aligned} \beta_\ell - \beta_{\ell - 1} \geq S_\ell \geq \min\{d, \ell(r - 1) + 1\}. \end{aligned}

This is where we stopped.

Castlenuova's Bound

Now let's set m=[d1r1]m = \left[\frac{d-1}{r-1}\right], i.e. set mm to be the largest integer such that m(r1)d1m(r - 1) \leq d-1. We get

α1β1rα2β2r+2(r1)+1=3r1rank(mD)=αmβmi=1m(i(r1)+1)=(m+12)(r1)+m.\begin{aligned} \alpha_1 &\geq \beta_1 \geq r \\ \alpha_2 &\geq \beta_2 \geq r + 2(r - 1) + 1 = 3r - 1 \\ &\hspace{5pt}\vdots \\ \operatorname{rank}(m\cdot D) = \alpha_m &\geq \beta_m \geq \sum^m_{i = 1}(i \cdot (r - 1) + 1) = \binom{m+1}{2}(r - 1) + m. \end{aligned}

Here's a trick inequality:

(m+12)(r1)+m=m((m+1)(r1)+2)2>md2.\begin{aligned} \binom{m+1}{2}(r-1) + m = \frac{m\left((m+1)(r - 1) + 2\right)}{2} > \frac{md}{2}. \end{aligned}

This means that mDm\cdot D is non-special, and hence αm=dmg+1\alpha_m = d\cdot m - g + 1. Our original motivation for this whole thing was to find a bound on the genus of CC, so rearranging, we get

g=dm+1αmdm+1(m+12)(r1)m=(m2)(r1)+mϵ\begin{aligned} g = dm + 1 - \alpha_m \leq d m + 1 - \binom{m+1}{2}(r-1) - m = \binom{m}{2}(r-1) + m\cdot \epsilon \end{aligned}

where ϵ\epsilon is the integer required so that d1=(r1)m+ϵd - 1 = (r - 1)m + \epsilon with 0ϵ<r10\leq \epsilon < r-1. This is precisely Castlenuova's bound.

Theorem: (Castelnuovo's bound): Let CPrC\subseteq \mathbb P^r be a non-degenerate curve of degree dd. Then g(C)(m2)(r1)+mϵ=:π(r,d).g(C)\leq \binom{m}{2}(r - 1) + m\cdot \epsilon =: \pi(r, d).

Example:

  1. r=2    ϵ=0    g(m2)=(d12)r = 2\implies \epsilon = 0\implies g \leq \binom{m}{2} = \binom{d- 1}{2}.

  2. r=3r = 3 so then d12=m=m\lfloor \frac{d-1}{2} = m\rfloor = m.

    • Case 1: d=2k+1d = 2k +1, m=km = k and ϵ=0\epsilon = 0 so 2(k2)=k(k1)2\cdot \binom{k}{2} = k(k - 1).

    • Case 2: d=2k,m=k1,ϵ=1d = 2k, m = k - 1, \epsilon = 1 so 2(k12)+(k1)=(k1)22\cdot \binom{k-1}{2} + (k-1) = (k-1)^2.

Observation: Fix rr. for large dd, we get asymptotically π(r,d)d22(r1)\pi(r,d) \sim \frac{d^2}{2(r-1)}.

Extremal Curves

A curve is called (Castelnuovo) extremal if it satisfies g(C)=π(r,d)g(C) = \pi(r, d). The only way this is possible is if

α=β=i=1i(r1)+1\begin{aligned} \alpha_\ell = \beta_\ell = \sum^\ell_{i=1} i (r-1) + 1 \end{aligned}

for all m\ell \leq m. Increasing \ell by one increases β\beta_\ell by min{d,(r1)+1}.\min\{d, \ell(r - 1) + 1\}. This implies

φ:H0(Pr,OPr())H0(C,OC())\begin{aligned} \varphi_\ell:H^0(\mathbb P^r, \mathcal O_{\mathbb P^r}(\ell)) \to H^0(C, \mathcal O_C(\ell)) \end{aligned}

is surjective.

Definition: In this case, CC is called projectively normal. CC is called \ell-normal if φ\varphi_\ell is surjective.

Cor: Any extremal curve is projectively normal (by the above).

Example:

  1. CC is \ell-normal if and only if CC is embedded by complete linear series.

  2. If XX is a genus 44 curve, LL a curve of degree 77, then h0(X,L)=74+1=4.h^0(X,L) = 7 - 4 + 1 = 4.

Black box: A general such LL in (2) above is very ample hence gives an embedding XP3X\to \mathbb P^3 with image of degree 77. Examining the map

φ2:H0(P3,OP3(2))H0(X,L2),\begin{aligned} \varphi_2:H^0(\mathbb P^3, \mathcal O_{\mathbb P^3}(2))\to H^0(X, L^{\oplus 2}), \end{aligned}
we see that the domain has dimension (53)=10\binom{5}{3} = 10 and the codomain has dimension 144+1=11,14 - 4 + 1 = 11, hence φ2\varphi_2 cannot be surjective. This implies φ2(X)\varphi_2(X) is 11-normal but not 22-normal.

©Isaac Martin. Last modified: March 20, 2024.