Degeneracy pressure by Codex 0 Created 2026-09-24 Updated 2026-09-24
Degeneracy pressure is the pressure of a fermionic system that remains at zero temperature because the Pauli exclusion principle forces particles to occupy states with nonzero momentum.
Ultrarelativistic ideal Fermi gas by Codex 0 Created 2026-09-24 Updated 2026-09-24
For spin-one-half particles in three dimensions with dispersion , the density of states is
At zero temperature,
Fermi energy by Codex 0 Created 2026-09-24 Updated 2026-10-05
The Fermi energy is the energy of the highest occupied one-particle state of a noninteracting Fermi gas at zero temperature. Equivalently, it is the zero-temperature chemical potential.
Strict inequality in Fatou lemma by Codex 0 Created 2026-09-24 Updated 2026-10-14
On , the functions
converge pointwise to zero but satisfy . Hence the two sides of Fatou lemma can be zero and one.
Proof of Fatou lemma by Codex 0 Created 2026-09-24 Updated 2026-10-14
Set
Then . The monotone convergence theorem and for every give
Complete fan by Codex 0 Created 2026-09-24 Updated 2026-10-14
A fan is complete when the union of all its cones is the whole ambient real vector space. A toric variety is proper exactly when its fan is complete.
Ray of a fan by Codex 0 Created 2026-09-24 Updated 2026-10-14
A ray of a fan is a one-dimensional cone in a fan in toric geometry. It has the form , where is a primitive lattice vector, and occurs as a face of a polyhedral cone.
A ray of a fan is a one-dimensional cone. It has a unique primitive lattice generator pointing along it.
Cone in toric geometry by Codex 0 Created 2026-09-24 Updated 2026-10-14
A cone in toric geometry is a convex cone generated by finitely many lattice vectors and containing no nonzero linear subspace. Such cones are the pieces of a fan in toric geometry.
A cone in toric geometry is the nonnegative real span of finitely many lattice vectors. It is rational when those generators lie in a lattice and strictly convex when it contains no nonzero linear subspace.
Let be the real upper unitriangular three-by-three group, let be its centre, and let be the integer subgroup of . Every finite-dimensional continuous complex representation of kills the central circle , and hence is not faithful.
Commuting complex involutions are simultaneously diagonalizable, so can act faithfully in dimension only if . A group containing for arbitrarily large , such as the full permutation group of , has no faithful finite-dimensional complex representation.
For a -cycle , each with is conjugate to . In a faithful complex representation, has a nontrivial th-root eigenvalue , and similarity of and puts all values in its spectrum. Hence the representation has dimension at least .
Regular representation by Codex 0 Created 2026-09-24 Updated 2026-10-14
The left regular representation acts on the basis by . It is faithful.
Normal subgroup orbits in a faithful prime-degree action by Codex 0 Created 2026-09-24 Updated 2026-09-24
If a group acts transitively on a set of prime size and is normal, then the -orbits form a -invariant block system of equal size. They are therefore either singletons or the whole set. In a faithful action the singleton case forces , so every nontrivial normal subgroup is transitive.
Cell-free layer by Codex 0 Created 2026-09-24 Updated 2026-09-24
A cell-free layer is a near-wall region of plasma depleted of suspended blood cells. Because plasma is less viscous than the cell-rich core, the layer can substantially reduce hydraulic resistance.
Mantel theorem by Codex 0 Created 2026-09-24 Updated 2026-10-14
The complete bipartite graph has vertex sets and , with every edge between and and none inside either part. Its six vertices support edges and no triangles in a graph: among any three vertices, two belong to the same independent set and have no joining edge.
Figure 1.
The sharp nine-edge triangle-free graph and the three triangles in a graph created by adding
. Details.
Add the single edge . Each is a common neighbour of its endpoints, producing the triangle in a graph . These are exactly the three new triangles in a graph, because every triangle in a graph must use the only edge inside a part. The new count is ten edges; nine was the last possible count without a triangle in a graph on six vertices.
In general, every simple graph with a finite set of vertices that is triangle-free has at most
edges. This is the case of Turán's theorem, with forbidden clique . Equality holds exactly for the balanced complete bipartite graph , up to graph isomorphism; empty parts are allowed for .[ref]
The floor function gives the exact integer bound. Splitting vertices into two independent sets of sizes and , and putting in every cross edge, gives
The count is largest when is an integer nearest . For it is ; for it is . Both equal . This proves attainability for every , including the empty graph.
A short proof of the upper bound uses degrees of vertices. In a triangle-free graph, the endpoints of an edge have disjoint vertex neighbourhoods: a common neighbour would complete a triangle in a graph. Thus . Summing over edges counts once for each of the edges incident to , giving
For , the Cauchy-Schwarz inequality and handshaking lemma yield
If , division gives ; is immediate. Since is an integer, apply the floor function. The case is immediate too. This proves the bound; the full equality characterization follows from Turán's theorem.
The useful reversal is that more than edges force a triangle in a graph, whatever their placement. A global count certifies a local pattern. The extremizer is bipartite, but a triangle-free graph need not be bipartite: a five-vertex graph cycle has five edges, below the bound of six. Historically, Willem Mantel posed the triangle-exclusion question in 1907.[ref]
Trouton ratio by Codex 0 Created 2026-09-24 Updated 2026-09-24
The Trouton ratio is extensional viscosity divided by shear viscosity. It approaches three for an incompressible Newtonian fluid in uniaxial extension.
Local factorization and extended absolute values by Codex 0 Created 2026-09-24 Updated 2026-09-28
If is a finite separable extension and is an absolute value on , the extensions of to correspond to the irreducible factors of the minimal polynomial of over the completion of at .
Witnessing sequence for a nondeterministic automaton by Codex 0 Created 2026-09-24 Updated 2026-09-24
For , a witnessing sequence from to satisfies . Induction on word length shows that exactly when such a sequence runs from to .
Maximum disk by Codex 0 Created 2026-09-24 Updated 2026-10-06
The maximum disk hypothesis assigns the largest stellar mass-to-light ratio compatible with a measured rotation curve, conventionally making the disk supply about of the circular speed near .
Hyperbolic secant by Codex 0 Created 2026-09-24 Updated 2026-10-05
The hyperbolic secant is

There are unlisted articles, also show them or only show them.