请输入您要查询的字词:

 

单词 76OrthogonalFactorization
释义

7.6 Orthogonal factorization


In set theoryMathworldPlanetmath, the surjections and the injections form a unique factorization system: every function factors essentially uniquely as a surjection followed by an injection.We have seen that surjections generalize naturally to n-connected maps, so it is natural to inquire whether these also participate in a factorization system.Here is the corresponding generalizationPlanetmathPlanetmath of injections.

Definition 7.6.1.

A function f:AB is n-truncatedif the fiber fibf(b) is an n-type for all b:B.

In particular, f is (-2)-truncated if and only if it is an equivalence.And of course, A is an n-type if and only if A𝟏 is n-truncated.Moreover, n-truncated maps could equivalently be defined recursively, like n-types.

Lemma 7.6.2.

For any n-2, a function f:AB is (n+1)-truncated if and only if for all x,y:A, the map apf:(x=y)(f(x)=f(y)) is n-truncated.In particular, f is (-1)-truncated if and only if it is an embedding in the sense of §4.6 (http://planetmath.org/46surjectionsandembeddings).

Proof.

Note that for any (x,p),(y,q):𝖿𝗂𝖻f(b), we have

((x,p)=(y,q))=r:x=y(p=𝖺𝗉f(r)\\centerdotq)
=r:x=y(𝖺𝗉f(r)=p\\centerdotq-1)
=𝖿𝗂𝖻𝖺𝗉f(p\\centerdotq-1).

Thus, any path space in any fiber of f is a fiber of 𝖺𝗉f.On the other hand, choosing b:f(y) and q:𝗋𝖾𝖿𝗅f(y) we see that any fiber of 𝖺𝗉f is a path space in a fiber of f.The result follows, since f is (n+1)-truncated if all path spaces of its fibers are n-types.∎

We can now construct the factorization, in a fairly obvious way.

Definition 7.6.3.

Let f:AB be a function. The n-imageof f is defined as

𝗂𝗆n(f):b:B𝖿𝗂𝖻f(b)n.

When n=-1, we write simply im(f) and call it the image of f.

Lemma 7.6.4.

For any function f:AB, the canonical function f~:Aimn(f) is n-connected.Consequently, any function factors as an n-connected function followed by an n-truncated function.

Proof.

Note that A(b:B)𝖿𝗂𝖻f(b). The function f~ is the function on total spaces induced by the canonical fiberwise transformationPlanetmathPlanetmath

b:B(𝖿𝗂𝖻f(b)𝖿𝗂𝖻f(b)n).

Since each map 𝖿𝗂𝖻f(b)𝖿𝗂𝖻f(b)n is n-connected by Corollary 7.5.8 (http://planetmath.org/75connectedness#Thmprecor2), f~ is n-connected by Lemma 7.5.13 (http://planetmath.org/75connectedness#Thmprelem8).Finally, the projection 𝗉𝗋1:𝗂𝗆n(f)B is n-truncated, since its fibers are equivalentMathworldPlanetmathPlanetmathPlanetmathPlanetmath to the n-truncations of the fibers of f.∎

In the following lemma we set up some machinery to prove the unique factorization theorem.

Lemma 7.6.5.

Suppose we have a commutative diagramMathworldPlanetmath of functions

\\includegraphics

HoTT_fig_7.6.1.png

with H:h1g1h2g2, where g1 and g2 are n-connected and where h1 and h2 are n-truncated.Then there is an equivalence

E(H,b):𝖿𝗂𝖻h1(b)𝖿𝗂𝖻h2(b)

for any b:B, such that for any a:A we have an identification

E¯(H,a):E(H,h1(g1(a)))(g1(a),𝗋𝖾𝖿𝗅h1(g1(a)))=(g2(a),H(a)-1).
Proof.

Let b:B. Then we have the following equivalences:

𝖿𝗂𝖻h1(b)w:𝖿𝗂𝖻h1(b)𝖿𝗂𝖻g1(𝗉𝗋1w)n(since $g_{1}$ is $n$-connected)
w:𝖿𝗂𝖻h1(b)𝖿𝗂𝖻g1(𝗉𝗋1w)n(by Corollary 7.3.10 (http://planetmath.org/73truncationshmprecor2), since $h_{1}$ is $n$-truncated)
𝖿𝗂𝖻h1g1(b)n(by http://planetmath.org/node/87774Exercise 4.4)

and likewise for h2 and g2.Also, since we have a homotopyMathworldPlanetmath H:h1g1h2g2, there is an obvious equivalence 𝖿𝗂𝖻h1g1(b)𝖿𝗂𝖻h2g2(b).Hence we obtain

𝖿𝗂𝖻h1(b)𝖿𝗂𝖻h2(b)

for any b:B. By analyzing the underlying functions, we get the following representation of what happens to the element(g1(a),𝗋𝖾𝖿𝗅h1(g1(a))) after applying each of the equivalences of which E is composed.Some of the identifications are definitional, but others (marked with a = below) are only propositional; putting them together we obtain E¯(H,a).

(g1(a),𝗋𝖾𝖿𝗅h1(g1(a)))=((g1(a),𝗋𝖾𝖿𝗅h1(g1(a))),|(a,𝗋𝖾𝖿𝗅g1(a))|n)
|((g1(a),𝗋𝖾𝖿𝗅h1(g1(a))),(a,𝗋𝖾𝖿𝗅g1(a)))|n
|(a,𝗋𝖾𝖿𝗅h1(g1(a)))|n
=|(a,H(a)-1)|n
|((g2(a),H(a)-1),(a,𝗋𝖾𝖿𝗅g2(a)))|n
((g2(a),H(a)-1),|(a,𝗋𝖾𝖿𝗅g2(a))|n)
(g2(a),H(a)-1)

The first equality is because for general b, the map𝖿𝗂𝖻h1(b)(w:𝖿𝗂𝖻h1(b))𝖿𝗂𝖻g1(𝗉𝗋1w)ninserts the center of contraction for 𝖿𝗂𝖻g1(𝗉𝗋1w)n supplied by the assumptionPlanetmathPlanetmath that g1 is n-truncated; whereas in the case in question this type has the obvious inhabitant |(a,𝗋𝖾𝖿𝗅g1(a))|n, which by contractibility must be equal to the center.The second propositional equality is because the equivalence 𝖿𝗂𝖻h1g1(b)𝖿𝗂𝖻h2g2(b) concatenates the second components with H(a)-1, and we have H(a)-1\\centerdot𝗋𝖾𝖿𝗅=H(a)-1.The reader may check that the other equalities are definitional (assuming a reasonable solution to http://planetmath.org/node/87774Exercise 4.4).∎

Combining Lemma 7.6.4 (http://planetmath.org/76orthogonalfactorization#Thmprelem2),Lemma 7.6.5 (http://planetmath.org/76orthogonalfactorization#Thmprelem3), we have the following unique factorization result:

Theorem 7.6.6.

For each f:AB, the space factn(f) defined by

(X:𝒰)(g:AX)(h:XB)(hgf)×𝖼𝗈𝗇𝗇n(g)×𝗍𝗋𝗎𝗇𝖼n(h).

is contractibleMathworldPlanetmath.Its center of contraction is the element

(𝗂𝗆n(f),f~,𝗉𝗋1,θ,φ,ψ):𝖿𝖺𝖼𝗍n(f)

arising from Lemma 7.6.4 (http://planetmath.org/76orthogonalfactorization#Thmprelem2),where θ:pr1f~f is the canonical homotopy, where φ is the proof ofLemma 7.6.4 (http://planetmath.org/76orthogonalfactorization#Thmprelem2), and where ψ is the obvious proof that pr1:imn(f)B has n-truncated fibers.

Proof.

By Lemma 7.6.4 (http://planetmath.org/76orthogonalfactorization#Thmprelem2) we know that there is an element of 𝖿𝖺𝖼𝗍n(f), hence it is enough toshow that 𝖿𝖺𝖼𝗍n(f) is a mere proposition. Suppose we have two n-factorizations

(X1,g1,h1,H1,φ1,ψ1)  and  (X2,g2,h2,H2,φ2,ψ2)

of f. Then we have the pointwise-concatenated homotopy

H:(λa.H1(a)\\centerdotH2-1(a)):(h1g1h2g2).

By univalence and the characterizationMathworldPlanetmath of paths and transport in Σ-types, function types, and path types, it suffices to show that

  1. 1.

    there is an equivalence e:X1X2,

  2. 2.

    there is a homotopy ζ:eg1g2,

  3. 3.

    there is a homotopy η:h2eh1,

  4. 4.

    for any a:A we have 𝖺𝗉h2(ζ(a))-1\\centerdotη(g1(a))\\centerdotH1(a)=H2(a).

We prove these four assertions in that order.

  1. 1.

    By Lemma 7.6.5 (http://planetmath.org/76orthogonalfactorization#Thmprelem3), we have a fiberwise equivalence

    E(H):b:B𝖿𝗂𝖻h1(b)𝖿𝗂𝖻h2(b).

    This induces an equivalence of total spaces, i.e. we have

    (b:B𝖿𝗂𝖻h1(b))(b:B𝖿𝗂𝖻h2(b)).

    Of course, we also have the equivalences X1(b:B)𝖿𝗂𝖻h1(b) and X2(b:B)𝖿𝗂𝖻h2(b) from Lemma 4.8.2 (http://planetmath.org/48theobjectclassifier#Thmprelem2).This gives us our equivalence e:X1X2; the reader may verify that the underlying function of e is given by

    e(x)𝗉𝗋1(E(H,h1(x))(x,𝗋𝖾𝖿𝗅h1(x))).
  2. 2.

    By Lemma 7.6.5 (http://planetmath.org/76orthogonalfactorization#Thmprelem3), we may chooseζ(a):𝖺𝗉𝗉𝗋1(E¯(H,a)):e(g1(a))=g2(a).

  3. 3.

    For every x:X1, we have

    𝗉𝗋2(E(H,h1(x))(x,𝗋𝖾𝖿𝗅h1(x))):h2(e(x))=h1(x),

    giving us a homotopy η:h2eh1.

  4. 4.

    By the characterization of paths in fibers (Lemma 4.2.5 (http://planetmath.org/42halfadjointequivalences#Thmprelem2)), the path E¯(H,a) from Lemma 7.6.5 (http://planetmath.org/76orthogonalfactorization#Thmprelem3) gives usη(g1(a))=𝖺𝗉h2(ζ(a))\\centerdotH(a)-1.The desired equality follows by substituting the definition of H and rearranging paths.∎

By standard arguments, this yields the following orthogonality principle.

Theorem 7.6.7.

Let e:AB be n-connected and m:CD be n-truncated.Then the map

φ:(BC)(h:AC)(k:BD)(mhke)

is an equivalence.

Sketch of proof.

For any (h,k,H) in the codomain, let h=h2h1 and k=k2k1, where h1 and k1 are n-connected and h2 and k2 are n-truncated.Then f=(mh2)h1 and f=k2(k1e) are both n-factorizations of mh=ke.Thus, there is a unique equivalence between them.It is straightforward (if a bit tedious) to extract from this that 𝖿𝗂𝖻φ((h,k,H)) is contractible.∎

We end by showing that images are stable under pullbackPlanetmathPlanetmath.

Lemma 7.6.8.

Suppose that the square

\\includegraphics

HoTT_fig_7.6.2.png

is a pullback square and let b:B. Then 𝖿𝗂𝖻f(b)𝖿𝗂𝖻g(h(b)).

Proof.

This follows from pasting of pullbacks (http://planetmath.org/node/87643Exercise 2.12), since the type X in the diagram

\\includegraphics

HoTT_fig_7.6.3.png

is the pullback of the left square if and only if it is the pullback of the outer rectangle, while 𝖿𝗂𝖻f(b) is the pullback of the square on the left and 𝖿𝗂𝖻g(h(b)) is the pullback of the outer rectangle.∎

Theorem 7.6.9.

Consider functions f:AB, g:CD and the diagram

\\includegraphics

HoTT_fig_7.6.4.png

If the outer rectangle is a pullback, then so is the bottom square (and hence so is the top square, by http://planetmath.org/node/87643Exercise 2.12). Consequently, images are stable under pullbacks.

Proof.

Assuming the outer square is a pullback, we have equivalences

B×D𝗂𝗆n(g)(b:B)(w:𝗂𝗆n(g))h(b)=𝗉𝗋1w
(b:B)(d:D)(w:𝖿𝗂𝖻g(d)n)h(b)=d
b:B𝖿𝗂𝖻g(h(b))n
b:B𝖿𝗂𝖻f(b)n(by Theorem 7.6.9 (http://planetmath.org/76orthogonalfactorization#Thmprethm3))
𝗂𝗆n(f).
随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 19:19:41