Span equivalence between algebras for n-globular operads
Yuya Nishimura
**Abstract. We define a new equivalence between algebras for n-globular operads which is suggested in [Cottrell 2015], and show that it is a generalization of ordinary equivalence between categories.
Keywords. Algebras for n-globular operads, Span equivalence.
Mathematics Subject Classification (2010). 18A22, 18C20, 18D50**
1. Introduction
In [Cottrell 2015], Thomas Cottrell defined an equivalence of K-algebras on an n-globular set to show the following coherence theorem:
Theorem 1.1**.**
Let K be an n-globular operad with unbiased contraction γ, and let X be n-globular set.
Then the free K-algebra on X is equivalent to the free strict n-category on X.
His equivalence in this theorem is as follows:
Definition 1.2**.**
Let K be an n-globular operad. K-algebras KX→X and KY→Y are equivalent if there exists a map of K-algebras u:X→Y or u:Y→X such that u is surjective on [math]-cells, full on m-cells for all 1≤m≤n, and faithful on n.
But, as he said, this equivalence is not the best one: “This definition of equivalence is much more (and thus much less general) than ought to be.” To improve it, he suggested two approaches. The one of them is to replace the map u with a span of maps of K-algebras. In this paper, we adopt this approach and prove two theorem. The first is that we define an adequate equivalence using spans
and prove this is indeed an equivalence relation. The second is that our equivalence is a generalization of ordinary equivalence between categories.
In Section 2 we recall the preliminary definitions (globular sets, thier maps, operads, algebras for a operad). In Section 3 we define the notion of span equivalence in K\mathchar45Alg and prove the first theorem. In Section 4, for ordinary categories, we define span equivalence in Cat independently. Then we show that two categories are ordinary equivalent if and only if they are span equivalent in Cat. To prove this, we use a combinatorial construction named equivalence fusion. Futhermore, we show the second theorem.
2. Preliminary
The contents of the section is in [Cottrell 2015].
Definition 2.1**.**
Let n∈N. An n-globular set is a diagram
[TABLE]
of sets and maps such that
[TABLE]
*for all k∈{2,...,n} and x∈Xk.
Elements of Xk are called k-cells of X. We defined hom-sets of X as follows:*
[TABLE]
*for all k∈{1,...n} and x,y∈Xk−1.
Let X,Y be n-globular sets, A map of n-globular sets from X to Y is a collection f={fk:Xk→Yk}k∈{1,...,n} of maps of sets such that*
[TABLE]
*for all k∈{1,...,n} and x∈Xk.
The category of n-globular sets and their maps is denoted by n\mathchar45GSet.*
Definition 2.2**.**
A category is cartesian if it has all pullbacks. A functor is cartesian if it preserves pullbacks. A natural transformation is cartesian if it all of its naturality squares are pullbacks squares. A monad is cartesian if its functor part, unit and counit are cartesian. A map of monad is cartesian if its underlying natural transformation is cartesian.
Definition 2.3**.**
Let C be a cartesian category with a terminal object 1. and T be a cartesian monad on C. The category of T-collections is the slice category C/T1. The category has a monoidal structure: let k:K→T1,k′:K′→T1 be collections; then their tensor product is defined to be the composite along the top of the diagram
[TABLE]
where ! is the unique map K′→1. the unit for this tensor product is the collection
[TABLE]
The monoidal category is denoted by T\mathchar45Coll.
Definition 2.4**.**
Let C be a cartesian category with a terminal object 1, and T be a cartesian monad on C. A T-operad is a monoid in the monoidal category T-Coll. In the case in which T is the free strict n-category monad on n\mathchar45GSet, a T-operad is called an n-globular operad.
Definition 2.5**.**
Let C be a cartesian category with a terminal object 1, T be a cartesian monad on C and K be a T-operad. Then there is an induced monad on C, which by abuse of notation we denote (K,ηK,μK): The endfunctor
[TABLE]
is defined as follows; The object part of the functor, for X∈C, KX is defined by the pullback:
[TABLE]
The arrow part of the functor, for Y∈C,u:X→Y, Ku is defined by the unique property of the pullback:
[TABLE]
Components ηXK,μXKof the unit map ηK:1⇒K and μK:K2⇒K are defined by the following diagrams:
[TABLE]
[TABLE]
Definition 2.6**.**
Let C be a cartesian category with a terminal object 1, T be a cartesian monad on C and K be a T-operad. We define a K-algebra as an algebra for the induced monad (K,ηK,μK). Similarly, a map of algebras for T-operad K is a map of algebras for the induced monad. The category of K-algebras and thier maps is denoted by K\mathchar45Alg.
Leinster’s weak n-category is an algebra for specific operad. See section 9 and 10 in [Leinster 2004] for details.
3. Span equivalence
Definition 3.1**.**
Let f:X→Y be a map of n-globular sets.
f* is surjective on k-cells :⇔ fk:Xk→Yk is surjective*
f* is injective on k-cells :⇔ fk:Xk→Yk is injective*
f* is full on k-cells :⇔
\left\{\begin{array}[]{l}\forall x,x^{\prime}\in X_{k-1},\beta\in{\bf Hom}_{Y}(f_{k-1}(x),f_{k-1}(x^{\prime})),\\
\exists\alpha\in{\bf Hom}_{X}(x,x^{\prime})\hskip 5.0pt{\rm s.t.}\hskip 5.0ptf_{k}(\alpha)=\beta\\
\end{array}\right.*
f* is faithful on k-cell :⇔
\left\{\begin{array}[]{l}{}\forall x,x^{\prime}\in X_{k-1},\alpha,\alpha^{\prime}\in{\bf Hom}_{X}(f_{k-1}(x),f_{k-1}(x^{\prime})),\\
\alpha\neq\alpha^{\prime}\Rightarrow f_{k}(\alpha)\neq f_{k}(\alpha^{\prime})\end{array}\right.*
Let f be a map of K-algebras. f is surjective (respectively, injective, full, faithful) on k-cells if and only if the underlying map is surjective (respectively, injective, full, faithful) on k-cells.
Definition 3.2**.**
Let K be an n-globular operad. K-algebras ϕ:KX→X and ψ:KY→Y are span equivalent in K\mathchar45Alg if there exists a triple ⟨θ,u,v⟩ such that θ:KZ→Z is an K-algebra, u:θ→ϕ and v:θ→ψ are maps of K-algebras, surjective on [math]-cells, full on m-cells for all 1≤m≤n, and faithful on n-cells. The triple ⟨θ,u,v⟩ is referred to as an span equivalence of K-algebras.
Trivially, under the same situation as Theorem 1.1, the free K-algebra on X is span equivalent to the free strict n-category on X.
Proposition 3.3**.**
In the pullback diagram in n\mathchar45GSet
[TABLE]
f* is surjective on [math]-cells ⇒ j is surjective on [math]-cells*
f* is full on k-cells ⇒ j is full on k-cells*
f* is faithful on k-cells ⇒ j is faithful on k-cells*
Proof.
We define an n-globular set P as follows:
[TABLE]
[TABLE]
[TABLE]
for all k∈{0,...,n},l∈{1,...,n}, and maps of n-globular sets i,j as follows:
[TABLE]
for all k∈{0,...,n}. Then (P,i,j) is a pullback of X and Y over S. It is enough to prove the proposition that we check the claims for (P,i,j).
Firstly, we prove surjectivity on [math]-cells. For y∈Y0, there exists x∈X0 such that f0(x)=g0(y), So (x,y)∈P0 and j0((x,y))=y. which is the condition of surjectivity.
To show fullness, we suppose (x,y),(x′,y′)∈Pk−1,ϕ∈Hom(y,y′), we can see skgk(ϕ)=gk−1(y)=fk−1,tkgk(ϕ)=gk−1(y′)=fk−1(x′). Thus gk(ϕ)∈Hom(fk−1(x),fk−1(x′)). For fullness, there exists ψ∈Hom(x,x′) such that fk(ψ)=gk(ϕ). Then (ψ,ϕ)∈Hom((x,y),(x′,y′)) and jk(ψ,ϕ)=ϕ. Therefore j is full on k-cells.
Lastly, we suppose that f is faithful on k-cells. let (x,y),(x′,y′)∈Pk−1 and ψ,ϕ∈Hom((x,y),(x′,y′)) such that jk(ψ)=jk(ϕ). Then fkik(ψ)=gkjk(ψ)=gkjk(ϕ)=fkik(ϕ). From faithfulness, ik(ψ)=ik(ϕ), and ψ=(ik(ψ),jk(ψ))=(ik(ϕ),jk(ϕ))=ϕ. Therefore j is faithful on k-cells.
∎
By the following remark, for the category of K-algebras, we can also get similar results of proposition 3.3.
Remark 3.4**.**
Let T be a monad on C. Then the forgetful functor U:K\mathchar45Alg→C creats limits. Hence any monadic functor reflects limits. (Theorem 3.4.2. in [TTT])
Proposition 3.5**.**
In K\mathchar45Alg. Let
[TABLE]
be span equivalences, then
[TABLE]
is span equivalence.
Proof.
By the fact, p,q are are surjective on [math]-cells, full on k-cells for 1≤k≤n and faithful on n-cells. Therefore f∘p,i∘q are surjective on [math]-cells, full on k-cells for 1≤k≤n and faithful on n-cells. So the span is span equivalence.
∎
Theorem 3.6**.**
Span equivalence is equivalence relation on K-algebras.
Proof.
It is straightforward from the definition and previous proposition that span equivalence is equivalence relation.∎
4. Characterizing equivalence of categories via spans
In this section, we define span equivalence in Cat which is independent of that in K\mathchar45Alg. Then we show that two categories are ordinary equivalent if and only if they are span equivalent in Cat and that span equivalence of categories implies span equivalence of algebras of them. Consequently, span equivalence is a generalization of ordinary equivalence.
Definition 4.1**.**
Let A and B be categories. We say that A and B are span equivalent in Cat if there exists a triple ⟨A,u,v⟩ such that C is a category, u:C→A and v:C→B are functors, surjective on objects, full and faithful.
Definition 4.2**.**
Let A and B be categories, let ⟨S:A→B,T:B→A,η:IA→TS,ϵ:ST→IB⟩ be an adjoint equivalence between A and B. We define a category, equivalence fusion A⊔∣B , as follows:
object-set
[TABLE]
hom-set
[TABLE]
composition
[TABLE]
[TABLE]
identities
[TABLE]
Proposition 4.3**.**
The equivalence fusion A⊔∣B forms a category.
Proof.
It is easy to check that the composition ∘~ is map from Hom(x,y)×Hom(y,z) to Hom(x,z). Now, we prove that the composition ∘~ satisfies associative law and identity law by case analysis.
associative law
x∈A,y∈A,z∈A,w∈A,
h∘(g∘f)=h∘A(g∘Af)
(h∘g)∘f=(h∘Ag)∘Af
x∈A,y∈A,z∈A,w∈B,
h∘(g∘f)=h∘(g∘Af)=h∘BS(g∘Af)=h∘B(Sg∘BSf)
(h∘g)∘f=(h∘BSg)∘f=(h∘BSg)∘BSf
x∈A,y∈A,z∈B,w∈A,
h∘(g∘f)=h∘(g∘BSf)=ηw−1∘ATh∘AT(g∘BSf)∘Aηx=ηw−1∘ATh∘ATg∘ATSf∘Aηx=ηw−1∘ATh∘ATg∘Aηy∘Af(h∘g)∘f=(ηw−1∘ATh∘ATg∘Aηy)∘f=(ηw−1∘ATh∘ATg∘Aηy)∘Af
x∈A,y∈A,z∈B,w∈B,
h∘(g∘f)=h∘(g∘BSf)=h∘B(g∘BSf)
(h∘g)∘f=(h∘Bg)∘f=(h∘Bg)∘BSf
x∈A,y∈B,z∈A,w∈A,
h∘(g∘f)=h∘(ηz−1∘ATg∘ATf∘Aηx)=h∘Aηz−1∘ATg∘ATf∘Aηx=ηw−1∘ATSh∘ATg∘ATf∘Aηx
(h∘g)∘f=(Sh∘Bg)∘f=ηw−1∘AT(Sh∘Bg)∘ATf∘Aηx=ηw−1∘ATSh∘ATg∘ATf∘Aηx
x∈A,y∈B,z∈A,w∈B,
h∘(g∘f)=h∘(ηz−1∘ATg∘ATf∘Aηx)=h∘BS(ηz−1∘ATg∘ATf∘Aηx)=h∘BSηz−1∘BST(g∘Bf)∘BSηx=h∘B(ϵSz∘BSηz)∘BSηz−1∘BST(g∘Bf)∘BSηx=h∘BϵSz∘BST(g∘Bf)∘BSηx=h∘Bg∘Bf∘BϵSx∘BSηx=h∘Bg∘Bf
(h∘g)∘f=(h∘Bg)∘f=(h∘Bg)∘Bf
x∈A,y∈B,z∈B,w∈A,
h∘(g∘f)=h∘(g∘Bf)=ηw−1∘ATh∘AT(g∘Bf)∘Aηx
(h∘g)∘f=(h∘Bg)∘f=ηw−1∘AT(h∘Bg)∘ATf∘Aηx
x∈A,y∈B,z∈B,w∈B,
h∘(g∘f)=h∘B(g∘Bf)
(h∘g)∘f=(h∘Bg)∘Bf
x∈B,y∈A,z∈A,w∈A,
h∘(g∘f)=h∘(Sg∘Bf)=Sh∘B(Sg∘Bf)
(h∘g)∘f=(h∘Ag)∘f=S(h∘Ag)∘Bf=(Sh∘BSg)∘Bf
x∈B,y∈A,z∈A,w∈B,
h∘(g∘f)=h∘(Sg∘Bf)=h∘B(Sg∘Bf)
(h∘g)∘f=(h∘BSg)∘f=(h∘BSg)∘Bf
x∈B,y∈A,z∈B,w∈A,
h∘(g∘f)=h∘(g∘Bf)=h∘B(g∘Bf)
(h∘g)∘f=(ηw−1∘ATh∘ATg∘Aηy)∘f=S(ηw−1∘ATh∘ATg∘Aηy)∘Bf=Sηw−1∘BST(h∘Bg)∘BSηy∘Bf=(ϵSw∘BSηw)∘BSηw−1∘BST(h∘Bg)∘BSηy∘Bf=ϵSw∘BST(h∘Bg)∘BSηy∘Bf=h∘Bg∘BϵSy∘BSηy∘Bf=h∘Bg∘Bf
x∈B,y∈A,z∈B,w∈B,
h∘(g∘f)=h∘B(g∘Bf)
(h∘g)∘f=(h∘Bg)∘Bf
x∈B,y∈B,z∈A,w∈A,
h∘(g∘f)=h∘(g∘Bf)=Sh∘B(g∘Bf)
(h∘g)∘f=(Sh∘Bg)∘f=(Sh∘Bg)∘Bf
x∈B,y∈B,z∈A,w∈B,
h∘(g∘f)=h∘B(g∘Bf)
(h∘g)∘f=(h∘Bg)∘Bf
x∈B,y∈B,z∈B,w∈A,
h∘(g∘f)=h∘B(g∘Bf)
(h∘g)∘f=(h∘Bg)∘Bf
x∈B,y∈B,z∈B,w∈B,
h∘(g∘f)=h∘B(g∘Bf)
(h∘g)∘f=(h∘Bg)∘Bf
identity law
x∈A,y∈A,
f∘idx=f∘Aidx=f
idy∘f=idy∘Af=f
x∈A,y∈B,
f∘idx=f∘BSidx=f∘BidSx=f
idy∘f=idy∘Bf=f
x∈B,y∈A,
f∘idx=f∘Bidx=f
idy∘f=Sidy∘Bf=idSy∘Bf=f
x∈B,y∈B,
f∘idx=f∘Bidx=f
idy∘f=idy∘Bf=f
∎
Definition 4.4**.**
Let ⟨S:A→B,T:B→A,η:IA→TS,ϵ:ST→IB⟩ be an adjoint equivalence, let A⊔∣B be the equivalence fusion. We define the projections u,v as follows:
u:A⊔∣B⟶A* *
*object-function
u:Ob(A⊔∣B)⟶Ob(A) *
\hskip 141.0ptx\longmapsto ux:=\left\{\begin{array}[]{ll}x&{\rm(}x\in{\cal A}{\rm)}\\
Tx&{\rm(}x\in{\cal B}{\rm)}\\
\end{array}\right.* *
*hom-functions u:Hom(x,y)⟶A(ux,uy) *
* \langle f,x,y\rangle\longmapsto uf:=\left\{\begin{array}[]{ll}f&{\rm(}x,y\in{\cal A}{\rm)}\\
Tf&{\rm(}x,y\in{\cal B}{\rm)}\\
Tf\circ_{{\cal A}}\eta_{x}&{\rm(}x\in{\cal A},y\in{\cal B}{\rm)}\\
\eta_{y}^{-1}\circ_{{\cal A}}Tf&{\rm(}x\in{\cal B},y\in{\cal A}{\rm)}\\
\end{array}\right. *
v:A⊔∣B⟶B* *
*object-function v:Ob(A⊔∣B)⟶Ob(B) *
* x\longmapsto vx:=\left\{\begin{array}[]{ll}Sx&{\rm(}x\in{\cal A}{\rm)}\\
x&{\rm(}x\in{\cal B}{\rm)}\\
\end{array}\right. *
*hom-functions v:Hom(x,y)⟶B(ux,uy) *
* \langle f,x,y\rangle\longmapsto vf:=\left\{\begin{array}[]{ll}Sf&{\rm(}x,y\in{\cal A}{\rm)}\\
f&{\rm(others)}\\
\end{array}\right.*
Proposition 4.5**.**
The projections u,v are functors.
Proof.
We show that u,v preserve composition of morphisms and identity morphism by case analysis.
u preserves composition of morphisms
x∈A,y∈A,z∈A,
u(g∘f)=u(g∘Af)=g∘Af
ug∘Auf=g∘Af
x∈A,y∈A,z∈B,
u(g∘f)=u(g∘BSf)=T(g∘BSf)∘Aηx=Tg∘ATSf∘Aηx
ug∘Auf=(Tg∘Aηy)∘Af=Tg∘ATSf∘Aηx
x∈A,y∈B,z∈A,
u(g∘f)=u(ηz−1∘ATg∘ATf∘Aηx)=ηz−1∘ATg∘ATf∘Aηx
ug∘Auf=(ηz−1∘ATg)∘A(Tf∘Aηx)
x∈A,y∈B,z∈B,
u(g∘f)=u(g∘Bf)=T(g∘Bf)∘Aηx=Tg∘ATf∘Aηx
ug∘Auf=Tg∘A(Tf∘Aηx)
x∈B,y∈A,z∈A,
u(g∘f)=u(Sg∘Bf)=ηz−1∘AT(Sg∘Bf)=ηz−1∘ATSg∘BTf
ug∘Auf=g∘A(ηy−1∘ATf)=ηz−1∘ATSg∘ATf
x∈B,y∈A,z∈B,
u(g∘f)=u(g∘Bf)=T(g∘Bf)=Tg∘ATf
ug∘Auf=(Tg∘Aηy)∘A(ηy−1∘ATf)=Tg∘ATf
x∈B,y∈B,z∈A,
u(g∘f)=u(g∘Bf)=ηz−1∘AT(g∘Bf)=ηz−1∘ATg∘ATf
ug∘Auf=(ηz−1∘ATg)∘ATf
x∈B,y∈B,z∈B,
u(g∘f)=u(g∘Bf)=T(g∘Bf)=Tg∘ATf
ug∘Auf=Tg∘ATf
u preserves identity morphisms
x∈A,
u(idx)=idx=idux
x∈B,
u(idx)=Tidx=idTx=idux
v preserves composition of morphisms
x∈A,y∈A,z∈A,
v(g∘f)=v(g∘Af)=S(g∘Af)=Sg∘BSf
vg∘Bvf=Sg∘ASf
x∈A,y∈A,z∈B,
v(g∘f)=v(g∘BSf)=g∘BSf
vg∘Bvf=g∘BSf
x∈A,y∈B,z∈A,
v(g∘f)=v(ηz−1∘ATg∘ATf∘Aηx)=S(ηz−1∘ATg∘ATf∘Aηx)=Sηz−1∘BST(g∘Bf)∘BSηx=g∘Bf
vg∘Bvf=g∘Bf
x∈A,y∈B,z∈B,
v(g∘f)=v(g∘Bf)=g∘Bf
vg∘Bvf=g∘Bf
x∈B,y∈A,z∈A,
v(g∘f)=v(Sg∘Bf)=Sg∘Bf
vg∘Bvf=Sg∘Bf
x∈B,y∈A,z∈B,
v(g∘f)=v(g∘Bf)=g∘Bf
vg∘Bvf=g∘Bf
x∈B,y∈B,z∈A,
v(g∘f)=v(g∘Bf)=g∘Bf
vg∘Bvf=g∘Bf
x∈B,y∈B,z∈B,
v(g∘f)=v(g∘Bf)=g∘Bf
vg∘Bvf=g∘Bf
v preserves identity morphisms
x∈A
v(idx)=Sidx=idSx=idvx
x∈B
v(idx)=idx idvx
∎
Proposition 4.6**.**
The projections u,v are surjective on objects, full and faithful.
Proof.
It’s trivial by definitions that u,v are surjective on objects. So we check fullness and faithfulness.
u is full and faithful
x,y∈A,
u:Hom(x,y)={⟨f,x,y⟩∣f∈A(x,y)}∋⟨f,x,y⟩↦f∈A(x,y) is bijective.
x,y∈B,
T:B(x,y)→A(Tx,Ty) is bijective. Therefore u:Hom(x,y)={⟨f,x,y⟩∣f∈B(x,y)}∋⟨f,x,y⟩↦f∈A(x,y)∋⟨f,x,y⟩↦Tf∈A(Tx,Ty)=A(ux,uy) is bijective.
x∈A,y∈B,
B(Sx,y)∋f↦Tf∘Aηx∈A(x,Ty) is the right adjunct of each f, and bijective. Therefore u:Hom(x,y)={⟨f,x,y⟩∣f∈B(Sx,y)}∋⟨f,x,y⟩↦Tf∘Aηx∈A(x,Ty)=A(ux,uy) is bijective.
x∈B,y∈A,
B(x,Sy)∋f↦ηy−1∘ATf∈A(Tx,y) is the left adjunct of each f, and bijective. Therefore u:Hom(x,y)={⟨f,x,y⟩∣f∈B(x,Sy)}∋⟨f,x,y⟩↦ηy−1∘ATf∈A(Tx,y)=A(ux,uy)
v is full and faithful
x,y∈A,
S:A(x,y)→B(Sx,Sy) is bijective. Therefore v:Hom(x,y)={⟨f,x,y⟩∣f∈A(x,y)}∋⟨f,x,y⟩↦Sf∈B(Sx,Sy)=B(vx,vy) is bijective.
x,y∈B,
v:Hom(x,y)={⟨f,x,y⟩∣f∈B(x,y)}∋⟨f,x,y⟩↦f∈B(x,y)=B(vx,vy) is bijective.
x∈A,y∈B,
v:Hom(x,y)={⟨f,x,y⟩∣f∈B(Sx,y)}∋⟨f,x,y⟩↦f∈B(Sx,y)=B(vx,vy) is bijective.
x∈B,y∈A,
v:Hom(x,y)={⟨f,x,y⟩∣f∈B(x,Sy)}∋⟨f,x,y⟩↦f∈B(x,Sy)=B(vx,vy) is bijective.
∎
Theorem 4.7**.**
Let A and B be categories. A is equivalent to B
if and only if A is span equivalent to B in Cat.
Proof.
Let A be equivalent to B, then A is adjoint equivalent to B. Thus there exists a adjoint equivalence between A and B. So we can construct the equivalence fusion and the projections. By Propositions, they are span equivalence in Cat. Therefore A is span equivalent to B.
On the other hand, let A be span equivalent to B in Cat. Then there exists a span equivalence ⟨C,u,v⟩ between A and B, and C is equivalent to both A and B. Therefore A is equivalent to B.
∎
Remark 4.8**.**
Let A be presheaf category. The forgetful functor
[TABLE]
is monadic. (Proposition F 1.1 in [Leinster 2004])
Let A=Set, we can see Set\mathchar45Cat=Cat, Set\mathchar45Grp=1\mathchar45GSet, and the induced monad T1 is the free strict 1-category monad on 1\mathchar45GSet. By the remark, the comparison functor
[TABLE]
is isomorphic and arrow part of the functor is
[TABLE]
Moreover, the category Wk\mathchar451\mathchar45Cat of Leinster’s weak 1 categories is the category T1\mathchar45Alg of algebras for the monad for details, refer to the proof of Theorem 9.1.4 in [Leinster 2004].
So the isomorphism N:Cat→Wk\mathchar451\mathchar45Cat preserve surjectivity, fullness and faithfullness. Hence,
Proposition 4.9**.**
Let N:Cat→Wk\mathchar451\mathchar45Cat be the isomorphism above. let A and B be categories. A is span equivalent to B in Cat if and only if N(A) is span equivalent to N(B) in Wk\mathchar451\mathchar45Cat.
As a result of Proposition 4.7 and Proposition 4.9, we obtain the following theorem:
Theorem 4.10**.**
A* is equivalent to B if and only if N(A) is span equivalent to N(B) in Wk\mathchar451\mathchar45Cat.*