Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Variable-base cotensor corners and path objects

Statement

For a simplicial commutative ring A, modules and unital or nonunital simplicial A-algebras have cotensors XK with underlying simplicial exponent and A-action through the constant-precomposition map A→AK. For an augmentation to B one uses the relative cotensor XK×BKB. If p ⁣:X→Y has underlying horn lifting and i ⁣:K→L is a monomorphism, then XL→XK×YKYL has horn lifting; it has boundary lifting if i is a horn inclusion or if p has boundary lifting. For each unsliced additive or algebraic object the cotensor path endpoints XΔ[1]→X×X are Kan and the constant-path map X→XΔ[1] is a weak equivalence on normalized additive homology. The relative assertions apply to fibrant sliced objects; arbitrary A-algebras augmented to B need not be fibrant. The Axiom of Choice (The Axiom of Choice) is assumed for simultaneous lifts.

Facts & Assumptions

Given: A simplicial commutative ring A; a simplicial set K; an A-module or (nonunital) A-algebra X; a map p ⁣:X→Y with underlying horn lifting; a monomorphism i ⁣:K→L; AC.

[F1]

A map has horn lifting (is a Kan fibration) when it has the right lifting property against all horn inclusions; pushout products of monomorphisms with horn inclusions are anodyne, and any map with horn lifting lifts against anodyne inclusions (Simplicial horns and Kan fibrations, The boundary and horn product has a finite horn attachment).

[F2]

Every simplicial abelian group is Kan, and the normalized fibration criterion identifies the Kan and boundary-lifting classes additively; an additive homomorphism that is a homotopy equivalence of underlying simplicial sets induces a quasi-isomorphism on normalized complexes (Additive Kan maps and the normalized fibration criterion, Normalized simplicial chains, prism homotopies and the abelian trivial-fibration criterion).

[F3]

A map with boundary lifting lifts every simplicial monomorphism under AC (Trivial simplicial fibrations lift monomorphisms and have contractible products of fibres).

Proof

1.1givenconstruct

Cotensors in the variable base. For a simplicial set K and a fixed-variable-base A-module M, define MnK as the set of maps of simplicial sets K×Δ[n]→M with the pointwise additive structure; the A-action is through the constant-precomposition map A→AK: an n-simplex a∈An represents a map Δ[n]→A and multiplies a map K×Δ[n]→M pointwise in the K-coordinate as well. For an A-algebra C this gives CK its A-algebra structure through A→AK→CK, with pointwise multiplication in the nonunital case. All constructions commute with the face and degeneracy maps because these act on the Δ[n]-coordinate, so the underlying simplicial set of XK is exactly the simplicial exponent. For a fixed augmentation C→B one uses the relative cotensor CK×BKB, where B→BK is the constant map in the K-variable; the fixed-base restriction is essential, since the unrestricted exponent would change the prescribed augmentation.

2.1F1F3step 1.1

Corner lifting. Let p ⁣:X→Y have underlying horn lifting and let i ⁣:K→L be a monomorphism. By the exponent adjunction Map⁡(Z,XK)≅Map⁡(Z×K,X), a lifting problem for pi ⁣:XL→XK×YKYL against a horn inclusion is equivalent to a lifting problem for p against the pushout product i □ (Λr[t]⊂Δ[t]), which is anodyne by [F1]; hence pi has horn lifting. If i is itself a horn inclusion, the corresponding boundary lifting problems for pi translate into pushout products of that horn with a boundary inclusion, again anodyne, so pi has boundary lifting. If instead p has boundary lifting, then all corresponding pushout products of the monomorphism i with a boundary inclusion are monomorphisms, and [F3] supplies lifting of p against these monomorphisms, so pi has boundary lifting. These arguments apply verbatim to the variable-base additive and algebraic cotensors, because their underlying set corners are the exponent corners and all algebraic structure is fixed through constant precomposition.

3.1F2step 1.1step 2.1

Path objects in the unsliced case. Take Y=0 and i ⁣:∂Δ[1]⊂Δ[1]. Every additive object X is Kan by [F2], so the endpoint map XΔ[1]→X×X is a Kan fibration by step 2.1 with p ⁣:X→0. The constant-path map c ⁣:X→XΔ[1] satisfies e0c=id for the evaluation e0 at 0. Precomposing with the map Δ[1]×Δ[1]→Δ[1] given on ordered vertices by the minimum gives a simplicial homotopy ce0≃id on XΔ[1]: at one endpoint it is the constant map at 0 and at the other it is the identity. Pointwise operations and constant-A-precomposition make this homotopy compatible with the module and algebra structures at every simplicial stage, so the prism and free-additive argument of [F2] shows that c is a weak equivalence on normalized additive homology. Hence the endpoint and constant-path assertions hold for simplicial modules and for unital or nonunital algebras over an arbitrary simplicial A.

4.1F2step 1.1step 2.1step 3.1discharge-construct∎

Relative and sliced statements. For augmented B-algebras, every augmentation D→B has the section given by the structure map and is termwise surjective, so it is Kan by [F2]; applying steps 2.1 and 3.1 with Y=B (or with the relative cotensor of step 1.1) proves the corresponding path facts in the slice. For an arbitrary slice AlgA/B, the fibrant objects are exactly those whose augmentation is Kan; not every object of the slice is fibrant, and no such assertion is made. The Axiom of Choice is used exactly for the simultaneous lifting choices in step 2.1.

Depends on

Used by

Dependency tree · two levels

12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources