- extensionality",
which is none
other than the
restriction to 1-types of the
univalence axiom that
Vladimir Voevodsky proposed ten
years later. (The
axiom for...
- = g x {\displaystyle \forall x,fx=gx} then f = g {\displaystyle f=g}
Univalence:: 2.10 if A ≃ B {\displaystyle A\simeq B} then A = B {\displaystyle A=B}...
-
foundations and
earlier ideas are Voevodsky's 2014
Bernays lectures. The name "
univalence" is due to Voevodsky. A more
detailed discussion of the
history of some...
- Université de
Paris in 1937. His
dissertation consisted of two theses,
Univalence et
automorphie pour les polynômes et les
fonctions entières and Sur les...
-
proved that f is univalent. In
particular a
sufficient condition for
univalence is | S ( f ) | ≤ 2. {\displaystyle |S(f)|\leq 2.} The
Schwarzian derivative...
-
remarkable fact,
fundamental to the
theory of
univalent functions, that
univalence is
essentially preserved under uniform convergence. Let z 0 {\displaystyle...
-
domain of R. proof: R;RT is
symmetric and
reflexive on its domain. With
univalence of R, the
transitive requirement for
equivalence is fulfilled. Transitive...
- That is, that
every term of an
identity type is
equal to reflexivity. "
Univalence Axiom"
holds that
equivalence of
types is
equality of types. The research...
- Nikaido, Hu****ane (10
December 2013). "The
Jacobian matrix and
global univalence of mappings".
Mathematische Annalen. 159 (2): 81–93. doi:10.1007/BF01360282...
- In
complex analysis and
geometric function theory, the
Grunsky matrices, or
Grunsky operators, are
infinite matrices introduced in 1939 by
Helmut Grunsky...
