Generic forms of low Chow rank Douglas A. Torrance Piedmont College - - PowerPoint PPT Presentation

generic forms of low chow rank
SMART_READER_LITE
LIVE PREVIEW

Generic forms of low Chow rank Douglas A. Torrance Piedmont College - - PowerPoint PPT Presentation

Introduction Tools Results Generic forms of low Chow rank Douglas A. Torrance Piedmont College January 6, 2017 Douglas A. Torrance Piedmont College Generic forms of low Chow rank Introduction Tools Results Definition Let k be an


slide-1
SLIDE 1

Introduction Tools Results

Generic forms of low Chow rank

Douglas A. Torrance

Piedmont College

January 6, 2017

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-2
SLIDE 2

Introduction Tools Results Definition

Let k be an algebraically closed field of characteristic 0, R = k[x0, . . . , xn] a polynomial ring with the usual grading, and Rd the dth graded piece of R. Definition If f ∈ Rd, then the Chow rank of f is the least s for which there exist ℓi,j ∈ R1 such that f = ℓ1,1 · · · ℓ1,d + · · · + ℓs,1 · · · ℓs,d, i.e., f may be written as the sum of s completely reducible forms. Example Since x2 − y2 = (x + y)(x − y), its Chow rank is 1.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-3
SLIDE 3

Introduction Tools Results Motivation

The Chow rank tells us something about the computational complexity of evaluating a form. Example Suppose f (x, y) = x2 − y2. Then f (2, 1) = 2 × 2 − 1 × 1 = 4 − 1 = 3, which requires 2 multiplications. But also f (2, 1) = (2 + 1) × (2 − 1) = 3 × 1 = 3,

  • nly requiring 1 multiplication.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-4
SLIDE 4

Introduction Tools Results Secant varieties

Definition Let X be a projective variety. A secant (s − 1)-plane to X is the linear subspace spanning s points of X, e.g., 2 points determine a secant line, 3 points a secant plane, etc. The sth secant variety of X is the Zariski closure of the union of all (s − 1)-planes to X, denoted σs(X). If f , g1, . . . , gs ∈ Rd, [gi] ∈ X ⊂ PRd, and f = g1 + · · · + gs, then [f ] ∈ σs(X).

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-5
SLIDE 5

Introduction Tools Results Secant varieties

Definition The Chow variety (aka split variety, variety of completely decomposable forms, or variety of completely reducible forms) is Splitd(Pn) = {[ℓ1 · · · ℓd] : ℓi ∈ R1}, i.e., the variety in PRd corresponding to the completely reducible forms. So the Chow rank of a generic form f is the smallest s for which σs(Splitd(Pn)) = PRd.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-6
SLIDE 6

Introduction Tools Results Terracini’s lemma

Lemma (Terracini) Let p1, . . . , ps ∈ X be generic. Then dim σs(X) = dimTp1X, . . . , TpsX. We can reduce the problem of finding the dimension of a secant variety to finding the rank of a matrix!

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-7
SLIDE 7

Introduction Tools Results Induction

Suppose A is the matrix whose rank determines the dimension of σs(Splitd(Pn)). By careful choice of our points p1, . . . , ps, we can find matrices B, C, and D corresponding to spaces of forms with n variables and degrees d, d − 1, and d − 2, respectively, such that A =   B C D   . Then rank A = rank B + rank C + rank D.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-8
SLIDE 8

Introduction Tools Results Induction

Using induction, we obtain the following result. Theorem (T.) If dim σs(Splitd(Pn0)) = s(dn0 + 1) − 1, then dim σs(Splitd(Pn)) = s(dn + 1) − 1 for all n ≥ n0.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-9
SLIDE 9

Introduction Tools Results Calculations

For fixed s, this reduces finding dim σs(Splitd(Pn)) for all n, d to checking finitely many base cases. d n 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 s = 9

  • prev. known

check induction

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-10
SLIDE 10

Introduction Tools Results Calculations

Using Macaulay2 to check as many of these base cases as possible, we obtain the following result. Theorem (T.) If s ≤ 35, then dim σs(Splitd(Pn)) = min

  • s(dn + 1),

n + d d

  • − 1,

except for some previously known special cases when d = 2.

Douglas A. Torrance Piedmont College Generic forms of low Chow rank

slide-11
SLIDE 11

Introduction Tools Results Calculations

Thank you!

Douglas A. Torrance Piedmont College Generic forms of low Chow rank