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.
One-color quiver full flags need not be semismall
Example
Assume the Axiom of Choice as inherited from the cited geometry suppliers. Take the loopless quiver with a single vertex and no arrows, , and its unique word. Then and . The proper incidence map to the point need not be semismall: in this example its defect is positive.
Verification
Given: the loopless one-vertex quiver with no arrows, the space of dimension , the unique word of content , and the choice assumption of the Example.
There are no arrows, so , and the stability conditions of the incidence lemma Quiver full-flag incidence has a smooth projective compactification are vacuous; the lemma gives as the total space of the rank-zero subbundle, of dimension , and the map is the constant map to the point , which is proper since it is projective.
The semismall inequality on a target stratum with fibre dimension is ; here there is just the point stratum. The image of is the single point, and its single fiber is all of , so the defect equals , which is positive for ; hence this proper incidence map is not semismall. For or the flag space is a point and the defect is zero, so the non-semismall boundary is exactly , and a general quiver-flag decomposition proof must allow this case.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 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
- M. Varagnolo, E. Vasserot, Canonical bases and KLR-algebras, arXiv:0901.3992v2, Sec. 1.1 (standard reference, not scraped)
- J. S. Milne, Algebraic Geometry, Secs. 6.m-6.n (standard reference, not scraped)