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 cross–square counting identity
Statement
Let be a finite-field hereditary Hall category. Write , and let count exact sequences . For fixed objects , the following cross–square identity holds: Both sums are finite. The left side counts pairs of exact sequences with a common middle object ; the right side counts the compatible four-edge square data, weighted by the displayed Yoneda Ext/Hom ratio.
The diagrams below display the data being counted. A cross is a pair of short exact sequences with the same middle object; it is not an assertion of vertical maps between the endpoint objects.
A square datum is the isomorphism class of these four exact edges:
The equal labels indicate shared endpoint isomorphism classes only; no additional morphisms between the two rows are part of the square datum.
Facts & Assumptions
Given: A finite-field hereditary Hall category and four fixed objects .
Hom and Yoneda Ext groups are finite-dimensional -vector spaces, and the short-exact-sequence low-degree Yoneda Ext sequences continue through an term that vanishes (Finite-field hereditary Hall categories, Low-degree exact sequences for Yoneda Ext in both variables).
The short-exact-sequence and pullback/pushout constructions in an abelian category provide kernels, images, quotients, pullbacks of epimorphisms and pushouts of monomorphisms (Abelian category, Pullback and pushout of an extension).
Proof
For each cross, let , let be the image of in , let be the image of in , and put . The kernel–image–quotient identities give the four exact sequences in the square datum. Thus an isomorphism of crosses induces an isomorphism of square data and defines a map from cross isomorphism classes to square isomorphism classes.
Fix a square datum . Its four short exact sequences determine and . Pullback and pushout exactness give , , and , where is the pair of kernel inclusions and is induced by the quotient maps and . The order of the two summands is fixed as .
For a fixed cross, an automorphism of stabilizes its two endpoint-labelled sequences exactly when it is the identity on both subobjects and on both quotients . Then vanishes on and has image in , so it factors uniquely as for . Conversely every such gives a stabilizing automorphism : since , its inverse is . Therefore the stabilizer has cardinality .
A cross over is equivalent to an extension together with a map of this extension to that is on kernels and the identity on . Given this diagram, take the two canonical subobjects from the pushout defining . Their intersection is and their sum is . The composite has kernel : on its kernel is , and on it induces the quotient , so there are no additional kernel elements. It is epic because its image contains and surjects onto . The same argument with shows kernel and epimorphic quotient. Conversely, from a cross, the quotient maps and induce the unique map with the stated restrictions. This identifies the fiber over .
Let be the class of , and let be pushout along . An extension class has a map to of the type in step 2.2 exactly when : pushing out its left endpoint along produces an extension with endpoints , and a fixed-end map to exists precisely when that pushout is equivalent to . For any one such class and any fixed representative sequence, the set of maps to is a torsor for , because the difference of two maps vanishes on and therefore factors uniquely through the quotient .
The left side of the claimed identity is , where is the finite set of pairs of endpoint-labelled exact sequences with middle . By the orbit–stabilizer formula for , it equals the sum over cross isomorphism classes of the reciprocal of their stabilizer size. By step 2.1, each class over a fixed square contributes .
The exact Yoneda sequence of [F1] for is The final zero follows from . Hence is surjective, so is nonempty and has cardinality This follows by taking cardinalities successively in the finite exact sequence: the kernel of is the image of , whose kernel is the image of ; the first three Hom terms have the displayed orders by exactness.
For a fixed Yoneda class with middle object , all labelled short exact sequences representing form one -orbit. The stabilizer consists of automorphisms with ; its cardinality is , since . Hence the orbit has size . By step 3.1 each representative has compatible maps to . By step 2.1 each cross has stabilizer . Dividing the number of representatives and maps by the cross orbit size, the class contributes cross isomorphism classes over .
Summing the contribution in step 4.2 over all classes in and substituting the fiber cardinality in step 4.1 shows that exactly cross isomorphism classes lie over .
The product counts labelled square data. The action of is free: an automorphism fixing the adjacent monomorphism is the identity by monicity, and one fixing the adjacent epimorphism is the identity by epicity. Thus division by the four automorphism numbers gives the number of square isomorphism classes. Each square has cross classes by step 5.1, each weighted by by step 3.2. This is exactly the right side of the identity.
Both sums are finite. The left sum has finite support in because is finite. For the right sum, a square datum determines the composites and . Their images, kernels and cokernels determine the four corner classes . The finite sets and therefore allow only finitely many such quadruples. The counted orbit sums are finite, and their equality in step 6.1 is the stated identity.
Depends on
Used by
Dependency tree · two levels
15 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
- Olivier Schiffmann, Lectures on Hall Algebras, arXiv:math/0611617v2 (standard reference, not scraped)
- Claus Michael Ringel, Hall algebras and quantum groups, Inventiones Mathematicae 101 (1990), 583–591 (standard reference, not scraped)