Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Strong monoidal transport from a product-base cocartesian family

PDF p. 3: Strong monoidal transports from the common product-base family

Statement

Let S=N(Fin∗) and let q:E→B×S be a cocartesian fibration of infinity-categories. Assume that for each b∈B, the inert transports in the pullback Eb⊗→S induce equivalences E(b,n)≃E(b,1)n for all n≥0; the n=0 condition means E(b,0) is terminal. Then q determines one coherent functor from B to symmetric monoidal infinity-categories and strong symmetric monoidal functors. Its value at b is Eb⊗→S, and its transport for u:b→b′ is induced by q-cocartesian transport over (u,id). It preserves every S-cocartesian transport, including active tensor operations and the nullary unit, with all composition/higher coherences.

Facts & Assumptions

Given: One actual cocartesian fibration over the PRODUCT B×S, and the specified Segal/unit equivalences. Separate fibrations over B and S do not constitute the hypothesis.

Goal: Derive strong symmetric monoidal B-transports from that one family.

[F1]

External straightening and symmetric monoidal criteria supplies straightening with its morphisms, exponential currying, and the HA symmetric monoidal/strong monoidal criteria.

Proof

1.1F1given

Straighten q to F:B×S→Cat∞. Currying is the exponential equivalence Fun⁡(B×S,Cat∞)≃Fun⁡(B,Fun⁡(S,Cat∞)), so it gives one functor G:B→Fun⁡(S,Cat∞), with G(b)=F(b,−). The pullback Eb⊗→S is its unstraightening. By the assumed inert Segal equivalences and terminal zeroth value, this is a symmetric monoidal infinity-category.

2.1F1step 1.1

An edge u:b→b′ gives the actual natural transformation G(u):F(b,−)→F(b′,−) in Fun⁡(S,Cat∞). Under the straightening equivalence whose morphisms preserve cocartesian arrows, it gives a map Eb⊗→Eb′⊗ OVER S preserving ALL S-cocartesian arrows. Its component at s∈S is the q-transport along (u,ids). Thus it is strong symmetric monoidal by the criterion in [F1], not just a map preserving inert arrows.

3.1F1step 1.1step 2.1

Explicitly, for every α:s→t in S, naturality in the curried functor gives an equivalence F(b′,α)∘F(u,ids)≃F(u,idt)∘F(b,α). Both sides are transports along the same composite arrow (u,α) in the product base. For α:⟨2⟩→⟨1⟩ this is the tensor equivalence, and for α:⟨0⟩→⟨1⟩, together with terminal E(b,0), it is the unit equivalence. Hence the active and nullary operations are preserved, not merely the coordinate projections.

4.1F1step 1.1step 2.1step 3.1∎

Every simplex of B is already sent by G to a simplex of Fun⁡(S,Cat∞). Unstraightening its transformations retains their full compositions and all higher coherences. The full subcategory of Fun⁡(S,Cat∞) on objects satisfying the Segal/unit conditions contains every G(b), and, by step 2.1, its transformations correspond to strong symmetric monoidal functors. Therefore G factors through that model of symmetric monoidal infinity-categories, proving the asserted coherent diagram. No higher coherence has been inferred from pointwise equivalences.

Depends on

Used by · 1

Dependency tree · 2 levels

Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text.