The punctured torus retracts onto two circles, so its flat $SU(2)$ gauge-orbit space is $SU(2{)}^2/SU(2)$ under simultaneous conjugation. Write unit quaternions as $A=a+u$ and $B=b+v$. Complete orbit invariants are $(a,b,u\cdot v)$ with $(u\cdot v{)}^2\le (1-a^2)(1-b^2)$. Adding $ab$ to the third coordinate identifies this space with the compact convex set of positive-semidefinite $3\times 3$ real correlation matrices, a closed three-ball. The dense open subset $A\ne \pm 1$ is a closed disk times an open interval; its complement is two disjoint intervals.

// Destination: geometry-and-topology.bigb

The nonzero even theta constants and the Jacobi abstruse identity give $\lambda (-1/\tau )=1-\lambda (\tau )$ and $\lambda (\tau +1)=\lambda (\tau )/(\lambda (\tau )-1)$. It is invariant under the principal congruence subgroup of level two. This parameter puts the associated complex elliptic curve in Legendre form $y^2=x(x-1)(x-\lambda )$; its Klein j-invariant is $256(1-\lambda +{\lambda }^2{)}^3/[{\lambda }^2(1-\lambda {)}^2]$.

The congruence class of $a$ modulo a positive integer $N$ is $\{a+Nk:k\in \mathbb{Z}\}$. Two integers have the same class exactly when their difference is divisible by $N$. Addition and multiplication of representatives descend to well-defined operations on $\mathbb{Z}/N\mathbb{Z}$, because replacing a representative by a multiple-of-$N$ translate changes the result by a multiple of $N$.

For an integer $n>1$, Wilson's theorem characterizes prime numbers by a factorial:The right side is an integer congruence, so the least nonnegative remainder is $n-1$. For example, $4!=24\equiv 4(\mathrm{mod}5)$ certifies that five is a prime number, whereas $5!=120\equiv 0(\mathrm{mod}6)$ rules out six. ^[ref]

For an odd prime number $p$, each nonzero congruence class has a unique modular multiplicative inverse. Pair each class with its inverse: each distinct pair contributes one. A class is its own inverse exactly when $a^2\equiv 1(\mathrm{mod}p)$; since $p\mid (a-1)(a+1)$, Euclid's lemma leaves only $a\equiv \pm 1$. Their product is $-1$. The prime number two needs a separate check: $1!\equiv -1(\mathrm{mod}2)$. Conversely, a proper divisor $1<d<n$ divides both $n$ and $(n-1)!$, so the displayed integer congruence would force $d\mid 1$, a contradiction. ^[ref]

The composite numbers have an even sharper pattern: $(n-1)!\equiv 0(\mathrm{mod}n)$ for every composite number $n>4$, but $3!=6\equiv 2(\mathrm{mod}4)$. To check the zero claim, write $n=ab$ with $1<a\le b<n$. If $a<b$, both occur as different factors in the factorial. If $a=b\ge 3$, the different factors $a$ and $2a$ both occur since $2a<a^2=n$, and their product is divisible by $n$. The only excluded case is $a=b=2$. Thus four is an exception to the zero pattern, but still fails Wilson's theorem: its required remainder would be three.

This is an exact primality testing criterion, but direct evaluation is expensive: even reducing modulo $n$ after every multiplication still takes a number of multiplications proportional to $n$, which grows exponentially with the number of binary digits of $n$. The problem is not merely storing a huge factorial. The more useful role of Wilson's theorem is simplifying factorial expressions in modular arithmetic. For instance, if $p>2$ is a prime number, then $(p-1)(p-2)!\equiv -1(\mathrm{mod}p)$ gives $(p-2)!\equiv 1(\mathrm{mod}p)$ by a modular multiplicative inverse.

For a positive modulus $m$, integers $a,b$ are congruent when their difference is divisible by $m$. This is an equivalence relation: zero is divisible by $m$, changing sign preserves divisibility, and adding two divisible differences proves transitivity. Addition and multiplication respect it, because $(a+c)-(b+d)=(a-b)+(c-d)$ and $ac-bd=c(a-b)+b(c-d)$. Its equivalence classes are the residue classes used in modular arithmetic.

The least nonnegative residue of an integer $a$ modulo a positive integer modulus $m$ is the unique representative $r$ of its congruence class in $\{0,\dots ,m-1\}$. Euclidean division gives $a=qm+r$. For example, $-3=(-1)\cdot 5+2$, so $-3\mathrm{mod}5=2$; the integer congruence $-3\equiv 2(\mathrm{mod}5)$ does not assert equality of those two integers.

The positive integer $m$ in $a\equiv b(\mathrm{mod}m)$ is the modulus. It specifies which differences are ignored: exactly the integer multiples of $m$. It is distinct from the modulus of a complex number, which measures magnitude.

The diagram of $M$ is the set of atomic and negated atomic sentences true in the expansion by constants naming every element of $M$. Its elementary diagram contains every sentence true in that expansion. Models of these diagrams correspond respectively to embeddings and elementary embeddings of $M$.

Finite model theory studies first-order structures restricted to finite domains, and asks which properties can be expressed in specified formal languages. The restriction changes the available tools: ordinary first-order compactness does not hold when only finite models are admitted.

For example, the sentences saying there are at least $n$ distinct elements, one for every positive integer $n$, have a finite model for each finite subset but no common finite model. This is a direct failure of finite compactness. Logical games, locality, and bounded-variable fragments then compare the expressive power of formulas on finite databases and graphs, linking definability with computational complexity theory.

Item nonresponse leaves a particular measurement unobserved while retaining other measurements on that individual. Unit nonresponse leaves all survey measurements unavailable. Adjusting for an observed auxiliary variable can address item nonresponse under missing at random, but does not identify the auxiliary-variable distribution among unit nonresponders. Extrapolation to them needs further assumptions or external information.

The right Rindler wedge is the open region $X>|T|$ of Minkowski spacetime. Coordinates $T=\rho \sinh \tau$, $X=\rho \cosh \tau$, $\rho >0$, give metric $-{\rho }^{2}d{\tau }^2+d{\rho }^2+d{Y}^2+d{Z}^2$. The wedge extends into Minkowski spacetime and is geodesically incomplete, while its constant-$\tau$ slices are Cauchy surfaces for the wedge itself.

Allow the four affine Minkowski coordinates to take independent complex values, obtaining $M_{\mathbb{C}}\simeq {\mathbb{C}}^4$ with the holomorphic extension of the flat conformal metric. In two-spinor coordinates $x^{A{A}^{\prime }}$, the metric is proportional to ${ϵ}_{AB}{ϵ}_{A^{\prime }{B}^{\prime }}d{x}^{A{A}^{\prime }}d{x}^{B{B}^{\prime }}$. The twistor incidence relation associates a complex projective line to each affine point; compactification adds the points at conformal infinity.

For positive lapse $N$, this time reparametrization gives a local Minkowski metric. If the new time coordinate ranges over the entire real line, it is a global isometry to Minkowski space. In particular $N=\cosh t$ gives $T=\sinh t$ and complete nonperiodic timelike geodesics. A lapse depending on the spatial coordinate instead can describe a different curved geometry; exchanging the arguments is not a harmless relabeling of the same metric.

With hypercharge normalized by $Q_{\mathrm{em}}=T_3+Y$, the renormalizable R-parity-conserving MSSM superpotential is $W=(y_u{)}_{ij}{U}_i^c(Q_j\cdot H_u)+(y_d{)}_{ij}{D}_i^c(Q_j\cdot H_d)+(y_e{)}_{ij}{E}_i^c(L_j\cdot H_d)+\mu H_u\cdot H_d$, with $A\cdot B={ϵ}_{ab}{A}^a{B}^b$. Additional renormalizable R-parity violation allows $\frac{1}{2}{\lambda }_{ijk}(L_i\cdot L_j)E_k^c+{\lambda }_{ijk}^{\prime }(L_i\cdot Q_j)D_k^c+\frac{1}{2}{\lambda }_{ijk}^{\prime \prime }{ϵ}_{abc}{U}_i^{c,a}{D}_j^{c,b}{D}_k^{c,c}+{\kappa }_i{L}_i\cdot H_u$. The two antisymmetries are ${\lambda }_{ijk}=-{\lambda }_{jik}$ and ${\lambda }_{ijk}^{\prime \prime }=-{\lambda }_{ikj}^{\prime \prime }$. The first, second and fourth additional terms violate lepton number; the third violates baryon number.

A microkernel using security capabilities to control access to operating-system kernel objects, including IPC endpoints and software threads. An IPC endpoint connects cooperating user-space services; its security capabilities are distinct from the service-defined handle 9 in the microkernel file-read example. ^[ref]

For the microkernel file-read example, distinguish system call entry/exit, security capability lookup, payload transfer, process scheduling and context switches from the service's actual file lookup and read work. Entering a privileged processor privilege level and switching to a different address space are different events. A change of address space can affect the translation lookaside buffer; running different code and touching different computer memory can cause cache misses. Neither event implies that every translation lookaside buffer entry or cache line must be discarded.

A larger copied payload requires more transfer work; sharing memory pages can avoid copying that bulk data but introduces mapping and synchronization work. A service that requests another service adds another IPC exchange. If the cached file data were absent, communication with a device driver and the input-output wait would also matter. Blocking behind other requests affects observed response time even when the individual IPC operations are cheap.

These are cost sources, not timings or a universal ranking against a monolithic kernel. Implementation and CPU details matter: the construction analysis separates protected entry costs, address space switching, translation lookaside buffer effects and memory cache effects. ^[ref]

Suppose the user-space service stops after receiving request 7, before replying. Assume that its private memory pages are not writable mappings of the client's or an unrelated service's computer memory, and that it lacks security capabilities to change their software threads. A failed store in the service cannot directly overwrite that private state through ordinary CPU address translation. Those assumptions establish a particular isolation boundary, not a successful read.

The client can remain blocked waiting for request 7. An unrelated runnable service may continue if process scheduling and resources permit, but clients that depend on the stopped service still lose access to its service. A separately authorized recovery manager would need to detect the failure, rebuild the service's state and arrange communication with its replacement. The microkernel architecture by itself supplies none of those application-specific recovery decisions.

A missing reply also does not reveal whether a service crashed, is delayed by process scheduling, or entered an infinite computation. For a read, retrying after recovery may be straightforward; for a modifying operation, absence of a reply does not prove that the modification never happened. Recovery must account for ambiguous completed operations and any required file-system crash consistency.

The boundary changes with authority. A deliberately shared writable memory page allows the service to change its shared contents; a security capability controlling another software thread permits the corresponding control operations. A device driver with uncontrolled DMA can bypass ordinary CPU memory protection. Thus service placement and actual permissions must be considered together. ^[ref]

Consider an original toy file system service in address space B and a client in address space A, on one CPU. The service holds a five-byte cached file containing LIME followed by a newline. The client already has service handle 9, permission to read that file, and a security capability to send requests to IPC endpoint E. Handle 9 is interpreted by the service; it is neither a virtual address nor an operating-system kernel object identifier. All relevant memory pages are resident, and this read needs no device driver.

This protocol is an illustrative design, not an actual seL4 file system interface. Its call/reply structure follows seL4's documented IPC: seL4_Call waits using reply authority, and small payloads can travel in processor registers. ^[ref]

An ordinary pointer in A refers to A's address space. Sending its numeric value does not make B's private computer memory appear there. This example explicitly transfers bytes. Sharing a mapped memory page instead would require intentional memory protection permissions and a protocol for ownership and synchronization; passing a pointer alone establishes neither.

The same IPC mechanism could carry WRITE, but this client could still be refused by the service's read-only handle policy. Conversely, possession of an IPC endpoint security capability permits communication without automatically granting access to every file the service manages. The separation of mechanism and policy appears twice: endpoint authority gates delivery, and the service's handle policy gates the requested operation.

Differentiating $g^{ac}{g}_{cb}={\delta }_b^a$ and multiplying by the inverse gives the displayed variation. It is the matrix inverse derivative, expressed with the covariant and contravariant components of a metric tensor.

For a nondegenerate metric tensor whose signature is fixed during the variation, the Jacobi formula gives $\delta \det g=(\det g)g^{ab}\delta g_{ab}$. Differentiating the square root of the absolute determinant proves the displayed identity. Expressed through the variation of inverse metric, the formula is $-\sqrt{|\det g|}{g}_{ab}\delta g^{ab}/2$. Absolute values accommodate either Riemannian or Lorentzian signature.