In matrix theory: see [[transposed matrix]].
For binary relations: see [[transposed relation]].
157 bytes (20 words) - 21:30, 2 January 2016
An idempotent operation on a partially ordered set, see [[Closure relation]].
...space, or Čech closure operator operator defining a pre-topological space, see [[Closure space]].
346 bytes (47 words) - 15:54, 19 January 2021
...ial equations, a property of completeness for a certain set of solutions. See
In measure theory, see [[Luzin-C-property]].
293 bytes (38 words) - 16:42, 20 January 2021
...ebra of measures on a topological group with the operation of convolution; see [[measure algebra (harmonic analysis)]];
...either abstract or consisting of equivalence classes of measurable sets; see [[measure algebra (measure theory)]].
306 bytes (40 words) - 13:45, 17 March 2012
...eory), hence also to many other propositions of set-theoretical character (see [[Axiom of choice|Axiom of choice]]).
This result is also commonly known as the well-ordering theorem or Zermelo's well-ordering theo
695 bytes (105 words) - 20:26, 19 December 2020
* Tightness of a measure, see [[Tight measure]];
* Tightness of an immersion, see [[Tight and taut immersions]].
176 bytes (25 words) - 10:21, 1 January 2018
* a topological space homeomorphic to the unit interval; see [[arc (topology)]];
* a set of points in a finite projective space in general position; see [[arc (projective geometry)]].
211 bytes (31 words) - 08:18, 25 April 2012
* A covering theorem often used in measure theory (see [[Covering theorems (measure theory)]])
* A theorem characterizing the differentiation of Radon measures (see [[Differentiation of measures]])
446 bytes (56 words) - 23:37, 27 June 2014
See [[Fourier series|Fourier series]]; [[Fourier series in orthogonal polynomia
[[Fourier–Bessel series|Fourier–Bessel series]] (see also [[Bessel functions|Bessel functions]]);
2 KB (284 words) - 20:20, 1 January 2019
...t and numerous applications in mathematics, mechanics and engineering. See also [[Stability theory|Stability theory]].
936 bytes (124 words) - 17:08, 7 February 2011
...r appropriate generalizations of it, see [[Cauchy filter]]) converge. (See also [[Complete metric space]], [[Complete uniform space]], [[Complete space|Com
373 bytes (48 words) - 22:07, 12 December 2015
...bjective function|objective function]] and the constraints are linear (see also [[Linear programming|Linear programming]]) but for which some of the variab
299 bytes (39 words) - 16:56, 7 February 2011
For the concept of order-preserving maps on the real numbers, see [[Monotone function]].
For the concept in [[non-linear functional analysis]], see [[Monotone operator]].
317 bytes (40 words) - 18:22, 15 November 2014
...ntly proved (in 1995) that there are no non-trivial solutions if $n\geq3$ (see, e.g., [[#References|[a1]]]).
See [[Fermat great theorem|Fermat great theorem]] for an account of affairs bef
1 KB (191 words) - 19:38, 11 December 2014
* The Jordan decomposition of a measure, in classical measure theory, see [[Jordan decomposition (of a measure)]]
* The Jordan decomposition of a signed measure, in classical measure theory, see [[Jordan decomposition (of a signed measure)]]
559 bytes (78 words) - 10:37, 17 September 2012
...by the Canadian School of graph-theorists (see [[#References|[a3]]]). See also [[Graph|Graph]].
866 bytes (122 words) - 20:09, 15 March 2023
...example, by an optimality principle), then the game becomes non-strategic (see [[Cooperative game]]).
1 KB (161 words) - 16:52, 18 October 2014
For references see [[Stochastic process|Stochastic process]]. See also [[Time series|Time series]].
305 bytes (44 words) - 07:32, 23 August 2014
See:
See also: [[Mediant]] of fractions
399 bytes (59 words) - 19:54, 16 January 2016
...[[Passive constraint|Passive constraint]]. For a selection of references, see [[Mathematical programming|Mathematical programming]].
421 bytes (64 words) - 17:27, 14 October 2014