Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
When the singular free-energy density has , the same thermal and free-energy metric factors multiply the singular heat capacity above and below the critical point. Their ratio cancels these factors and depends only on the normalized scaling functions of the universality class. This statement concerns singular amplitudes, not regular heat-capacity backgrounds, and needs separate treatment at logarithmic resonances or zero amplitudes. Branch matching constants belong to the fixed-point scaling functions and cannot be chosen as independent nonuniversal parameters.
The pairing map to a Cartesian product is injective exactly when its coordinate functions are jointly injective in the displayed sense. Either coordinate being injective is sufficient, but neither need be injective individually. For example, pairing three points with distinguishes all points even though each coordinate separately identifies two of them.
An intersection-free uniform set family is a uniform set family with no three distinct members satisfying . For distinct members of a rank- family, , so using strict containment gives the same restriction. Fixing one member turns the other members' intersections with it into distinct antichain traces, giving the antichain trace bound for intersection-free families.
A Cauchy sequence in the uniform metric has a pointwise limit in the complete target, and the common Cauchy bound makes convergence uniform. The triangle inequality with one fixed continuous approximant shows that the limit is continuous. Thus the space of all continuous maps into a bounded complete metric space is complete, with no compactness assumption on the domain.
For each fixed finite uniform hypergraph , having few copies of forces small edge-edit distance from an -free hypergraph. More precisely, for every there is such that fewer than copies can be eliminated by deleting fewer than edges in an -uniform hypergraph. Strong regularity for three-uniform hypergraphs and a relative counting lemma prove the case .
Strong regularity refines both the vertex classes and the pair graphs supporting triple hyperedges. The resulting triads in a hypergraph regularity partition have nearly constant relative triple density outside a small exceptional weight. Pair and triple errors must be chosen in a hierarchy strong enough for a relative tetrahedron counting lemma; ordinary graph regularity on the vertex partition alone is insufficient. Refinement raises bounded conditional-density energies.
Uniform derivative convergence with an anchored value by
Codex 0 Created 2026-10-07 Updated 2026-10-14
Let be continuously differentiable functions on an interval . If by uniform convergence on and at one fixed , then converge locally uniformly to a continuously differentiable function with . If is bounded, the convergence is uniform on all of .[ref]
6.2 Interchange of limits. Basic Analysis: Introduction to Real Analysis, Volume I by Jiří Lebl, §6.2.3, Theorem 6.2.10 and the unbounded-interval observation following its proof
The anchor fixes the additive constant that a derivative cannot see. By the fundamental theorem of calculus, defineThe uniform limit theorem makes a continuous function, so the fundamental theorem of calculus gives . The displayed estimate proves uniform convergence wherever has a common finite bound, and therefore proves locally uniform convergence on any interval.
For example, on take . Its derivative is , with supremum error from , and . The reconstructed uniform limit is ; the exact supremum error is , equal to the bound above. Without an anchor, the constant functions have zero derivatives but no finite pointwise limit. On the real line, has convergent anchored values and uniformly convergent derivatives, but its supremum error from zero is infinite. The bounded-distance condition has a real role.
If , and the reference correlator has a finite nonzero fixed-point limit, the characteristic solution of the multiplicative Callan-Symanzik equation gives . A simple attractive fixed point and smooth anomalous dimension give a finite prefactor multiplying . A nonsimple fixed point can retain slower corrections.
For inviscid unforced two-layer QG dynamics, makes the coupling symmetric in the layer-depth inner product. Multiplication by gives the positive energy . It is conserved after integration when the lateral energy flux vanishes. The interface term is available potential energy; the gradient terms are kinetic energy.
There are incomparable Turing degrees strictly between the computable degree and the degree of the diagonal halting set. An oracle-assisted finite-extension construction alternately defeats each Turing functional in the two directions. Since the sets are computable in the halting oracle, their degrees are at most ; incomparability makes them nonzero and strictly below . This theorem does not require the constructed sets to be computably enumerable. The Friedberg–Muchnik theorem supplies that stronger conclusion.
A clique-free graph near the Turan theorem edge bound is close to a complete multipartite graph. Choose a maximum-degree vertex, split its neighbourhood from the remaining vertices, and apply induction inside the neighbourhood. The degree bound implies that missing cross edges are at least twice the number of edges inside the remaining class. This inequality controls all three types of edits and gives the constant three.
For the sextic Landau free energy , , with linear in reduced temperature, the equation of state is . Its ordered zero-field minimum satisfies , the inverse magnetic susceptibility is below the transition and above, and the critical isotherm satisfies . The minimized singular free-energy density is below and zero above. These facts give the displayed mean-field critical exponents, obeying both the Rushbrooke scaling relation and Widom scaling relation. Both the quadratic and quartic coefficients must be tuned; a generic path with a positive quartic coefficient instead has ordinary critical behavior. Fluctuations change the result below the tricritical upper critical dimension three, and marginal corrections can add logarithms at three.
Approximating perturbation temperatures by harmonic fields decaying as , while retaining displacement through the base gradient, produces this reduced dispersion relation. The Gibbs--Thomson relation supplies . This short-wave reduction suppresses perturbation advection and time dependence; its constant term and a threshold at are not controlled next-order results of the full diffusion problem.
Retaining perturbation thermal diffusion givesThe displaced interfacial temperature and Stefan condition give the displayed implicit dispersion relation. In the capillarity-free limit its growing branch is exactly , which checks the limits of the small-wavelength thermal approximation for a solidification front.
For a paired non-self-conjugate momentum, rotate the Ising-chain Nambu spinor by an angle with , and . Opposite angles at preserve the canonical anticommutation relations. The result is . Self-paired momenta have no pairing and are handled directly as number levels. Periodic spin-chain sectors additionally constrain fermion parity and allowed mode quantization.
For positive ferromagnetic exchange and nonnegative transverse field, the Ising-chain quasiparticle dispersion closes its gap at , with . This is the quantum phase transition between the model's ordered and field-polarized regimes. The exact dispersion identifies the gapless scale; computing its order parameter additionally requires ground-state correlations.
With translation of a distribution defined by , differentiation of the test function gives in weak convergence of distributions. The Taylor theorem shows convergence in the space of test functions, including a common compact support. Thus ; fixing the translation convention prevents a sign error.
Adjoin a new point fixed by a transitive group . A one-point extension is a transitive group on the enlarged set whose stabilizer of is exactly , acting on the remaining points in the prescribed way. Its order is in the finite degree- case. The double-coset criterion for a one-point extension gives a concrete generator test.
An action is sharply -transitive if each ordered -tuple of distinct points is carried to any other by exactly one group element. For finite degree , its order is and each ordered-tuple stabilizer is trivial. Sharp one-transitivity is a regular action. Finite sharp two-transitivity gives a regular kernel of a finite sharply two-transitive group.
A regular permutation subgroup acts transitively with trivial point stabilizers. Each ordered pair of points is related by exactly one subgroup element. A finite regular subgroup on points has order . Normality and characteristicity are additional properties; they do not follow from regularity alone.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





