By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

Thomason Model Structures in Every Strict Higher Dimension

For every n∈{1,2,3,… }∪{∞}n \in \{1, 2, 3, \dots\} \cup \{\infty\}, the classes (Cn,Wn,Fn)(C_n, W_n, F_n) defined by Wn=Rn−1(WKQ)=Nn−1(WKQ)W_n = R_n^{-1}(W_{\mathrm{KQ}}) = N_n^{-1}(W_{\mathrm{KQ}}), Fn=Rn−1(FibKQ)F_n = R_n^{-1}(\mathrm{Fib}_{\mathrm{KQ}}), and Cn=⊥(Fn∩Wn)C_n = {}^\perp(F_n \cap W_n) form a proper combinatorial model structure on nCatn\mathrm{Cat} cofibrantly generated by (LnI,LnJ)(L_n I, L_n J), and Ln:sSetKQ⇄(nCat,Cn,Wn,Fn):RnL_n : \mathrm{sSet}_{\mathrm{KQ}} \rightleftarrows (n\mathrm{Cat}, C_n, W_n, F_n) : R_n is a Quillen equivalence.

If i:A↪Ei : A \hookrightarrow E is a sieve of small posets with a right adjoint retraction, then cnN(i)c_n N(i) is a couniversal Thomason equivalence: for every a:UA→Xa : U_A \to X, the canonical map X→X⨿UAUEX \to X \amalg_{U_A} U_E is a Thomason equivalence, for every finite n≥1n \ge 1 and for n=∞n = \infty.

Let A⊂BA \subset B be a sieve of small posets with upward closure ZZ, and suppose A↪ZA \hookrightarrow Z admits a right adjoint retraction. For every functor a:UA→Xa : U_A \to X in nCatn\mathrm{Cat}, the canonical map γB,X:PB(X)→NnVB(X)\gamma_{B,X} : P_B(X) \to N_n V_B(X) from PB(X)=NnX⨿NnUANnUBP_B(X) = N_n X \amalg_{N_n U_A} N_n U_B to Nn(X⨿UAUB)N_n(X \amalg_{U_A} U_B) is a simplicial weak equivalence, NnUA→NnUBN_n U_A \to N_n U_B is a monomorphism, and the comparison is natural in f:X→X′f : X \to X' under UAU_A.

For every simplicial set KK, the canonical map θK=ηSd2K:Sd2K→NnLnK\theta_K = \eta_{\mathrm{Sd}^2 K} : \mathrm{Sd}^2 K \to N_n L_n K is a weak equivalence.

For every 1≤n≤∞1 \le n \le \infty, the category nCatn\mathrm{Cat} is locally small, complete, cocomplete, and locally finitely presentable, with filtered colimits computed on cells, and every set of objects has a common infinite regular presentability bound.

For a downward-closed subposet A⊂EA \subset E and monotone maps f,g:E→Ef, g : E \to E with f(e)≤g(e)f(e) \le g(e), f∣A=g∣Af|_A = g|_A, and g∣E∖Ag|_{E \setminus A} constant, there is for each 1≤n≤∞1 \le n \le \infty a strict functor Pf,g:UE⊗D1→UEP_{f,g} : U_E \otimes D_1 \to U_E with endpoint restrictions U(f)U(f) and U(g)U(g), satisfying Pf,g(U(i)⊗idD1)=U(v)πUAP_{f,g}(U(i) \otimes \mathrm{id}_{D_1}) = U(v)\pi_{U_A} where v=fi=giv = fi = gi, inducing a simplicial homotopy on Street nerves stationary relative to NnU(v)N_n U(v).

For every horn inclusion d∈Jd \in J, every pushout of LndL_n d belongs to WnW_n.

For d∈I∪Jd \in I \cup J, writing LndL_n d as UA→UBU_A \to U_B via Lemma 6.2, if f:X→X′f : X \to X' belongs to WnW_n, then for every a:UA→Xa : U_A \to X the induced functor X⨿UAUB→X′⨿UAUBX \amalg_{U_A} U_B \to X' \amalg_{U_A} U_B belongs to WnW_n.

Methods

Construct strict right Gray cylinders on UE⊗D1U_E \otimes D_1 stationary on a downward-closed subposet A⊂EA \subset E using an explicit positive chain map Cσ:M[m]⊗M[1]→M[Tσ]C_\sigma : M[m] \otimes M[1] \to M[T_\sigma] via Steiner's functor ν\nu and the biclosed Gray tensor product, and reflect them to finite nn via the internal hom H(Y)H(Y).

Source excerpts

“We define a graded homomorphism Cσ : M[m] ⊗ M[1] −→ M[Tσ] (3.2) on the tensor basis. For x = [i0, . . . , ip], with i0 < · · · < ip, set wj = vij and prescribe Cσ(x ⊗ e0) = F(w) := [f(w0), . . . , f(wp)], Cσ(x ⊗ e1) = G(w) := [g(w0), . . . , g(wp)], (3.3) Cσ(x ⊗ u) = h(w) := [f(w0), . . . , f(wp), g(wp)].” · Show in paper

“Now transpose a cylinder to a functor X → H(Y ). Since H(Y ) is an n-category, it factors uniquely through τnX. Transposing back proves (2.6).” · Show in paper

Glue stationary right Gray cylinders across arbitrary pushouts in nCatn\mathrm{Cat} by transposing them into the internal hom H(Y)H(Y) and applying the pushout universal property.

Source excerpts

“The cylinders bP : B ⊗ D1 → Y, jπX : X ⊗ D1 → Y transpose to maps B → H(Y ) and X → H(Y ) in nCat. Their restrictions to B0 agree, since on its cylinder both give biπB0 = jaπB0. The pushout universal property in nCat thus gives a unique map Y → H(Y ) extending both transposes.” · Show in paper

Decompose algebraic pushouts Y=X⨿UAUPY = X \amalg_{U_A} U_P into actual full sieves and cosieves by applying the colimit-preserving fiber functors Fϵ:nCat/D1→nCatF_\epsilon : n\mathrm{Cat}/D_1 \to n\mathrm{Cat} to compatible labels on PP and XX.

Source excerpts

“The compatibility assumption makes the defining pushout a pushout in nCat/D1. Applying Fϵ and then Lemmas 4.1 and 4.3 gives (4.2). This identifies the canonical map from the displayed pushout to Y with the inclusion of a full fiber.” · Show in paper

Construct presentations P(G,R)P(G, R) of strict nn-categories from a sorted set of generators GG and strong equations RR by simultaneously generating definedness judgments D(t)D(t) and equality judgments t=ut = u closed under finite-premise rules.

Source excerpts

“Generate simultaneously judgments D(t) and t = u, meaning that t is defined and that t, u are defined with the same value.” · Show in paper