Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-11-05 (gpt-6.1-sol)
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.

Finite Fukaya categories, units, twisted objects, and perfect modules

Definition

Work over k=C, with cohomological grading and the Koszul rule of the earlier algebraic definition. A small uncurved A∞-category A consists of a set of objects, a graded k-vector space hom⁡A(X,Y) for every ordered pair, and operations μd of degree 2−d on every composable d-tuple. For each composable tuple the operations obey the same signed Stasheff identity as the earlier uncurved A∞-algebra definition, with the object labels required to match the inputs and output. No curvature operation μ0 is included.

A strict unit at X is a closed element eX∈hom⁡0(X,X) with μ2(eX,x)=x=μ2(x,eX) and μd(…,eX,…)=0 for d≠2, in the fixed unsuspended convention. A cohomological unit is a class [eX]∈H0(hom⁡(X,X),μ1) whose products under the induced cohomological μ2 act as identities on every H∗(hom⁡(X,Y)) and H∗(hom⁡(Y,X)). A category is homologically unital when such classes are supplied for all objects. Strict units and homological units are different interfaces.

For the cohomology-category, finite pretriangulated-envelope, retract, perfect-module, split-generation and derived-localization constructions below, require A to be homologically unital; every target category in the localization property is likewise required to be homologically unital. For a homologically unital category C, its cohomology category H0(C) has the same objects, morphism spaces H0(hom⁡C(X,Y),μ1), composition [a]∘[b]=[μ2(a,b)], and identity [eX] at X. The bar, module and opposite formulas themselves also make sense for nonunital algebraic data.

An uncurved A∞-functor F:A→B has an object map and composable-input maps Fd of degree 1−d satisfying the earlier A∞-morphism identity for every labelled input string. Fix the following explicit bar convention. Inputs are written in composition order: aj∈hom⁡(Xj,Xj−1), and μd(a1,…,ad)∈hom⁡(Xd,X0). Put V(X,Y)=shom⁡(X,Y), where ∣sa∣=∣a∣−1 and s has degree −1, and cd=d(d−1)/2. The object-labelled tensor coalgebra BA is the direct sum of all finite composable words v1⊗⋯⊗vn, including one empty word at each object, with deconcatenation coproduct. Its degree-one Taylor components are bd=−(−1)cdsμd(s−1)⊗d,d≥1. All tensor maps use Koszul signs. Equivalently, bd(sa1,…,sad)=(−1)1+cd+∑j=1d(d−j)(∣aj∣−1)sμd(a1,…,ad). On a word, b inserts bd into each consecutive block, with sign (−1)∣v1∣+⋯+∣vr∣ for an insertion after r letters. The given unsuspended Stasheff identity is exactly b2=0 in these conventions. The common minus on all bd is intentional: in particular b1(sa)=−sμ1(a).

A right A∞-module N consists of graded spaces N(X) and maps md∣1:N(X0)⊗hom⁡(X1,X0)⊗⋯⊗hom⁡(Xd,Xd−1)⟶N(Xd),∣md∣1∣=1−d. The actual cofree right bar comodule is the direct sum CN=⨁N(X0)⊗V(X1,X0)⊗⋯⊗V(Xd,Xd−1), with unsuspended module coefficient and coaction splitting off every suffix. Define degree-one prefix components by qd(n;sa1,…,sad)=(−1)cd+1+d(∣n∣−1)+∑j=1d(d−j)(∣aj∣−1)md∣1(n;a1,…,ad),d≥0. Thus q0=m0∣1 is the cochain differential on N(X). The comodule differential is the following completely specified map: DN(n⊗v1⋯vk)=∑d=0kqd(n;v1,…,vd)⊗vd+1⋯vk+∑r≥0, j≥1r+j≤k(−1)∣n∣+∑i=1r∣vi∣n⊗v1⋯vr⊗bj(vr+1,…,vr+j)⊗vr+j+1⋯vk. The module identities mean DN2=0; this explicit finite formula defines every component identity without an implicit sign choice. It obeys ρDN=(DN⊗1+1⊗b)ρ using the Koszul tensor rule. The representable module is YX(T)=hom⁡(T,X) with md∣1(n;a1,…,ad)=μd+1(n,a1,…,ad). To check its identity, restrict b to words whose first letter lies in shom⁡(−,X), conjugate by the suspension of that first coefficient, and multiply the resulting degree-one operator by −1. The suffix insertion sign becomes (−1)∣n∣+∑i≤r∣vi∣ and the prefix becomes exactly qd above; its square is zero. Thus the representable differential is μ1, with the prescribed category convention.

A degree-h module premorphism is a right bar-comodule map f:CN→CP of degree h. It is determined by all its prefix maps fd:N⊗V⊗d→P, extended on words by f(n⊗v1⋯vk)=∑d=0kfd(n;v1,…,vd)⊗vd+1⋯vk. The full premorphism space is a product over arities and object strings; every fixed-word formula is finite. Its differential is ∂f=DPf−(−1)hfDN, and composition is composition of these comodule maps. A module map is a closed degree-zero premorphism; it is a quasi-isomorphism when f0 is a cohomology isomorphism at every object.

A left module N assigns graded spaces N(X) and degree-1−d maps ℓd∣1(a1,…,ad;n)∈N(X0) for aj:Xj→Xj−1 and n∈N(Xd). Put vj=saj, S(v1,…,vd)=∑j∣vj∣, and P(v1,…,vd)=∑i<j∣vi∣∣vj∣. Its cofree LEFT comodule is CNL=BA⊗N, with deconcatenation splitting off prefixes. The degree-one suffix components are qdL(v1,…,vd;n)=(−1)cd+1+∑j=1d(d−j)∣vj∣ℓd∣1(a1,…,ad;n). In particular q0L=ℓ0∣1 is the value differential and q1L(sa;n)=−ℓ1∣1(a;n). Its differential is DNL(v1⋯vk;n)=∑r≥0, j≥1r+j≤k(−1)∑i=1r∣vi∣(v1⋯vr bj(vr+1,…,vr+j) vr+j+1⋯vk;n)+∑d=0k(−1)∑i=1k−d∣vi∣v1⋯vk−d⊗qdL(vk−d+1,…,vk;n). The identities mean (DNL)2=0. A degree-h left premorphism is determined by degree-h suffix maps fd:V⊗d⊗N→P and has extension f(v1⋯vk;n)=∑d=0k(−1)h∑i=1k−d∣vi∣v1⋯vk−d⊗fd(vk−d+1,…,vk;n). Its differential and composition are ∂f=DPLf−(−1)hfDNL and ordinary composition. Its Hom space is a product over arities and object strings. A closed degree-zero map is an objectwise quasi-isomorphism exactly when every f0 is. The covariant representable is YXL(T)=hom⁡A(X,T) with ℓd∣1(a1,…,ad;n)=μd+1(a1,…,ad,n). This is distinct from YXR(T)=hom⁡A(T,X). Homological unitality of a module means that the indicated binary action of each degree-zero cohomological unit is identity on value cohomology. Neither side imposes vanishing of higher unit-input operations.

The opposite category has hom⁡Aop(X,Y)=hom⁡A(Y,X) and μopd(a1,…,ad)=(−1)cd−1+∑i<j∣ai∣∣aj∣μd(ad,…,a1). On suspended words the reversal is R(v1⋯vd)=(−1)d+P(v1,…,vd)vd⋯v1; R fixes empty words, and bop=RbR−1. For a left module define the exact reversal ΘN(v1⋯vd;n)=(−1)d+P(v1,…,vd)+∣n∣S(v1,…,vd)(n;vd⋯v1). This identifies it with a right module over Aop, using DNR,op=ΘNDNLΘN−1 and fR,op=ΘPfLΘN−1 at EVERY Taylor arity. Explicitly, mopd∣1(n;a1,…,ad)=(−1)cd+∑i<j∣ai∣∣aj∣+∣n∣∑i∣ai∣ℓd∣1(ad,…,a1;n), fdR,op(n;v1,…,vd)=(−1)d+P(v1,…,vd)+∣n∣S(v1,…,vd)fdL(vd,…,v1;n). The same involution transports in the reverse direction. At binary category arity the opposite multiplication is the ordinary graded opposite, and at one category input its right action is n⋅opa=(−1)∣n∣∣a∣an. In the strict DG specialization, a homogeneous closed left premorphism with only f0 nonzero satisfies f0(an)=(−1)∣f0∣∣a∣af0(n); a right one satisfies f0(na)=f0(n)a. No left/right variance is suppressed.

For shifts, let Lk be a graded line of degree −k and set hom⁡(X[k],Y[l])=hom⁡(Lk,Ll)⊗hom⁡(X,Y). Identify s(f⊗a) with (−1)∣f∣f⊗sa. Before this identification is undone, the suspended matrix operation on fi⊗vi is (−1)∑i<j∣vi∣∣fj∣+∑i∣fi∣(f1⋯fd)⊗bd(v1,…,vd), summed over matching finite matrix indices. This fixes all signs in the shifted additive category; there is no unspecified shift convention.

A finite twisted object is a finite direct sum of those cohomological shifts with a degree-one matrix q strictly decreasing a fixed finite filtration. Set t=−sq and require the finite curvature equation ∑d≥1bd(t,…,t)=0,equivalently∑d≥1(−1)cd−1μd(q,…,q)=0. The suspended operations between twisted objects are bdt(v1,…,vd)=∑r0,…,rd≥0bd+R(t0r0,v1,t1r1,…,vd,tdrd),R=∑iri. They are finite on each input matrix word. Undo the SAME suspension convention to define μtwd. Explicitly, for ∣ai∣=αi, the unsuspended insertion of q0r0,a1,q1r1,…,ad,qdrd has sign (−1)R+cd+R+cd+∑i=1d(ri+⋯+rd)(αi−1). The morphism differential is μtw1, including every such higher-operation term. In the DG specialization it is Da=da+qouta−(−1)∣a∣aqin, and the curvature equation is dq+q2=0. This signed equation replaces the former unsigned sum; the two are not equivalent for arbitrary higher operations.

Modules and full premorphisms extend to finite shifted sums with the fixed graded-line tensor convention and unsuspended module coefficients. Here is the insertion map on their cofree comodules. On a composable matrix word v1,…,vd through objects X0,…,Xd, let ti=−sqi∈shom⁡(Xi,Xi) be the degree-zero twisting matrix at Xi. Write ti⊗0 for the empty word. Define degree-zero linear maps by EN,tR(n;v1,…,vd)=∑r0,…,rd≥0(n;t0⊗r0,v1,t1⊗r1,…,vd,td⊗rd),n∈N(X0), EN,tL(v1,…,vd;n)=∑r0,…,rd≥0(t0⊗r0,v1,t1⊗r1,…,vd,td⊗rd;n),n∈N(Xd). In each summand expand the matrices and sum only over matching summand indices, retaining the module coefficient on its displayed side. These maps act on the underlying right and left cofree matrix-word spaces, respectively. In particular at d=0 they send (n) to ∑r≥0(n;t0⊗r) on the right and to ∑r≥0(t0⊗r;n) on the left. Every gap has finitely many nonzero summands because qi strictly decreases a finite filtration. There is no extra insertion sign: each ti has degree zero, and its factor from ti=−sqi is already included. The category map Et is the same insertion formula with the module coefficient omitted, including Et(1Xi)=∑r≥0ti⊗r for the empty word. Use the appropriate side for EN,t and set DNt=EN,−tDNEN,t and Ft=EP,−tFEN,t; likewise bt=E−tbEt. Thus the right twisted prefix core is qdR,t(n;v)=∑rqd+RR(n;t0⊗r0,v1,…,vd,td⊗rd), with the intervening ti strings as displayed above; the left twisted suffix core and both premorphism cores use exactly the corresponding insertion into qL and f. The inverse of each insertion map is obtained by replacing every ti by −ti. The justifying lemma proves the inverse, square-zero and face identities. All conjugations and inverses are finite on each matrix word; the curvature vanishes by the displayed curvature equation.

The finite pretriangulated envelope closes under finite sums, shifts, and mapping cones in this convention. Its idempotent completion additionally includes every retract in its cohomology category. Here X is a retract of T if there are morphisms i:X→T and p:T→X in H0 with pi=1X. Explicitly, the idempotent completion of a category H has objects (T,e) with e2=e∈End⁡H(T) and morphisms a:(T,e)→(U,f) satisfying a=fae; composition is inherited from H and the identity of (T,e) is e. Apply this to H=H0 of the finite envelope. The module enhancement used here is the full dg category of homologically unital modules with the full premorphisms defined above; its strict identity has component f0=id⁡ and fd=0 for d>0. The perfect modules are the retracts, in its cohomology category, of finite iterated cones and shifts of representable modules. For a set G of objects, thick⁡(G) is the smallest full subcategory closed under those operations and containing G; G split-generates when this equals the entire idempotent-complete pretriangulated category.

For a set S of closed degree-zero morphisms, an S-local module is one on which each map induced by s∈S is a quasi-isomorphism. Functors in the following localization property preserve cohomological units, meaning [F1(eX)]=[eF(X)] for every object X; an equivalence is an isomorphism in H0 of the target. The following bimodule model specifies both quasi-functors and their morphisms.

An A–B bimodule has graded spaces M(X,Y), covariant in the A label X and contravariant in the B label Y. Form the direct sum CM of words u1⊗⋯⊗up⊗m⊗w1⊗⋯⊗wq, where ui∈shom⁡A(Xi,Xi−1), m∈M(Xp,Y0) and wj∈shom⁡B(Yj,Yj−1), including p=0 and q=0. Its outer labels are (X0,Yq). The maps ρL:CM→BA⊗CM and ρR:CM→CM⊗BB sum over all cuts splitting off an A prefix and a B suffix, respectively, including empty cuts. Supply a degree-one map DM:CM→CM preserving outer labels, with DM2=0,ρLDM=(bA⊗1+1⊗DM)ρL,ρRDM=(DM⊗1+1⊗bB)ρR. Its core dp,qM is projection to words with both outer words empty, hence has output M(X0,Yq). Equivalently, extend these degree-one cores by applying each to every suffix of the A word together with every prefix of the B word and the middle coefficient, retaining the unused outer words; the sign is (−1)degree of the retained A prefix. Add all bA and bB insertions, with the Koszul tensor signs. This recovers DM and specifies its identities on every finite word. Require the left modules at fixed Y and right modules at fixed X to be homologically unital: their cores are qpL=dp,0M and qqR=d0,qM in the preceding module conventions, so the induced binary unit actions on value cohomology are identities.

A degree-h bimodule premorphism f:CM→CN preserves outer labels and satisfies ρLf=(1⊗f)ρL and ρRf=(f⊗1)ρR. It is specified by arbitrary degree-h cores fp,q with the same input/output labels as dp,qM. Extend them over the same suffix/prefix cuts, now with sign (−1)h degree of the retained A prefix. All cores form a product over p,q and object strings; each input word uses only finitely many cuts. Set ∂f=DNf−(−1)hfDM, with ordinary composition. This defines the full dg category of these bimodules. Two objects are coherently quasi-isomorphic here when they are isomorphic in its H0: there are closed degree-zero full premorphisms f,g and degree-minus-one full premorphisms h,k with gf−1=∂h and fg−1=∂k. Thus the comparison includes all mixed arities.

Write QFun⁡(A,B) for the full dg subcategory of these bimodules for which, for each X, the right module M(X,−) is isomorphic in H0 of the full right-module dg category to YF(X)R=hom⁡B(−,F(X)) for some object F(X) of B. Its objects are the quasi-functors, or right quasi-representable bimodules, in this bar model. Representability is a condition, not chosen strict identifications. For a closed degree-zero a:X′→X, its induced full right-module map M(a):M(X′,−)→M(X,−) has cores −d1,qM(sa;m;w1,…,wq); the minus is the preceding left-module sign q1L(sa;m)=−ℓ1∣1(a;m). Let QFun⁡S(A,B) be the full subcategory where every M(a), a∈S, is invertible in that right-module H0.

Restriction along a unit-preserving A∞-functor Q:A→L is the dg functor Q∗:M↦M(Q(−),−) defined on cores by substituting the bar coalgebra map BQ in the A input word. Explicitly, its Taylor maps are Q^d=(−1)cdsQd(s−1)⊗d, and BQ sums over all ordered partitions into nonempty consecutive blocks, applying Q^ to each block; it sends each empty word to the empty word at its image object. These signs give bLBQ=BQbA. For both a bimodule core and a premorphism core, substitute this finite sum in its left word; for the differential also retain the prescribed outer bA and bB insertions. A quasi-equivalence of dg categories means a dg functor inducing a quasi-isomorphism on every morphism complex and an essentially surjective functor on H0 (each target object is isomorphic there to an image object).

A derived localization Q:A→A[S−1]=L is a unit-preserving functor to a homologically unital category, carrying S to equivalences, such that for every small homologically unital target B the restriction Q∗:QFun⁡(L,B)⟶QFun⁡S(A,B) is a quasi-equivalence in the explicit sense above. This requires both quasi-isomorphisms of the full comparison complexes and existence of extensions up to the specified coherent quasi-isomorphisms. It does not choose strict inverses to the arrows in S or assert existence of a localization for geometric data.

Remarks

These conventions fix the algebraic vocabulary used by the finite-operation, outgoing-pairing, and generation items on this page. They do not assert that a geometric Floer category or any of its units, moduli spaces, bar maps, or localization arrows exist.

Depends on

Used by

Dependency tree · two levels

18 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