Trichophyton schoenleinii is a fungus associated with infection of keratinized host structures, classically the scalp disease favus. It illustrates how fungal identification and the affected anatomical site jointly inform interpretation of an infection.

A genus of dermatophytes; it should not be inferred from the nineteenth-century name Microsporon furfur used for pityriasis versicolor.

A fungus adapted to infect keratinised tissues. Malassezia associated with pityriasis versicolor is not thereby a dermatophyte.

Candida is a name applied to a group of yeasts including Candida albicans. Its medically important members can occur on host surfaces as well as cause candidiasis. Historical genus membership does not by itself establish identical physiology or pathogenicity among all species.

A dermatophyte fungal infection affecting keratin-containing tissue; the name does not imply a worm.

An infection caused by members of Candida.

If a nonconstant complex polynomial were zero-free, its reciprocal would be an entire bounded function. The real part of its value along planar Brownian motion is a bounded martingale, hence converges almost surely. If that real part were nonconstant, continuity would give two disks with separated value ranges, and recurrence of planar Brownian motion would force alternate visits to both at arbitrarily large times, contradicting convergence. It is therefore constant; the Cauchy-Riemann equations then make the reciprocal constant, a contradiction.

The Nemytskii operator associated with a scalar function $f$ applies $f$ pointwise to a function. The domain and target function spaces must be specified; an arbitrary continuous $f$ need not preserve them. On a finite-measure domain, a bounded continuous $f:\mathbb{R}\to \mathbb{R}$ defines a continuous map $N_f:L^2\to L^2$ with $\Vert N_f(u){\Vert }_2\le \Vert f{\Vert }_{\infty }|\Omega {|}^{1/2}$. To prove continuity, extract an almost-everywhere convergent further subsequence from every $L^2$-convergent subsequence and apply the dominated convergence theorem to $|f(u_j)-f(u){|}^2$. This forces convergence of the entire image sequence in $L^2$.

A data type describing a callable procedure's parameter types and any return type. A traversal callback taking an integer and producing no data result can be passed using an Oberon declaration such as Visit = PROCEDURE(x: INTEGER).

For $a>0$, use the Fourier transform convention $\hat{f}(s)={\int }_{\mathbb{R}}f(x)e^{-isx}dx$. Splitting the integral at zero gives $1/(a+is)+1/(a-is)=2a/(a^2+s^2)$. By the Fourier inversion theorem, the dual identity isThis pair connects an exponential function with the kernel of a Cauchy distribution and produces the Poisson kernel for the upper half-plane by inversion of $e^{-y|s|}$.

For integrable functions on the real line, equality of their Fourier transforms implies equality almost everywhere. To prove it, subtract and assume $\hat{h}=0$. Convolve $h$ with a Gaussian heat kernel $q_t$. The convolution theorem gives $\widehat{h\ast q_t}=0$, which is integrable, so the Fourier inversion theorem gives $h\ast q_t=0$ almost everywhere. Finally $q_t$ is an approximate identity: $\Vert h\ast q_t-h{\Vert }_1\le \int q_t(y)\Vert h(\cdot -y)-h{\Vert }_{1}dy\to 0$. This follows from translation continuity in Lp with exponent one and the vanishing Gaussian tails. Hence $h=0$ in $L^1$. If the two original functions are continuous, equality almost everywhere strengthens to equality everywhere, since a nonzero continuous difference has magnitude bounded below by a positive constant on some interval.

A half-line Fourier transform separates the contributions supported on the positive and negative real axes. With the displayed sign convention, a bound $y(x)=O(e^{-{\gamma }_{+}x})$ as $x\to +\infty$ gives a holomorphic $Y_{+}$ in $\mathrm{Im}k>-{\gamma }_{+}$; a bound $y(x)=O(e^{-{\gamma }_{-}|x|})$ as $x\to -\infty$ gives a holomorphic $Y_{-}$ in $\mathrm{Im}k<{\gamma }_{-}$. The estimates hold uniformly on compact subsets of these half-planes and remain integrable after multiplication by any fixed power of $x$, which justifies complex differentiation under the integral. The overlap strip is the natural domain for a Wiener-Hopf equation. Holomorphic continuation of a transform beyond its convergence region is a separate question from convergence of the defining integral.

A Hadamard-lacunary Fourier series has nonzero frequencies supported on a positive sequence with the displayed gap ratio, possibly together with its negatives and finitely many extra modes. Such gaps strongly restrict additive frequency relations. They make moment estimates resemble those of independent random variables. For a ratio greater than three, the strongly lacunary polynomial L1-L2 bound follows directly by enumerating fourth-moment pairings.

For an integrable periodic function with one-sided limits $L_{+},L_{-}$ at $t$, the displayed condition implies that its classical Fourier partial sums converge to $(L_{+}+L_{-})/2$. To prove it use the Dirichlet kernel $D_n(s)=\sin ((n+1/2)s)/\sin (s/2)$ and its integral $2\pi$. Subtract the target value and combine the positive and negative halves of the convolution integral. The resulting difference isThe coefficient of the sine is integrable near zero by the Dini condition, and away from zero by integrability of $f$. The Riemann-Lebesgue lemma therefore makes this expression tend to zero. Step functions satisfy the condition because the numerator vanishes in a sufficiently small punctured neighborhood. This is a local Fourier convergence test, distinct from Dini's theorem on uniform convergence of monotone sequences of continuous functions.

A Banach space $B\subseteq L^1(\mathbb{T})$ is homogeneous when its inclusion into $L^1$ is continuous, circle translations act isometrically, and each orbit is continuous in the $B$ norm. One commonly normalizes $\Vert f{\Vert }_1\le \Vert f{\Vert }_B$. The continuous functions with the supremum norm, and $L^p(\mathbb{T})$ for $1\le p<\infty$, are examples. Full $L^{\infty }$ fails translation continuity. If $g$ is continuous, the Bochner integral $f\ast g=\int g(t){\tau }_{t}fdt/(2\pi )$ belongs to $B$ and satisfies $\Vert f\ast g{\Vert }_B\le \Vert f{\Vert }_B\Vert g{\Vert }_1$. Approximation by continuous functions extends this to every $g\in L^1$.

Model checking verifies whether a formally represented system satisfies a specified property, often a temporal logic formula over a finite transition system. A safety question asks whether a bad state is reachable; exhaustive state exploration can either find a counterexample path or establish its absence in the model. Symbolic model checking represents sets of states compactly, while bounded methods search executions up to a chosen horizon. Verification is relative to the model and assumptions: a missing physical behaviour is not ruled out merely because it was omitted from the transition relation.^[ref]

A model consisting of a set $S$ of states, a transition relation $\to \subseteq S\times S$, initial states $I\subseteq S$, a set $AP$ of atomic propositions, and a label function $L:S\to 2^{AP}$ identifying which atomic propositions hold at each state. A path in a transition system follows permitted transitions. Some definitions omit labels or initial conditions; specify the convention used in each application.

A fairness assumption selects admissible infinite paths in a transition system, often to exclude executions that postpone an enabled activity forever. The notation $TS{\models }_{\mathrm{fair}}\phi$ quantifies only over initial paths in a transition system satisfying the chosen condition; without that qualification, an unfair execution can invalidate a progress claim.

In linear temporal logic, $GFp$ means that $p$ holds infinitely often, while $FGp$ means that $p$ holds permanently after some finite point. Therefore $FGp$ implies $GFp$: once every position satisfies $p$, every later suffix contains such a position. The converse fails on an alternating path in a transition system where $p$ is true at exactly the even positions. This distinction matters when specifying repeated service versus eventual permanent availability.

A fairness assumption must be justified by the environment or scheduling model; it does not itself supply an implementation that enforces the assumed progress.

A formal language with finitely many words. Every finite language is a regular language: take a finite union of the regular expressions spelling its members, with the empty language represented separately when there are no members.

A finite control equipped with an unbounded stack. A move reads one input symbol or the empty word, examines the top stack symbol, changes control state and replaces that top by a finite word over the stack alphabet. Nondeterministic choices give finitely many possible moves. With acceptance by final state and the entire input consumed, pushdown automata recognize exactly the context-free languages.