Every feasible sign vector gives the rank-one matrix . It is a positive semidefinite matrix, since , and . The matrix trace identity gives
Thus all original feasible objectives appear among the relaxed ones, proving
The semidefinite relaxation of binary quadratic optimization drops the rank-one requirement and keeps the elliptope constraints.
An optimal relaxed matrix exists. The feasible set is nonempty, since it contains , and closed. Its two-by-two principal minors give , so it is bounded and therefore compact. The linear objective attains its maximum. Also and hence , including the zero-objective case.
Split the sign vector as . Multiplication of the two off-diagonal blocks gives
because the two terms are the same real scalar. The map is a bijection between the feasible sign choices. Therefore
This is the symmetric lifting of bipartite binary quadratic optimization to binary quadratic optimization. The factor is necessary: otherwise the two blocks would double the objective. No positive semidefiniteness of is assumed; generally its off-diagonal structure makes its quadratic form indefinite.
For in the dual cone , copositivity of gives . An upper-bounding Lagrangian for the maximization is therefore
Its supremum over unrestricted is finite precisely when . Minimizing that upper bound gives the conic program
This is completely positive optimization, not simply semidefinite programming: is the completely positive cone.
There is also a direct equality certificate. Every feasible , , has . Its objective is a weighted average of the nonnegative-sphere Rayleigh quotients, hence is at least . For a minimizing unit vector from part (g), is feasible and has objective . Thus attains the dual and both values agree, without relying on unverified regularity assumptions.
Let . This set is nonempty and compact for , and the quadratic form is continuous. Its minimum is therefore attained.
For every nonzero in the nonnegative orthant, normalizing gives
The zero vector imposes no further condition. It follows that is a copositive matrix exactly when . Thus the feasible scalar set is , and
Both optima are attained. This copositive reformulation of an orthant Rayleigh minimum follows directly from homogeneity; it does not require invoking a duality theorem for the original nonconvex constraint.
The restriction to matters. For the matrix in part (a), this minimum is whereas the unrestricted smallest eigenvalue is .
The real vector space of symmetric matrices has dimension . By the conic Carathéodory theorem, every member of is a conic combination of at most generators. Absorb each nonnegative coefficient into its vector through .
If converges to , write, padding with zero vectors if necessary,
The matrix trace satisfies
The left side is bounded because converges. Thus the finite tuple is bounded. The Bolzano-Weierstrass theorem gives a subsequence on which every vector converges, say . Continuity of the outer product now gives . Hence
This proves closedness of the completely positive cone. The uniform bound on the number of factors and the matrix trace bound are both essential: an arbitrary conic hull of a closed generating set need not be closed.
For a convex cone in an inner product space, use the nonnegative-pairing convention
Here the pairing is the Frobenius inner product on real symmetric matrices. Let be the conic hull of the nonnegative rank-one matrices , and let . For , . This extends to conic combinations, and by continuity to their limits. Hence .
For the converse, if , separation from a closed convex cone supplies a symmetric with
In particular for every , so . The negative pairing then excludes from . Therefore
The same generator test gives . This is the duality of copositive and completely positive cones; the next argument removes the closure.
A pointed cone has no nonzero line through the origin: equivalently . If , its quadratic form vanishes on the nonnegative orthant. Testing the coordinate vectors gives . Testing then gives
Since is a symmetric matrix, every entry is zero. Thus .
The identity matrix gives an interior point. For a symmetric perturbation with operator norm , the Cauchy-Schwarz inequality gives
This open norm ball around lies even in the positive semidefinite cone, hence in . Consequently and the interior is nonempty.
More generally, the interior of the copositive cone consists exactly of strictly copositive matrices. Positivity on the compact nonnegative unit sphere has a positive minimum and persists under small perturbations; a zero there is destroyed by an arbitrarily small negative multiple of .
For each fixed in the nonnegative orthant, the map is a continuous linear function on the vector space of real symmetric matrices. Thus
is an intersection of closed half-spaces, using the Frobenius inner product on this space. Arbitrary intersections of closed sets are closed, so is closed.
If and , then for every . Therefore , including the zero matrix when . Hence
The copositive cone is defined in the real space of symmetric matrices; symmetry is needed later to recover every matrix entry from these quadratic forms.
For in the nonnegative orthant, the positive semidefinite matrix satisfies . The nonnegative matrix satisfies
since every summand is nonnegative. Adding these inequalities proves
Consequently is a copositive matrix. The symmetry of follows from that of and ; entrywise nonnegativity alone need not imply positive semidefiniteness.
This gives the inclusion of the positive-semidefinite-plus-nonnegative cone in the copositive cone. It is only a sufficient construction; the argument does not claim that every copositive matrix has this decomposition in arbitrary dimension.
For a vector in the nonnegative orthant, the PDF's matrix gives the quadratic form
Thus it is a copositive matrix. On the other hand, with ,
so it is not a positive semidefinite matrix. Equivalently, the eigenvalues are and , with eigenvectors and .
The local TeX has corrupted the matrix entries. The PDF has diagonal entries one and off-diagonal entries two. The all-twos matrix in the TeX would instead have quadratic form and would be a positive semidefinite matrix; it cannot demonstrate the requested distinction.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact