A matrix factorization incorporating a permutation matrix, a unit lower triangular matrix and an upper triangular matrix. The convention differs from by replacing with its inverse. When pivoting during elimination, previously stored lower-triangular multipliers must be permuted consistently with the rows.
A subset of is relatively norm compact exactly when it is bounded, its absolute-integral tails tend to zero uniformly, and as . Necessity follows by taking a finite norm net and using the tail decay and translation continuity in Lp of its finitely many centers; the error contributes at most twice the net radius. For sufficiency, convolve with a triangular unit-integral kernel of width . Translation continuity gives uniform approximation in , while boundedness gives a common supremum bound and a common Lipschitz constant for the smoothed family. The original tail condition controls its tails outside a slightly enlarged interval. On that interval Arzelà-Ascoli theorem gives a finite uniform net. Extend its centers by zero outside the interval to obtain a finite net, and combine the smoothing and tail errors. Completeness of turns total boundedness into relative compactness.
A lower triangular matrix with every diagonal entry equal to one. Its determinant is one, and its inverse is again unit lower triangular. Such matrices store the elimination multipliers in an LU decomposition.
A countable model of set theory can internally assert that an uncountable set exists. There is no contradiction because “there is a bijection” ranges only over functions in the model. An external enumeration of its domain need not itself be an element of that domain. Löwenheim-Skolem theorem controls external cardinality; Cantor's theorem remains valid for the sets and functions that the model contains.
For each fixed integer , every sufficiently high-degree finite regular graph has an assignment of colors such that every vertex has a neighbour whose color is its successor modulo . This assignment need not be a proper vertex coloring. If the degree is , independent uniform vertex colors make a given vertex fail with probability . That event depends on its closed neighbourhood, and has at most dependencies, since only centres within distance two matter. The symmetric Lovász local lemma therefore gives such an assignment whenever , which holds for all sufficiently large .
Choose one successor neighbour from each vertex. The resulting directed graph has outdegree one and hence contains a directed cycle. Its color increases once modulo on each step, so its length is divisible by . Thus a nontrivial cycle of length a multiple of is obtained when ; for a directed two-cycle may simply traverse one undirected edge twice, so this last cycle inference needs a separate argument if an undirected simple cycle is required.
For a transverse monochromatic electromagnetic wave with angular frequency , . The displayed electric potential and magnetic vector potential therefore give . Transversality gives , so the Lorenz gauge holds. For and , taking a curl yields . The vacuum Maxwell equations require . The field has circular polarization, with and perpendicular electric and magnetic directions.
For integers and , an integer division algorithm determines the binary numeral system digits of a quotient by testing and conditionally subtracting successively halved multiples of the divisor. The loop invariant , together with , makes each step a halving of the remaining quotient interval. Start with and large enough that . To decrease by one, subtract from and add to exactly when . Both branches preserve the displayed equality and establish . When , the quotient and remainder conditions hold.
Lengths of formulas logically equivalent to a fixed propositional formula form a nonempty subset of the natural numbers, so a minimum exists. With variables counted as atomic symbols and no truth constants, and are distinct shortest tautologies. A formula with no binary connective is a variable preceded by negations and cannot be a tautology. Thus minimization need not give a canonical representative.
When an equality-like symbol is treated as an ordinary binary predicate, no first-order theory consisting of assertions valid for actual identity can force it to be identity. Given a genuine-equality structure on , replace the domain by and pull all relations back along the projection . Lift functions so that commutes with them. Induction on first-order formulas preserves satisfaction because is surjective. Yet the two copies of each point satisfy the equality-like predicate. Thus actual identity must be part of the semantics, or the resulting equivalence classes must be quotiented out.
Equal variables can replace selected free occurrences in a first-order formula if the inserted variable is not captured. Starting with atomic equality replacement, derive symmetry, then prove both replacement directions together by structural induction. Negation uses the reverse induction implication; implication uses both directions; a universal quantifier is handled by instantiation, replacement and generalization with a variable fresh for the equality assumptions. Bound occurrences are not replaced as free ones.
The number of load inputs driven by one output of a logic gate. A large fan-out increases the capacitive load and can increase propagation delay; the allowable number also depends on the logic technology and input characteristics.
A two-input logic gate whose output is one exactly when its two input bits agree. Its Boolean function is , equivalently . This follows by considering the two cases in which inputs are equal. It implements logical equivalence of the input truth values.
A deterministic Turing machine with read-only input, work space, and successive write-only output whose contents it cannot inspect. A transducer for a total function halts on every input. It has a polynomial number of internal Turing machine configurations, so a halting run emits only a polynomial number of symbols. The unreadable output position does not affect subsequent transitions.
For canonical positive binary numeral system inputs, a logspace transducer can emit the canonical representation of their sum most significant digit first. Count the operand lengths, compute the final arithmetic carry to determine output length, and then compute each requested result digit by restarting the least-significant-first column recurrence. Each pass uses only a fixed number of -bit indices and one arithmetic carry. The binary-addition carry invariant proves correctness. Logspace composition by recomputation consequently permits any L property of the resulting digit string, including being a binary palindrome, to be tested without storing the sum.
For the strictly convex polynomial , applying Newton root-finding iteration to givesThe unique minimum is at zero. For any sufficiently small nonzero initial point, the errors satisfy , so the order is cubic, not merely quadratic. This provides a simple counterexample to treating the usual quadratic convergence theorem as an upper bound on possible orders. In general, the quadratic coefficient for Newton optimization near a nondegenerate stationary point is ; when it vanishes, a higher order is possible.
The helicoid and catenoid have the same first fundamental form . Therefore matching equal parameter pairs gives a local isometry. The result is local: a full turn changes the height on the helicoid while the angular coordinate on the catenoid repeats. Equal intrinsic lengths do not require the same embedding into Euclidean space.
Author credited with the frost-forecasting notes reproduced in Dew and Frost Development by Jeff Haby.
A linear storage law gives with zero upstream water flux. Integration along characteristic curves yields the displayed boundary-generated solution. For , and . A fixed-flux contour therefore obeysIts extrema have phase when the first-order amplitude is nonzero. The phase lag arises from water storage and downstream propagation, even if the ice thickness is approximately frozen during one fast seasonal cycle.
The instant used to identify an operation's abstract effect in a proof of linearizability. Loading the published pointer can be the linearization point of an immutable snapshot read, with suitable ordering and lifetime guarantees.
In independent trials with category probabilities , let count the distinct categories observed. Write it as the sum of indicator random variables for the categories' appearances. Category is absent with probability , so linearity of expectation gives the displayed formula. The appearance indicators need not be independent. For equally likely categories the expression becomes ; uneven probabilities can substantially delay observation of rare categories.
There are unlisted articles, also show them or only show them.