Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passverified 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.

Right orthogonality and finite inverse words do not prove generation

Example

Construct the finite strictly unital DG category with objects D,E, diagonal endomorphisms C, Hom⁡(D,E)=0, and Hom⁡(E,D)=Cδ in degree one. For U=D⊕E with twisted differential δ, show that the right-bar map YD→YU has cone quasi-isomorphic to YE, while Hom⁡(E,U) is acyclic and Hom⁡(E,D)[1] retains a nonzero class. Show that the full co-unit certificate r,s does not exist. Extend this to a finite two-block history complex and calculate the nonzero residual w=−πWJhPβ although TU0=0. This finite algebra example demonstrates insufficiency of the proposed inference; it does not refute the geometric generation theorem.

Facts & Assumptions

Given: The cohomological DG and right-module conventions in the preceding definition. All complexes and morphisms are over C.

[F1]

Finite Fukaya categories, units, twisted objects, and perfect modules defines right representable modules YX=hom⁡(−,X), finite twisted objects, cones, and the full twisted differential.

[A1]

The DG category in the Statement has zero differential on its four morphism spaces before twisting; its only nonzero compositions are scalar multiplication by the two identities.

Verification

1.1F1A1constructalgebra

The specified compositions are associative: a composable string containing a nonidentity δ:E→D has no further nonzero nonidentity factor, and identities act as units. The differential is zero and obeys the Leibniz rule. Thus these data define a strictly unital DG category. The matrix q with sole entry qD,E=δ is strictly upper triangular and satisfies q2=0, so U=(D⊕E,q) is a finite twisted object. The inclusion ε:D→U is closed because q vanishes on the D-summand. The normalized bar over the full subcategory generated by D has no nonidentity letters, since End⁡(D)=C1D; its evaluation map is therefore Yε:YD→YU.

2.1A1step 1.1constructalgebra

At E, the right representable YU(E)=Hom⁡(E,U) has basis a:E→E↪U in degree zero and εδ in degree one, with differential da=εδ. Hence it is acyclic. Also Hom⁡(E,D)[1]=Cδ[1] is concentrated in degree zero with zero differential, so its class is nonzero.

2.2F1A1step 1.1constructalgebra

A degree-zero map r:U→D is multiplication by some λ∈C on the D-summand and is zero on the E-summand, since Hom⁡0(E,D)=0. The twisted Hom differential is dr=−rq=−λδ. Thus dr=0 forces λ=0, whereas rε=1D forces λ=1; no closed r can satisfy the co-unit equation. Moreover Hom⁡−1(D,D)=0, so there is no s with 1D−rε=ds that repairs this failure.

3.1F1step 1.1step 2.1constructalgebra

The bar map Yε:YD→YU is an objectwise chain map. At D it is the identity C→C, because Hom⁡(D,U)=Cε; its cone is contractible. At E its source is Cδ in degree one and it sends δ to εδ. The cone contains the degree-zero cycle (a,−δ[1]), since the two differential contributions are both εδ and cancel. Projection π:U→E is closed, and the induced cone map sends this cycle to 1E. The E-evaluation cone has no other cohomology: its only differential pairs the source copy of δ[1] with εδ, leaving the class of a−δ[1]. Consequently the cone map is a quasi-isomorphism at E and D, hence a quasi-isomorphism of these finite right modules. The cone is represented by E.

3.2F1step 2.1step 2.2constructalgebra

In the quotient that makes D contractible, adjoin ϵD∈Hom⁡−1(D,D) with dϵD=1D. The element v=a−εϵDδ has degree zero and dv=εδ−ε(dϵD)δ=0. Since πε=0 and πa=1E, one has πv=1E. The inverse-letter word therefore retains the identity of E, even though the ordinary old-U test is acyclic. The calculation proves that finite quotient words and right-side acyclicity alone do not supply the missing full co-unit nullhomotopy. No nontrivial quotient word can occur in Hom⁡(E,E): every word through D would require a nonzero final morphism D→E, which does not exist. Thus 1E remains nonboundary in the quotient. This calculation asserts neither existence nor nonexistence of an additional geometric primitive.

4.1F1step 2.1step 3.2constructalgebra∎

Form a finite upper history complex QUH=QU0⊕W, where QU0=Hom⁡(E,U)=Ca0→C(εδ)1 is the ordinary acyclic complex from step 2.1, d0a=εδ, and the added localization-word space W=Cv0 has dW=0, with zero off-diagonal block B=0. The contraction hU(εδ)=a, hU(a)=0 retracts QU0 to TU=0, so TU0=0. Take QPH=Cc−1→dPCβ0, dPc=β, dPβ=0, with hPβ=c, hPc=0; direct substitution gives dPhP+hPdP=1. Define the degree-one map J:QPH→QUH by Jc=v, Jβ=0. It obeys dUJ+JdP=0 because dUv=0=Jβ. Hence the full differential D(a,b)=(dUa+Jb,dPb) squares to zero. Then F=(0,β) is a closed full-block arrow, and D(0,c)=(v,β) gives F−D(0,c)=(−v,0). Its lower contraction gives the upper residual w=−πWJhPβ=−v. The class of v is nonzero in H0(W) because W−1=0 and v is a nonzero basis vector. Thus the actual transfer formulas admit a finite chain-level model with acyclic ordinary upper test and TU0=0, but nonzero history residual and no z∈W−1 with dWz=w. This construction is an algebraic countermodel to the implication, not a geometric history count. It leaves every separate geometric primitive-count obligation unresolved.

Remarks

The finite operation/history and geometric counted-primitive problems motivate this example but supply no premise of its calculations. Those geometric constructions remain separate unresolved obligations. The finite DG and two-block examples prove only the stated failure of an algebraic inference; they do not refute a geometric generation theorem.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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