We have a correspondence between maps to Pn and line bundles, so an embedding φ:C↪P3 gives a line bundle L=φL∗OP3(1)=OP3(1)∣C=KC and each line bundle L gives an embedding φ:C↪P3. CHECK THIS AFTER CLASS
where Wi1...ik−1jℓ is the coordinate corresponding to the k×k minor with rows in i1...ik−1jℓ under the Plücker embedding. Such relations are called the Plücker relations.
Example: Consider the Plücker embedding φ:G(2,4)→⋀2V and choose W∈G(2,4). Choose a basis v1,v2 of W where
Now take sequences i1=1 (only option) and j1=1,j2=2,j3=3 (k=2 and n=4). Then the Plücker relation is given
−0+W12⋅W13−W13⋅W12=0,
which is always true. Taking i1=1, j1=2,j3=3,j4=4 and we get
−W12⋅W34+W13⋅W24−W14⋅W23=0,
which is a nonempty statement. This is the only Plücker relation in this case. This realizes G(2,4) as a quadric hypersurface in P5.
Claim:λ∈⋀2V is decomposable if and only if λ∧λ=0.
Proof. One direction is immediate. For the other direction, suppose λ is indecomposable and write it λ=e1∧e2+e3∧e4 for some choice of coordinates on V. Then
(λ∧λ)=2(e1∧e2∧e3∧e4)=0.
Note that λ∧λ lives in ⋀4V.
□
Let's return to the above example of G(2,4) and the Plücker relation
−W12⋅W34+W13⋅W24−W14⋅W23=0.
We now have a characterization of decomposable elements, so for
The coefficient λ12⋅λ34−λ13⋅λ24+λ14⋅λ23 gives the Plücker relation. Set
Σ={(x,H)∣x∈H}⊆Pn×G(k,Pn)
and consider the projections π1:Σ→Pn and π2:Σ→G(k,Pn). We call Σ an incidence variety. It is a subvariety since the condition x∈H means that x∧b1∧...∧bk=0 where b1,...,bk is a basis for H, and hence
Σ={(x,h)∣x∧b1∧...∧bk=0}
meaning that Σ is a variety since x∧b1∧...∧bk is a polynomial equation.
For any subvariety Y⊆G(k,Pn), I get a subvariety π1(π2−1(Y)) of Pn. If I take two subvarieties X,Y⊆Pn and consider the rational map
φ:X×Y(x,y)→G(1,Pn)↦x∧y
defined outside the set x=y in X×Y, then we can define two new varieties
J(X,Y)Sec(X)=π1(π2−1(imgφ))=J(X,X)"join of X and Y""secant variety".
These have dimensions satisfying
dim(J(X,Y))dim(Sec(X))≤dim(X)+dim(Y)+1≤2dimX+1.
Example: Take X to be a curve in Pn with n≥3.
dim(Sec(X))=1 if and only if X is a line.
dim(Sec(X))=2 if and only if X is contained in a plane but not a plane.
dim(Sec(X))=3 if and only if X is not contained in a plane.