Bose condensation in a three-dimensional harmonic trap Created 2026-10-18 Updated 2026-10-20
Consider noninteracting bosons in one internal quantum state, at thermal equilibrium in the three-dimensional harmonic oscillator potential
Here is the mass, the positive are angular frequencies, and is their geometric mean. Measure the one-particle energy and chemical potential from the ground-state energy. The quantum harmonic oscillator levels then have with nonnegative integer and reduced Planck constant .
When , counting lattice points can be approximated by the volume of a tetrahedron in the positive octant of :
This is a density of states, with units of inverse energy. The factor is the unit tetrahedron volume; differentiating produces the factor . Treat the single ground state separately: its macroscopic population would be lost by replacing every level with a smooth density of states.
For , integrate the Bose-Einstein distribution over excited energy eigenstates. As approaches zero from below, their maximum population is
Here is the Boltzmann constant and the Riemann zeta function. A short proof uses and . The nonnegative terms permit exchanging summation and integration by Tonelli's theorem, giving . Near zero the integrand is proportional to , so its integral converges. That finite excited-state capacity is the mechanism of Bose-Einstein condensation.
Set . Particle conservation gives, to this continuum accuracy,
Above , the macroscopic condensate fraction is zero and the chemical potential adjusts below zero. This cubic power belongs to a three-dimensional harmonic trap; it is not the homogeneous three-dimensional ideal gas exponent. For , and , the model gives . At , , or approximately condensed bosons. These are chosen parameters and calculated values.
Finite gives a smooth crossover rather than a sharp phase transition. The exact ideal gas sum over excited quantum harmonic oscillator levels differs from the continuum integral, especially when is not large relative to every . A sharp trapped-gas limit takes , with fixed and fixed frequency ratios. Interactions also alter the critical temperature, condensate fraction and release profile; a dilute gas can have appreciable interaction energy compared with the trap level spacing. The cubic law is a useful baseline, not a fit guaranteed for either 1995 experiment.
For independent edge vectors , , , the displacement solves , , . The reciprocal cross-product basis gives the displayed formula. Its squared distances to all four vertices are equal. It need not lie inside the tetrahedron.
Suppose a nonconstant holomorphic map from a connected compact Riemann surface has degree of a holomorphic map two and exactly four distinct branch values of a holomorphic map. The valency theorem forces each of their fibres to contain one ramification point with , a simple ramification point of a holomorphic map. Hence
This determines the genus without recognizing a torus in a drawing.
A concrete realization is the compact Riemann surface obtained by adding the two points at infinity to the even-degree hyperelliptic model given by the algebraic curve
Projection to has degree of a holomorphic map two. At a simple zero of , is a local coordinate and , so . At infinity set and : then . There are two points with , , each unramified since is a local coordinate. The four finite roots are therefore all the branch values of a holomorphic map.[ref]
Figure 1.
Cell-count schematic for a double cover of the sphere with four simple branch values: four vertices, twelve edges and eight faces upstairs
. Details.
Choose a triangulation of a surface on the Riemann sphere with these four branch values of a holomorphic map as vertices, combinatorially the boundary of a tetrahedron. Its counts are . Upstairs, each vertex has one preimage and each open edge and face has two lifts: , giving Euler characteristic . This is a cell schematic, not a geometric immersion of . The Triangulation proof of the Riemann-Hurwitz formula applies the same counting idea after refining a general triangulation of a surface around the branch values of a holomorphic map.[ref]
Identify opposite sides of a square by translations to obtain a torus. All four corners become one vertex; the horizontal sides give one topological cell and the vertical sides one topological cell . The open square supplies one two-dimensional topological cell. Thus and . The cellular boundary of each one-dimensional topological cell is zero because its endpoints agree. Traversing the face boundary gives the group commutator , whose signed counts of both and vanish. Hence its cellular boundary is also zero, and .[ref]
Figure 1.
The tetrahedral sphere and the square presentation of a torus have different alternating cell counts
. Details.
The boundary of a tetrahedron is a two-sphere, with four vertices, six edges and four triangular topological cells: . Its rational Betti numbers are by homology of a sphere. The torus's two independent one-dimensional homology classes cancel its degree-zero and degree-two contributions. The torus and annulus both have Euler characteristic zero, yet different homology groups; one integer cannot recover all of homology.
Finite element mesh Created 2026-10-05 Updated 2026-10-14
A finite element mesh partitions a domain into simple regions called elements, such as intervals, triangles or tetrahedra. In a conforming partition, distinct element interiors are disjoint, their closures cover the domain closure, and any nonempty intersection is a common face, edge or vertex of both elements. Chen's author notes give this compatibility condition for simplicial meshes.[ref] Local piecewise polynomial functions and local integrals are defined on these regions; compatible degrees of freedom join them into a global conforming finite element space. The assembled stiffness matrix and mass matrix then inherit the local overlap pattern.
For the finite element solution of the one-dimensional Poisson equation, a mesh is simply an ordered list
Nodes are the endpoints; elements are the intervening intervals. Four equal elements have five nodes but only three unknown nodal values after imposing the zero Dirichlet boundary conditions. A nonuniform partition such as has element lengths and , so counting elements alone does not measure the largest unresolved scale.
Refining a finite element mesh replaces some or all elements by smaller ones. For continuous piecewise linear functions in one dimension, retaining all old nodes gives nested conforming finite element spaces when every interval is bisected. The old approximation remains available, and the new interior nodes allow additional changes of slope. With a symmetric coercive bilinear form and exact integration, best approximation from Galerkin orthogonality means that the energy norm error cannot increase under such nested refinement.
For the finite element solution of the one-dimensional Poisson equation, uniform refinement from four to eight elements increases the unknown count from three to seven. The exact formulas give maximum errors and , and energy norm errors approximately and . Refinement near a region of strong curvature can spend unknowns where the linear interpolation error matters most; convergence in a general problem still needs approximation and regularity assumptions such as those in the finite element interpolation estimate.
A fundamental normal surface has a nonzero admissible coordinate vector which is not the sum of two nonzero admissible vectors. Fixing the allowed quadrilateral type in every tetrahedron reduces the problem to the Hilbert basis of a rational cone. There are finitely many choices of quadrilateral types and finitely many indecomposable vectors for each choice.
Incenter of a tetrahedron 2026-10-14
The center of the sphere tangent to all four faces is the positive face-area-weighted combination of the opposite vertices. If is the volume and the total face area, its distance from each face is . Indeed its weight for vertex is and the corresponding altitude is , so their product is the common distance. Positive weights place it inside the tetrahedron.
Normal surface 2026-10-14
Relative to a triangulation, a normal surface meets every tetrahedron in disjoint normal disks: four types of triangles cutting off vertices and three types of quadrilaterals separating opposite pairs of edges. A normal disk meets any edge at most once; its face arcs join distinct edges. Two different quadrilateral types cannot coexist in a tetrahedron.
For tetrahedra, count the seven disk types in each tetrahedron. Across each glued face the counts of each of its three normal arc types must agree. These are homogeneous linear equations with integer coefficients. An admissible solution also has at most one nonzero quadrilateral type in each tetrahedron. Matching the arcs in their boundary order reconstructs the normal surface up to an isotopy preserving the tetrahedra.
Orthogonal opposite edges of a tetrahedron Created 2026-10-14 Updated 2026-10-20
Place one vertex of a tetrahedron at the origin and denote the other vertex vectors by . Orthogonality of two pairs of opposite edges of a tetrahedron forces . It follows that the third pair is orthogonal too. The three sums of squared lengths of opposite edges all equal . This gives a dot product test for the special geometry without solving for the face planes.
CO and CO are discrete molecules, whereas the other oxides gain stability from extended bonding or ionic lattices. carbon's compact 2p orbitals overlap effectively with oxygen 2p orbitals, allowing strong multiple bonds that satisfy the valence requirements within small molecules. Intermolecular forces between CO or CO molecules are much weaker than those internal bonds, so low condensation temperatures and gaseous states at room conditions are unsurprising. CO is nonpolar overall but still has London dispersion forces and interactions between electric quadrupoles; “nonpolar” does not mean no attraction.
For larger Group 14 atoms, overlap with oxygen 2p orbitals is less effective for strong localized multiple bonding. SiO instead forms an extended network of SiO tetrahedra with each oxygen bridging two silicon atoms. Breaking or melting the network involves much more than separating intact SiO molecules. The Si–O electronegativity difference is , so these are strongly polar covalent bonds rather than evidence for a molecular solid.
For Pb–O the difference is , and ionic Pb/O or Pb/O descriptions provide useful starting points, with appreciable covalent contributions. PbO has layered structures with asymmetric oxygen coordination consistent with a stereochemically active 6s pair. A common PbO structure is rutile-like, with PbO octahedra linked through oxygen. Extended lattice interactions account for their solid states.[ref] The similar Si–O and Pb–O electronegativity differences show why a single difference threshold cannot determine the entire bonding type, coordination number or structure.
A suitable representative structure is a three-dimensional network of corner-sharing CO tetrahedra, with C–O single bonds. Each carbon is four-coordinate; every bridging oxygen is bonded to two carbons. Sharing four oxygens between two tetrahedra gives oxygens per carbon, so the network retains empirical formula CO without containing separate O=C=O molecules.
High pressure favours a compact, highly coordinated network through its smaller molar volume: at fixed temperature, increasing pressure changes relative Gibbs energies according to . Heating helps overcome the large reconstructive barrier to breaking and redistributing molecular pi bonding and establishing an extended single-bond network. It should not be argued that high temperature by itself favours the lower-entropy network. Nor is merely freezing molecular CO sufficient: dry ice remains a molecular solid.
The sketch shows connectivity and local tetrahedral coordination, not a unique predicted crystal structure. Real amorphous carbonia need not have perfect periodic order or exclusively one coordination environment. The original carbonia experiments combined high-pressure preparation with infrared, Raman and diffraction evidence for loss of molecular character and formation of an amorphous network.[ref]
Figure 1.
Original representative corner-sharing tetrahedral CO2 network fragment; terminal bonds continue into the solid
. Details.
Neutral counting assigns five electrons to cyclopentadienyl ligand and two to CO. Thus each fragment has valence electrons and contributes three skeletal electrons; each fragment has sixteen and contributes four:
For A the six-pair four-vertex count is the nido count derived from a five-vertex trigonal bipyramid. Removing an axial vertex leaves a tetrahedron: the three equatorial vertices plus the remaining axial vertex. For B the corresponding arachno fragment is obtained by removing both axial vertices from that same parent, leaving a three-metal triangle. Small clusters require specifying the parent and removed vertices; mechanically calling every nido fragment a square pyramid is wrong.
The Fe tetramer is indeed known to have a tetrahedral core, with four face-capping CO groups. The carbon atoms of those carbonyls and the iron atoms form interpenetrating tetrahedra, giving a cubane-like Fe–C connectivity. Bridging rather than terminal CO changes the distribution of local donation, not the total electron count above.[ref]
A normal surface meets each tetrahedron in disjoint disks of the four triangular and three quadrilateral types. Its arcs in a face join distinct edges, each disk meets an edge at most once, and at most one quadrilateral type occurs in a tetrahedron. These last requirements exclude, for example, a disk with an octagonal boundary.
We first establish the surgery operation needed for the sphere system. Suppose a disk disjoint from the other spheres compresses one sphere . It produces spheres and . Small parallel copies of the three spheres bound a three-times punctured three-sphere . Denote the old piece on the uncompressed side by , and the two pieces on the compressed side by and . If both and were punctured three-spheres, then glued to them would also be a punctured three-sphere, contrary to the hypothesis on the original cut manifold. Choose, say, which is not of this type, and retain alone in place of .
The other new piece is . It too cannot be a punctured three-sphere. If it were, cap its external boundary spheres to make . All the spheres separating from the attached pieces then bound three-balls by the Three-dimensional Schoenflies theorem; the component containing would be a punctured three-sphere, contradicting the hypothesis on . Thus the sphere surgery preserving nontrivial complementary pieces keeps exactly spheres and keeps every complementary piece nontrivial. The assumption that all spheres separate ensures that the old and new pieces used here really are distinct sides.
Apply general position to the whole sphere system, avoiding the vertices and making it transverse to edges and faces. We describe a terminating normalization, allowing the replacement operation just proved as well as isotopy. If some component of its intersection with a tetrahedron is not a disk, choose a boundary circle innermost among circles not bounding such disk components. A disk just inside the tetrahedral boundary gives a compression; if intervening disk components occur, first push them into collars of their boundary disks. Perform the compression and retain one new sphere as above. This replaces a non-disk tetrahedral piece by disk pieces without increasing edge intersections. Repetition is finite: every compression divides the original sphere along a separating circle, and the sum of over the non-disk planar tetrahedral pieces decreases; disk components can then be put in boundary collars. A closed sphere component wholly in a tetrahedron is impossible, because it would cut off a three-ball, contrary to the complementary-piece condition.
Now each tetrahedral piece is a disk. A face circle innermost in a face allows its incident disk to be moved through that face disk, removing the circle. This reduces the number of face intersections without increasing the edge weight. A returning face arc similarly gives an edge bigon across which the surface can be pushed, reducing the number of edge intersections by two. Restore tetrahedral disk pieces by the preceding operations whenever necessary.
It remains to exclude multiple intersections of a disk with an edge, which the absence of returning face arcs alone does not exclude. Suppose a tetrahedral disk meets an edge twice. Among such disks choose a pair of intersections consecutive on the edge and with no other surface intersection between them. Such a pair exists: an intervening disk crosses the edge interval an even number of times, so passing to an innermost intervening pair eventually gives consecutive points. Join them by an arc in the disk. The disk pieces divide the tetrahedron into three-balls, and this arc together with the edge interval lies in the boundary of one of these three-balls. It therefore bounds a bigon with interior disjoint from the surface. Push across the bigon to reduce edge weight by two. At fixed weight the previous moves reduce face and non-disk complexity; the edge weight itself is a nonnegative integer. Hence the whole process terminates. A final tetrahedral disk meets each edge at most once, and its boundary separates either one vertex from three or two vertices from two. It is respectively a normal triangle or quadrilateral. Thus a normal system of exactly spheres with the required complementary-piece property exists.
For the finite decomposition, we need a bound on such normal systems, not merely an assertion that they have been normalized. Let be the number of faces of the fixed triangulation. In a triangular face cut by normal arcs, all but at most four complementary regions are rectangles between adjacent parallel arcs. Thus at most complementary three-dimensional components contain a nonrectangular face region. Every remaining component is assembled from product regions between parallel normal disks, so is an interval bundle whose boundary components are spheres. Its connected base is either or . The product is a punctured three-sphere, and is excluded. The other possibility is the twisted interval bundle over , namely with a three-ball removed. Each such piece contributes a distinct summand to : gluing along spheres does not identify first-homology classes, by the Mayer–Vietoris sequence. Since separating spheres give components, we obtain the explicit finite bound
For an arbitrary closed connected , first cut out nonseparating spheres. A neighbourhood of one such sphere together with an arc joining its two sides is a punctured -bundle over ; the bundle is the product or the twisted bundle according to the orientation of the attaching identification. Its complement is connected, so this extracts a connected sum factor. The mod-two first Betti number of the remaining capped manifold decreases by one. Hence only finitely many such extractions are possible. The remaining manifolds have only separating spheres.
Whenever a remaining factor is not a prime three-manifold, split it along a sphere into two factors neither homeomorphic to . Viewed in the original remaining manifold, all these successive splitting spheres form a disjoint system whose pieces are not punctured three-spheres. The normalization and bound just proved prohibit infinitely many such splittings. This proves existence of a finite prime decomposition, including for without assuming orientability.
For completeness, both sphere bundles extracted above are prime three-manifolds. Their fundamental group is , so a separating sphere and the van Kampen theorem express as a free product in which one capped factor has trivial fundamental group. Its punctured piece lifts homeomorphically to the universal cover , identified with . That compact lifted piece has one spherical boundary and must be the bounded side of this sphere in . It misses the origin, so the Three-dimensional Schoenflies theorem makes it a three-ball. The corresponding capped factor is , as required.
Suppose now that is orientable. A prime factor which is not an irreducible three-manifold contains a nonseparating sphere: an essential separating sphere would already split it nontrivially. Extracting the corresponding sphere bundle shows that the factor must be . Thus the other nontrivial primes are irreducible.
Consider two prime decompositions. Represent each by a sphere system, including one nonseparating sphere in each factor. The capped pieces are now the irreducible factors and copies of . Make the two sphere systems transverse. To remove their intersections, choose a circle innermost on a sphere of the second system and surger the first system along its disk. Retain both surgery spheres temporarily. The old sphere and the new pair bound a three-times punctured sphere; adding the pair and then deleting the old sphere only inserts or removes spherical punctures.
This operation cannot alter an irreducible capped piece: every new sphere in that piece bounds a three-ball, so it can only split off a punctured piece. The other pieces were already punctured , where the same conclusion follows from the Three-dimensional Schoenflies theorem. After small displacements the surgery removes the chosen intersection circle and introduces none. Repeat until the sphere systems are disjoint. Their union is a common refinement, and its non- capped irreducible pieces are precisely those of each original decomposition. Hence these factors agree, up to order and orientation-preserving homeomorphism.
Finally, the number of factors is determined by
where the sum runs over the common irreducible factors. This uses additivity of first homology under connected sum, not a claim that the fundamental group determines a manifold. Therefore the orientable prime decomposition is unique up to order and insertion or deletion of factors.
For tetrahedra, a normal surface has a vector counting four triangle types and three quadrilateral types in each tetrahedron. On every glued face, the numbers of arcs of each of its three types must agree on the two sides. These give homogeneous integer linear equations
For closed surfaces the coordinates of disks meeting an unglued boundary face must also vanish. The nonnegativity and matching equations are not the whole admissibility condition: in each tetrahedron at most one of its three quadrilateral coordinates can be nonzero. Conversely, for an admissible vector, arrange the prescribed parallel disks and glue their face arcs in order. This reconstructs an embedded normal surface, unique up to normal isotopy.
A fundamental normal surface corresponds to a nonzero admissible vector which cannot be written as with both and nonzero admissible vectors. These indecomposable vectors form a fundamental set: every admissible vector is their finite sum. To find them, fix which quadrilateral type is allowed in each tetrahedron. This leaves the integer points of a rational polyhedral cone , with some coordinates set to zero. Compute its Hilbert basis of a rational cone, for example by subdividing into rational simplicial cones and enumerating the lattice points in their fundamental parallelepipeds along with their integral ray generators, then removing decomposable generators. Repeat the finite list of quadrilateral choices, remove duplicates, and remove vectors decomposable in their compatible sector. Finiteness follows because each of these pointed rational cones has a finite Hilbert basis.
Let be the link exterior. By Alexander duality, for a two-component link
An embedded connected closed surface separates ; its mod-two class is nonzero exactly when the two link components lie on different sides. The connectedness qualification matters: two parallel splitting spheres form a disconnected surface with zero total class. We use the criterion only for connected surfaces.
Normalize a splitting sphere by isotopy, disk compressions and removal of components lying inside tetrahedra. A compression replaces a sphere by two spheres whose mod-two classes add to the old class; at least one is still a splitting sphere. The discarded tetrahedral spheres have zero class. Thus there is a normal splitting sphere. Choose one, , of least normal surface weight.
Suppose its vector is decomposable. Realize as a Haken sum, choosing a decomposition with the least possible number of intersection curves. Two elementary exchange observations are useful. First, and can be taken connected. If their total union has more than two components, perform regular exchanges connecting components until exactly two embedded groups remain, resolving any intersections within each group. Since the final sum is connected, this can be done before the last joining exchange; it uses up at least one of the old intersection curves. The resulting two normal surfaces still have total vector , contradicting minimality. Second, no intersection curve separates both and . If it did, resolve that curve first: the two separated sides give two groups. Resolve any remaining self-intersections within each group and continue exchanges between groups only while the result remains disconnected. Just before the exchange making the final connected surface, there are again exactly two embedded normal groups with fewer intersection curves. Both assertions follow from the local four-bank resolution at an intersection circle; internal crossings are resolved before regarding a group as one embedded summand.
Every closed embedded surface in is orientable. Additivity of Euler characteristic in the Haken sum gives
For connected orientable closed surfaces the positive Euler characteristic is , and the only zero Euler characteristic is that of a torus. Thus one summand, say , is a sphere and the other is a torus. Both have smaller weight than . The sphere cannot split the link by minimality, so
Each intersection circle separates the sphere , so the second exchange observation makes it nonseparating on . In particular, these circles are essential parallel curves on the torus.
Cut along the intersection circles. There are at least two innermost disk patches. Choose one of smallest weight, ; then . Its interior misses , and its boundary is essential on . Compress the torus along two slightly separated copies of . The result is a sphere , and the compression takes place in the exterior, so
Thus is a splitting sphere.
This alone is not quite a contradiction if the last weight inequality is equality: need not yet be normal. At the compression seam it uses the alternative, rather than regular, exchange between the disk patch and the torus. An intersection circle of normal disk sheets must cross a tetrahedral face; it cannot be a closed curve entirely in two disk interiors in one tetrahedron, which can be put in standard position with only intersection arcs. In a face, parallel arcs of the same type do not cross. At a crossing of different normal arc types, the alternative exchange joins two endpoints on the same edge, producing a returning arc. Pushing across its edge bigon strictly reduces weight. Normalize the resulting surface, retaining a nonzero-class sphere at each compression as before. We obtain a normal splitting sphere of weight strictly less than , a contradiction. Therefore
The algorithm is now finite. Triangulate the exterior from a link diagram, enumerate its fundamental admissible vectors with the closed-surface boundary condition, reconstruct their surfaces, and inspect the connected components and Euler characteristics. A fundamental vector yields a connected surface, since otherwise its component vectors decompose it. A connected closed surface in with Euler characteristic two is a sphere. Compute its mod-two class in the finite simplicial chain complex, or equivalently check which link boundary tori lie on either side. Answer yes exactly when such a sphere has nonzero class. The argument proves that every split link is detected, and every detected sphere witnesses splitting. For more than two components, and a nonzero sphere class separates a nonempty proper subset of the components; the same least-weight argument and finite enumeration apply.
Translate one vertex of the tetrahedron to the origin and denote the other vertex vectors by . Translation preserves edge vectors and their dot products. We may label the two known perpendicular pairs of opposite edges of a tetrahedron as the pairs represented by and . Their orthogonality gives
Hence all three pairwise dot products have the same value . The third pair satisfies
so the third pair of opposite edges is also perpendicular.
Expanding squared lengths using the dot product gives
Thus the sums of squared opposite-edge lengths are equal. These two conclusions are the basic identities for orthogonal opposite edges of a tetrahedron.
Take the half-turn about the -axis, represented by the rotation matrix
It is an orthogonal matrix with determinant , and it fixes the -axis while reversing both perpendicular coordinates. Direct substitution gives , , and . A linear map that permutes the four vertices also preserves their convex hull, which is the solid tetrahedron. Hence this rotation matrix leaves invariant. Its axis joins the midpoints of the two opposite edges and .
Move the origin to the centroid and write the four vertex vectors as . Their sum is zero. The midpoints of the first opposite-edge pair have vectors and , so their distances from the centroid are equal. The same argument applies to the other two opposite-edge pairs.
Choose the three midpoint distances as , , . Expanding the dot products,
Identifying these four norms with the vertex distances proves the tetrahedron centroid-to-midpoint sum of squares:
The proof uses no orthogonality or regularity assumption on the tetrahedron.
Use vectors in three-dimensional Euclidean space, with the usual dot product and cross product. The following explicit assignments compute the circumcenter of a tetrahedron:
General position means . The reciprocal cross-product identities give , and . Consequently
and likewise for . Thus is the unique point equidistant from the four vertices. It can lie outside the tetrahedron; no inside constraint should be imposed.
For a point on the plane, the Cauchy-Schwarz inequality gives , because is a unit vector. Equality is achieved at . Thus the distance from the origin is .
Let and let be the perpendicular projection of the sphere's center onto the plane. Every point of the plane has form with . The Pythagorean theorem gives
If , the sphere equation therefore forces . There is exactly one contact point, ; it lies on both surfaces.
Write . The nonzero scalar triple product proves that are linearly independent, so they form a positively oriented basis of and define a nondegenerate tetrahedron.
For the three faces through the origin, choose the inward unit vectors
Their signs are correct because each has positive inner product with the opposite vertex vector. Write the center as . It lies on the interior side of every face. Tangency of the interior sphere therefore means signed distance , not , from each of those three planes. Taking inner products gives
Solving proves the center formula
This is the sphere center from three tetrahedron face distances; the interior hypothesis selects these signs rather than an exterior center.
Finally set . The scalar triple product identities give . In particular , and the plane through the three vertices is
The second formula follows by normalizing to a unit vector and applying the first distance result.