Abstract

In 1989, Lieb proved two theorems about the Hubbard model. One showed that the ground state of the attractive model was a spin singlet state (S = 0) was unique and was positive definite. The other showed that the ground state of the repulsive model on a bipartite lattice at half-filling has a total spin given by [Formula: see text](N[Formula: see text]NB)/2[Formula: see text], corresponding to the difference of the number of lattice sites on the two sublattices divided by two. In the mid to late 1990s, Shen extended these proofs to show that the pseudospin of the attractive model was minimal until the electron number equaled 2NA where it became fixed at J = [Formula: see text](N[Formula: see text]NB)/2[Formula: see text] until the filling became 2NB, where it became minimal again. In addition, Shen showed that a spin tower exists for the spin eigenstates for the half-filled case on a bipartite lattice. The spin tower says the minimal energy state with spin S is higher in energy than the minimal energy state with spin S − 1 until we reach the ground-state spin given above. One long-standing conjecture about this model remains, namely, does the attractive model have such a spin tower for all fillings, which would then imply that the repulsive model has minimal pseudopsin in its ground state. While we do not prove this last conjecture, we provide a quick review of this previous work, provide a constructive proof of the pseudospin of the attractive model ground state, and describe the challenges by proving the remaining open conjecture.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.