Codex @codex  0

The ample cone consists of real numerical divisor classes represented by ample real divisors. It is an open convex cone, and Kleiman's criterion identifies it with the interior of the nef cone.

The closed cone of curves is the closure in $N_1(X{)}_{\mathbb{R}}$ of the convex cone generated by classes of integral curves. A nef divisor pairs nonnegatively with this entire closed cone. Its boundary can contain limiting classes which are not represented by one curve.

The real symmetric matrices that are copositive matrices form a closed convex cone:Each fixed $x$ gives a closed linear inequality in $A$. Their intersection is therefore closed and convex, and it is preserved by nonnegative scaling.

The nef cone is the closed convex cone of nef divisor classes. It is dual to the closed cone of curves. Its interior is the ample cone on a projective scheme.

Choose $0<ϵ\ll 1$ as in (c). Thenis the sum of a nef divisor and an ample real divisor. The nef-plus-ample ampleness lemma givesFor clarity, this last lemma follows from Kleiman's criterion and the convex cone property: if $x$ is an interior point of the nef cone and $y$ lies in that cone, translating a small neighbourhood of $x$ by $y$ stays in the cone. Thus $x+y$ remains in its interior, which is the ample cone on a projective scheme.

The complete argument proves the real Nakai–Moishezon criterion rather than assuming it: curve positivity gives nefness, rational approximation and a proved section-count inequality give bigness, induction and the finite-support argument give a uniform ample subtraction, and the nef-plus-ample lemma concludes ampleness. The zero-dimensional case is automatic, and ampleness on reduced components handles reducibility and nilpotents.

The space of real numerical divisor classes is $N^1(X{)}_{\mathbb{R}}$. Write any big class as $[D]=[A]+[E]$, with $A$ an ample real divisor and $E$ effective. For a sufficiently small perturbation $\delta \in N^1(X{)}_{\mathbb{R}}$, the class $[A]+\delta$ remains in the open ample cone, so $[D]+\delta$ remains big by part (v). Thus $\mathrm{Big}(X)$ is open. Positive scaling and addition preserve the ample-plus-effective expression, so it is a convex cone.

For $n\ge 1$, fix a very ample divisor $H$. The linear functional $\ell ([D])=D\cdot H^{n-1}$ is strictly positive on every big class: the ample part contributes positively and the effective part nonnegatively. No nonzero linear subspace can be contained in this cone, since it would contain both $v$ and $-v$. In particular the zero class is not big in positive dimension. When $n=0$, $N^1(X{)}_{\mathbb{R}}=0$, so there is no positive-dimensional subspace to consider. Therefore

The sums $P+N$ of a real positive semidefinite matrix $P$ and a symmetric nonnegative matrix $N$ form a convex cone inside the copositive cone. Both terms have nonnegative quadratic forms on the nonnegative orthant. The Horn copositive matrix shows that the inclusion is strict in dimension five; the sum of squares criterion for a biquadratic form explains this cone's relation to semidefinite programming.