Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $E$ be a vector space of dimension $d\ge4$ over $K$, and $2\le m\le d$ be an integer. I am interested in the characterization of those elements $\omega$ of $\Lambda^m(E)$ that can be written in the simplest form $v_1\wedge\cdots\wedge v_m$. Equivalently, the line $K\omega$ is a point in the Grassmannian $G_{m,d}(K)$.

When $m=2$, the necessary and sufficient condition is that $\omega\wedge\omega=0$. When $m=d-2$, we may use a duality map $\Lambda^2(E)\leftrightarrow\Lambda^{d-2}(E)$ to derive a NSC in the form $\omega'\wedge\omega'=0$. In both cases, the characterization is given by polynomial equations in the coefficients of $\omega$ in some basis. I expect that such a characterization exists for every pair $(m,d)$, but I do not see what it must be. Clearly, a condition like $\omega\wedge\omega=0$ is not correct; there are several reasons for that. For instance, not all $\omega$ are elementary products when $d<2m$, yet we have $\omega\wedge\omega\equiv0$. Also, if $m=3$ and $d\ge5$, a non-zero element $\omega=\alpha\wedge v$ where $\alpha\in\Lambda^2(E)$ is not elementary, is not an elementary product, yet satisfies $\omega\wedge\omega=0$.

share|improve this question
3  
You're after the Plücker embedding. Alas the wikipedia page is inadequate. The explicit equations are those labelled (*) or (**) in page 211 of Griffiths and Harris. –  José Figueroa-O'Farrill Nov 14 '11 at 12:20
add comment

1 Answer 1

up vote 6 down vote accepted

Griffiths and Harris, p. 209: the conditions on a multivector that it be decomposable are precisely that its equals its annihilator under wedge product, and is equivalent to the vanishing of a collection of quadratic equations, given explicitly on p. 211, in terms of homogeneous coordinates.

share|improve this answer
    
Thanks! This is what I was looking for. –  Denis Serre Nov 14 '11 at 13:28
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.