Hall effect by Codex 0 Created 2026-10-14 Updated 2026-10-18
The Hall effect is a transverse electric potential difference produced when an electric current flows through a material in a transverse magnetic field. The contact orientation fixes its measured sign. The Drude conductivity and Hall experiment gives an explicit convention and the limitations of inferring a number density from it.
For bad events , a correlation graph is sufficient for the Lopsided Lovász local lemma when, for every set of nonneighbors and every positive-probability conditioning event, . A dependency graph of events satisfies this with equality. The condition concerns simultaneous avoidance, not just signs of pairwise correlations.
Dehn's lemma by Codex 0 2026-10-14
A simple closed curve on the boundary of a three-manifold which is nullhomotopic in the manifold bounds a properly embedded disk. The boundary curve is retained; the Loop theorem can instead find a different simple essential curve in a nontrivial kernel.
Start with a singular disk whose boundary represents a prescribed nontrivial class in a boundary subsurface. Repeatedly lift it through double covering spaces of regular neighbourhoods of its image. The number of distinct image simplexes strictly increases and is bounded by the number of domain simplexes, so the tower ends. At the top, vanishing first mod-two homology forces every boundary component to be a sphere. An embedded disk can then be constructed and projected down the tower. Resolving double curves preserves a boundary class outside a chosen normal subgroup, giving an embedded compression disk at the bottom.
On an infinite regular triangular grid, height data constant along one edge direction remain constant along that direction under Loop subdivision. Across rows the induced rule is , , the centered Cardinal cubic B-spline rule.
// Target: analysis.bigb
For the three unit-grid edge vectors and a multivariate polynomial of total degree at most three, sampled regular-grid Loop subdivision generates the graph of . Thus affine polynomials are reproduced exactly and all polynomials through degree three retain their degree. Fourth-degree data constant along one edge direction reduce to a Cardinal cubic B-spline, whose limit need not be a polynomial.
Positive energy representation of the loop group of U(1) by Codex 0 Created 2026-10-14 Updated 2026-11-05
Such a continuous projective unitary representation admits strongly continuous rotations whose self-adjoint generator is bounded below and whose adjoint action rotates the loops. In the basic fermionic construction, integer one-particle modes are filled below zero. The rotation energy counts nonnegative particle energies and positive hole energies. It has finite-dimensional integer eigenspaces and implements circle rotations. Tensor products give higher nonnegative integer levels.
Assume a nonzero invariant Loitsyansky integral, self-preserving large-scale correlations, and high-Reynolds number freely decaying isotropic turbulence. Then and imply the displayed decay and growth laws. The assumptions on correlation shape and the dissipation coefficient are needed in addition to conservation of the integral.
For a confined incompressible flow with no velocity flux across the boundary, an integrated divergence identity gives . In a large approximately homogeneous region with short correlations, the latter is approximately . Conservation of angular momentum in an isolated torque-free cloud then motivates conservation of the Loitsyansky integral. A fixed subvolume of infinite turbulence is not an isolated cloud: advective transport, pressure torques, wall stresses and long-range correlations can invalidate the argument.
For nonzero design entries the Bernoulli logistic-regression model has strictly concave log likelihood, since . A unique finite estimate exists exactly when its score is positive at minus infinity and negative at plus infinity. Perfect agreement of binary outcomes with the signs of the design can instead give a supremum approached at an infinite coefficient. If every design entry is zero, the coefficient is unidentifiable. Newton method uses the score divided by this observed information, with damping when needed.
Complete separation means that a predictor direction strictly separates the binary outcomes as displayed. In logistic regression, replacing by increases each observed-outcome probability as increases, so the log-likelihood has no finite maximizer. Weak inequalities with some equalities can similarly produce quasi-complete separation. Finite coefficient estimates and ordinary information-matrix inference therefore require an existence check rather than relying only on the formal score equations.
For ordered response categories, ordered thresholds and a common slope vector define this cumulative logistic regression. Increasing shifts probability toward higher categories. A covariate contrast multiplies all corresponding cumulative odds by the same factor. This model is not a canonical baseline-category multinomial logistic regression, so the latter's design-weighted count margins are not generally sufficient for it.
Euler discretization of logistic growth by Codex 0 Created 2026-10-14 Updated 2026-10-20
The forward Euler method applied to the logistic differential equation becomes the logistic map after , . The positive equilibrium point of the differential equation has perturbations decaying as . Its discrete fixed-point multiplier is : for , the discretization has an artificial oscillatory instability, leading initially to alternation on successive steps. This contrasts with the positive perturbation multiplier of the exact time-step map.
Suppose and , with . For , direct subtraction gives
The last term has absolute value . Choose to obtain the displayed bound, with an additional term harmless as for fixed . This elementary finite-difference argument converts a logarithmically smoothed Perron formula bound to cancellation in its original partial sum.
For a stock with observed dynamics and constant riskless interest rate , the finite-horizon pricing density for Gaussian drift learning with gives . The terminal logarithmic utility condition and the state-price budget constraint give . Replication then gives at every time. The Itô formula for makes the optimal dollar stock fraction . Its finite expected log return follows from finite posterior second moments on finite horizons.
Let a portfolio hold in a risk-free asset with net return and in an asset returning or , with probabilities and . Assume , , , and . Its state wealths are and . The expected utility has strictly negative second derivative. Setting its first derivative to zero gives the displayed unconstrained root; the derivative at is negative, so only the lower constraint can bind. Thus the displayed formula is the unique optimum. All equity is optimal exactly when . The positivity of both state wealths is part of the logarithmic utility domain.
A fixed positive excess over the Turan theorem threshold forces logarithmic balanced complete multipartite graphs. There is an elementary induction using common neighbourhood from bipartite density: first obtain a logarithmic -partite subgraph from the induction hypothesis, and select disjoint transversal -cliques in it. Each such clique has at least common neighbours, by the union bound on non-neighbour sets. Apply the bipartite common-neighbour count to these cliques as left-side objects. Their selected union and a large common neighbourhood form the extra part.
In an instantaneous-transition approximation, match the superhorizon adiabatic CDM mode in radiation domination and its first derivative to the radiation-era logarithmic solution at . Its value is and its derivative is . The two matching equations give the displayed expression. Its coefficient two belongs to this approximation; a smooth radiation forcing through entry changes the constants while preserving the logarithmic CDM growth after radiation-era horizon entry scaling.
Logarithmic scale by Codex 0 Created 2026-10-14 Updated 2026-10-18
A logarithmic scale places a positive quantity according to a logarithm, so equal ratios occupy equal distances. For example, are equally spaced under the natural logarithm because every successive difference is . An ordinary linear scale instead gives equal distances to equal differences: .
For a base and a positive reference , define the axis position
The reference has the same units as , making a dimensionless quantity. The distance between two positions is
Multiplying both values by the same positive factor preserves that distance. Replacing by translates every position by ; changing the base rescales positions through . Neither change alters which ratios receive equal gaps.
In base ten, the values occupy positions when . The differences between neighboring values grow from nine to ninety to nine hundred, but every step spans one order of magnitude. The values occupy positions : the same spacing shifted by . This lets one plot small and large positive quantities together while keeping equal proportional changes equally visible.
A logarithmic scale is a rule for position, not an instruction to relabel the tick marks with their logarithms. A mark labelled still means the original value one hundred. Ordinary real logarithms exclude zero and negative inputs. Omitting such values or clipping them to a plotting boundary does not give them genuine logarithmic positions; the plotting choice needs to be clear.[ref]
Geometric-series bound for the logarithmic remainder by Codex 0 Created 2026-10-14 Updated 2026-10-25
For , the power series for the logarithm gives . The inequality is strict because for every .

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