An orthonormal multiresolution analysis separates coarse scaling functions from progressively finer wavelet details. On a bounded interval, the approximation space at level $J$ has dimension of order $2^J$. Higher resolution reduces projection bias but estimates more noisy coefficients. In an orthonormal Gaussian sequence model with coefficient noise variance ${\sigma }^2/n$, risk is the omitted squared coefficient sum plus ${\sigma }^2{d}_J/n$. Selecting or shrinking individual detail coefficients yields spatially adaptive complexity; a data-selected subset need not have effective degrees of freedom equal to its raw selected count.

A group action on a set of at least three points is three-transitive when it is transitive on ordered triples of distinct points. It implies a two-transitive group action, since a distinct pair can be completed to a distinct triple. The implication is strict: the projective general linear group in projective dimension at least two is two-transitive on projective points, but collinear and noncollinear triples belong to different group orbits.

The groups $U_m$ form a compact-open neighbourhood basis at one inside the units of a non-Archimedean local field. A smooth character trivial on $U_{i+1}$ but nontrivial on $U_i$ cannot have a nonzero fixed vector under $U_m$ for $m\le i$. This elementary conductor comparison controls admissibility and smooth duals of direct sums.

A bouquet graph consists of one vertex and $j$ self-loops. Its vertex has degree $2j$, and its graph excess is $j-1$. The two-loop bouquet is one of the three possible kernels of a bicyclic graph; in a simple subdivision, each loop must expand to a cycle of length at least three.

The endpoint expansion of this multiderivative multistep method has unscaled defect $h^4{y}^{(4)}/3+O(h^5)$ and zero-stability roots $1,1/7$, giving third-order convergence with suitably accurate starting values. On the Dahlquist test equation its amplification roots obey $(7-6z+2z^2){\zeta }^2-8\zeta +1=0$. The complex quadratic Schur criterion puts both roots in the open unit disk for $\mathrm{Re}z<0$, and only the simple root one reaches the boundary at $z=0$. Thus it is A-stable; its higher derivative places it outside the hypotheses of the Second Dahlquist barrier.

For the multiderivative multistep method $y_{n+1}-\alpha h{f}_{n+1}+\beta h^2{g}_{n+1}=\gamma h{f}_n+y_{n-1}+\alpha h{f}_{n-1}+\beta h^2{g}_{n-1}$, with $g=f^{\prime }f$, centered expansion gives defect coefficients $2-2\alpha -\gamma$, $1/3-\alpha +2\beta$, and $1/60-\alpha /12+\beta /3$ at powers $h,h^3,h^5$. Their simultaneous vanishing gives the displayed parameters. The next coefficient is $1/4725$ at $h^7$, so the formal order is six. Reflection symmetry removes every even defect power. The method satisfies fifth-order conditions but cannot have exact order five.

For $y^{\prime }=f(y)$ and $g=f^{\prime }f$, inserting a smooth exact solution into the displayed recurrence gives defect $h^7{y}^{(7)}(t_n)/4725+O(h^9)$. This follows by expanding $2\sinh z-(14/15)z\cosh z-(16/15)z+(2/15)z^2\sinh z$. The terms through $z^6$ vanish and the $z^7$ coefficient is nonzero. Its zero-step polynomial is ${\zeta }^2-1$, whose roots are simple and of unit modulus. Thus it is zero-stable and has order six, provided starting values and derivative evaluations have corresponding accuracy.

A two-class queue has one total buffer but serves the high-priority class before the other. A preemptive-resume service discipline interrupts low-priority work immediately and later resumes it without wasting completed work. Under first come first served within the high-priority class, a new high-priority packet waits $V/C$ when $V$ is the high-priority workload immediately before its arrival. The total workload determines shared-buffer overflow, while $V$ determines the high-priority waiting time. An additional admission gate rejects high-priority packets when $V/C$ exceeds a prescribed delay limit. Finite packets require a fit test against the remaining buffer space, and nonpreemptive service adds residual low-priority service time.

The actual Sv39 page table geometry uses three nine-bit indices and a twelve-bit offset for base 4096-byte memory pages. Each table contains 512 eight-byte page table entries, exactly one 4096-byte memory page; the satp processor register identifies the root. A 64-bit virtual address must repeat bit 38 in bits 63 through 39. Higher-level terminal entries can also map aligned larger memory pages, shortening the page table walk. These rules differ from the 16-bit, four-byte-entry two-level address translation model. ^[ref]

For ordinary Sv39 page tables, valid nonterminal page table entries reference the next table with read, write, and execute flags clear; those clear flags do not prohibit reading the eventual data. The terminal entry supplies access permissions, with additional processor privilege level and status checks. An invalid entry, malformed encoding, or denied access can cause a page fault. Thus the model's set intersection of read/write permissions at both levels must not be applied mechanically to Sv39 page tables. ^[ref]

In xv6 RISC-V source code, root allocation is separate from lower-level allocation: uvmcreate() allocates and clears a root page table, while walk() with allocation enabled allocates and clears missing lower-level tables and installs valid references to them. With allocation disabled, a missing table makes walk() return failure. This software routine finds a page table entry for the operating system; it is not the hardware's complete permission-checking page table walk. ^[ref]

Use the two-level address translation model and map exactly four resident virtual memory pages, numbered 0x12, 0x13, 0xa0, and 0xa1. Assign their data page frames to 0x07, 0x02, 0x05, and 0x06, respectively. Only two root indices occur: 1 and 10. Allocate exactly three table nodes: the root at 0x8000, the lower-level table for root index 1 at 0x9000, and the lower-level table for root index 10 at 0xa000. Root entries 1 and 10 reference those tables; all other root entries are absent. Lower-level entries 2 and 3 in the first table and entries 0 and 1 in the second table hold the four mappings; every other lower-level entry is absent. Use the read-only permissions already specified for virtual memory page 0x12; let the other three mappings permit user reads and writes, with no execution, and let both populated root entries permit user reads and writes.

Each root index covers 16 virtual memory pages, hence $16\cdot 256=4096$ bytes of the address space. A compact table node occupies $16\cdot 4=64$ bytes. The three nodes therefore require $3\cdot 64=192$ bytes of table storage, including the root and all absent entry slots in the allocated nodes. A single-level array requires $256\cdot 4=1024$ bytes for the same address space, saving $1024-192=832$ bytes in the compact model. Four data page frames occupy another $4\cdot 256=1024$ bytes; those contents are separate from table storage.

If instead the allocator dedicates a whole 256-byte page frame to every table node, the three nodes consume 768 bytes, leaving $3(256-64)=576$ bytes unused within those allocations. The single-level table fills four such page frames and still consumes 1024 bytes. Thus this example saves 256 bytes of allocated table storage under that alternative policy. Neither accounting includes allocator metadata, operating-system process records, or translation lookaside buffer storage; data allocations are the same in both designs.

Placement matters as well as mapping count. Four virtual memory pages 0x12, 0x42, 0x72, and 0xa2 require the root plus four lower-level tables: five nodes, 320 compact bytes, or 1280 bytes with a dedicated page frame per node. Only four data page frames are still required. Let $g$ be the number of distinct root indices represented by the mappings. With no retained empty lower-level tables, table storage is $64(1+g)$ compact bytes or $256(1+g)$ allocated bytes under the dedicated-page frame policy. Even an empty address space retains the root in this accounting, so $g=0$ costs 64 or 256 bytes.

For a fully populated address space, $g=16$: 17 nodes cost 1088 compact bytes or 4352 allocated bytes. The single-level table remains 1024 bytes. Sparse allocation is therefore a conditional space benefit; scattered mappings, node allocation granularity, and the root's overhead can reverse it. Additional dependent lookups on a TLB miss also have a cost, but node counts alone establish no universal execution-time ordering.

Choose an original teaching model with 16-bit virtual addresses, 16-bit physical addresses, and 256-byte memory pages and page frames. The eight high bits identify a virtual memory page; divide these into two four-bit indices. The eight low bits are the offset within the memory page. Thus each page table has 16 entries: the root selects a lower-level page table, and that table selects a data page frame. Every page table entry is four bytes, including its reference and flags. These are chosen model parameters, not a hardware entry encoding.

For a virtual address $v$, extract the root index $i$, lower-level index $j$, and offset $d$ by Euclidean division:Here $\lfloor \cdot \rfloor$ is the floor function and $\mathrm{mod}$ denotes the remainder in Euclidean division. Each index ranges from 0 to 15, and $d$ ranges from 0 to 255. In hexadecimal, virtual address 0x1234 splits into $i=1$, $j=2$, and $d=0x34=52$; its binary numeral system representation is 0001 | 0010 | 00110100.

Fix the requested operation to be a one-byte user read. Assume both table nodes and the data page frame are resident, table reads are allowed, and no mapping changes during the page table walk. The model requires presence at both levels and takes the set intersection of the two entries' read, write, execute, and user-access permissions. This is an explicit memory protection rule for this model; Sv39 page tables use different rules. The root's physical address is 0x8000; the relevant entries are:

The first lookup obtains a table reference, not the final data physical address. The second lookup obtains page frame number 7. Both entries permit a user read, so the original offset is added to the data page frame base:The page table walk therefore reads records at 0x8004 and 0x9008, then the requested read accesses data at 0x0734. All three are distinct physical addresses. These are two dependent table lookups followed by one data access, not a claim of three accesses to main computer memory: a memory cache can satisfy table lookups, and cached intermediate translations can skip them.

Under the same memory protection rule, a user write at 0x1234 fails because lower-level entry 2 denies writes, even though root entry 1 allows them. Clearing either entry's presence flag also prevents the access. An absent root entry stops the page table walk before any lower-level lookup. A page fault then requires the operating system to determine whether a permitted mapping needs storage or the access is invalid; absence alone does not establish demand paging eligibility.

With an empty translation lookaside buffer, the permitted read causes a TLB miss and this successful page table walk, with no page fault. If the resulting mapping and permissions are cached for the current address space, a later read at 0x1235 can use a TLB hit to reach 0x0735. A later write can cause a protection page fault on a TLB hit because the cached mapping remains read-only. Assume cached permissions are current; changing them requires the architecture's prescribed invalidation. A TLB miss describes a missing cached translation, while a page fault describes an access that cannot proceed under the translation or protection rules. ^[ref]

The moving-average polynomial records the coefficients of the finite noise filter. Evaluating it at the backshift operator gives $\Theta (B)w_t=w_t+{\sum }_{j=1}^q{b}_j{w}_{t-j}$. In a reduced ARMA representation, invertibility is equivalent to having no roots in the closed unit disc.

A multivariate moving-average model filters vector white noise through fixed matrix coefficients. If the noise has zero mean and lag-zero covariance matrix $D$, with all nonzero-lag cross-covariances zero, then the filtered process is a weakly stationary process. With the convention $\Gamma (h)=\mathbb{E}[Z_t{Z}_{t+h}^T]$, its covariance matrix is $\Gamma (h)={\sum }_j{\Theta }_{j}D{\Theta }_{j+h}^T$, omitting terms outside the filter range. Positive and negative lags satisfy $\Gamma (-h)=\Gamma (h{)}^T$.

At a nondegenerate critical point placed at the origin, integral Taylor theorem gives $f(x)-f(0)=x^{T}A(x)x$, where $A(x)$ is a smooth symmetric matrix and $A(0)=\frac{1}{2}\mathrm{Hess}f(0)$. A constant linear change makes $A(0)$ diagonal with entries $\pm 1$. Successive completion of squares, with the Schur complement at each step, produces a smooth invertible triangular matrix $B(x)$ such that $x^{T}A(x)x={\sum }_i{ϵ}_i(B(x)x{)}_i^2$. The pivots keep their nonzero signs near zero. The map $x\mapsto B(x)x$ has invertible derivative at zero, so the inverse function theorem makes it a coordinate system. The signs are the Hessian matrix signature by Sylvester's law of inertia.

For a closed manifold and a Morse function, the displayed strong inequalities hold for every $j$, with equality at the top dimension. Indeed the Morse chain complex rank formula makes the alternating sum equal to $r_{j+1}\ge 0$. Adding the inequalities at $j$ and $j-1$ gives $c_j\ge b_j$. The weak inequalities, even together with equality of Euler characteristics, are less restrictive: $b=(1,0,0,1)$ and $c=(2,0,0,2)$ satisfy those numerical conditions but violate the strong inequality at $j=1$.

Here $n(p,q)$ is the signed number of unparametrized trajectories of a Morse-Smale gradient flow from $p$ to $q$. Compactifying one-dimensional trajectory moduli spaces gives ${\partial }^2=0$. The generators coincide with the cells furnished by the unstable manifolds, and the trajectory count is their cellular incidence number, so the complex computes integral homology.

A nonconstant morphism of algebraic varieties $f:C\to D$ between smooth projective integral curves is finite, and its degree is the degree of the induced extension of function fields. It is also the degree of the pullback of a rational point, with ramification multiplicities and residue degrees included: locally the finite coordinate algebra is a torsion-free module over the target discrete valuation ring, hence free of its generic rank. For $D={\mathbb{P}}^1$ and a rational function defining $f$, the pullback of infinity is its pole divisor, so the total pole degree equals $\mathrm{deg}f$. A degree-one finite map to a normal curve is an isomorphism, since a finite integral algebra inside its unchanged function field equals the integrally closed target ring.

A $k$-algebra isomorphism between the local rings at closed points extends to a morphism on some neighborhoods: represent the images of finitely many affine coordinate generators by fractions, and shrink where their denominators are nonzero and their finitely many relations hold. Extend its inverse the same way. The two compositions agree with the identity as germs; finitely many coordinate equalities make them identities after shrinking again. Taking inverse images of these neighborhoods then gives mutually inverse actual neighborhood isomorphisms, not just a formal-completion isomorphism.

A dominant morphism of varieties is generically finite when its extension of function fields is finite. Its degree is the degree of this field extension. A dominant morphism between integral varieties of equal dimension is generically finite; over a suitable nonempty open subset of the target its fibers are finite.

A flat proper morphism of algebraic varieties whose geometric fibres are plane conics, usually presented as a quadratic equation in a projective bundle of relative dimension two. The generic fibre is normally required to be smooth; singular conics can occur in special fibres. A conic bundle from a line on a smooth cubic surface has five reducible fibres over the projective line.