Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
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.

The Green Hall coproduct is coassociative

Statement

The Green coproduct Δ′ of The Green Hall completion and coproduct is coassociative in the coefficientwise completion, with counit ϵ as defined there.

Facts & Assumptions

Given: A finite-field hereditary Hall category and an object R.

[F1]

Every coefficient of Δ′([R]) is finite (Green coproduct coefficients are finite).

[F2]

Endpoint-labelled sequence counts satisfy PA,BL=aAaBgA,BL (Exact-sequence counts equal endpoint automorphism counts times subobject counts).

[F3]
[F4]

The Green coproduct and counit coefficients are the formulas in The Green Hall completion and coproduct.

Proof

technique · direct
1.1F1F4given

Fix basis objects A,B,C,R. The coefficient of [A]⊗[B]⊗[C] in (Δ′⊗id)Δ′([R]) is ν⟨A+B,C⟩+⟨A,B⟩aR∑[L]PL,CRPA,BLaL. Only finitely many L occur: each is a middle term of an extension of A by B, and YExt⁡1(A,B) is finite.

2.1F2step 1.1construct

Using [F2], each summand in the flag count becomes aAaBaCgL,CRgA,BL. It counts a flag C⊆U⊆R with U/C≅B and R/U≅A, weighted by the same endpoint automorphism factor aAaBaC.

3.1F1F2step 2.1construct

The coefficient of [A]⊗[B]⊗[C] in (id⊗Δ′)Δ′([R]) is ν⟨A,B+C⟩+⟨B,C⟩aR∑[T]PA,TRPB,CTaT. Again the sum is finite by finiteness of YExt⁡1(B,C). Using [F2], it counts flags C⊆T⊆R with T/C≅B and R/T≅A, with the same weight aAaBaC. The two flag sets described in step 2.1 and in this calculation are identical under U=T.

4.1F3step 1.1step 3.1algebra

By bilinearity [F3], ⟨A+B,C⟩+⟨A,B⟩=⟨A,B+C⟩+⟨B,C⟩. Hence the two coefficients are equal. Every triple coefficient is therefore equal, proving coassociativity in the coefficientwise completion.

5.1F4F1algebra∎

In Δ′([R]), the coefficient of [R]⊗[0] and that of [0]⊗[R] are both one: the exact sequences with zero endpoint are uniquely determined up to the aR endpoint labellings, which cancel the denominator aR. Applying ϵ to either factor therefore returns [R], and all other terms are killed. Linearity proves the two counit identities.

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