Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 one-loop quiver extension correspondence in dimension two

Example

Let Q have one vertex and one loop x:

\begin{tikzpicture}[>=stealth]
  \node[circle,draw,inner sep=2.5pt] (v) at (0,0) {$\bullet$};
  \draw[->] (v) edge[loop above] node {$x$} (v);
\end{tikzpicture}

Take a=b=1. Then Rep⁡Q(1)=C and Rep⁡Q(2)=Mat⁡2(C). The group GL⁡1 acts trivially on Rep⁡Q(1), while GL⁡2 acts on Rep⁡Q(2) by conjugation. The extension atlas consists of pairs (A,L) with L a line in C2 and A(L)⊆L. In a basis adapted to L, A=(λc0μ). The map q records the scalars (λ,μ), and the map p forgets L.

Facts & Assumptions

Given: AC, the one-vertex, one-loop quiver, the dimension vectors a=b=1, and the extension correspondence of Representation stacks and exact-sequence correspondences of a finite quiver.

[F1]

Representation stacks and exact-sequence correspondences of a finite quiver: for the loop arrow the off-diagonal extension coordinate belongs to Hom⁡(C,C), and q records the diagonal blocks while p forgets the subrepresentation.

[F2]

The quiver exact-sequence correspondence is smooth and proper: the map q has relative stack dimension ∑h:i→jbiaj−∑iaibi, and p is proper.

[A1]

The Axiom of Choice: AC is inherited through the smoothness and properness supplier [F2] and the projective flag-variety supplier [F3]; the matrix and invariant-line calculations are choice-free.

Verification

1.1F1given

A one-loop representation of dimension one is a scalar, and change of basis by GL⁡1 fixes it because conjugation by a scalar is trivial. A dimension-two representation is a 2×2 matrix with conjugation action. Preserving a chosen line makes the matrix upper triangular in an adapted basis, as displayed.

1.2F1F2algebra

For this quiver the off-diagonal rank is e=1 and the unipotent vertex-block rank is u=1; hence q has relative stack dimension e−u=0, agreeing with −χQ(1,1)=0. For the splitting change represented by t∈Hom⁡(C,C), the change-of-basis matrix gt=(1t01) acts by A↦gtAgt−1, sending c to c+(μ−λ)t. Thus when λ≠μ the extension coordinate is removed by a unique splitting change, whereas when λ=μ it is unchanged; this is consistent with a zero-dimensional stack morphism, not a claim that all extension fibers are points.

1.3F3given

The fiber of p at a scalar matrix λI is all of P1, so it is positive-dimensional. For a diagonal matrix with distinct eigenvalues, an invariant line must be an eigenspace, giving exactly two points. For a non-scalar Jordan matrix λI+N with N2=0 and rank⁡N=1, an invariant line is N-stable; the nilpotent map induced on a one-dimensional line is zero, so the line lies in ker⁡N, which is the unique invariant line. These fibers agree with the closed incidence projection to Mat⁡2(C)×P1 and do not affect properness.

2.1A1F2F3step 1.3∎

The incidence equations A(L)⊆L are closed in Mat⁡2(C)×P1, so the forgetful map p is projective and proper by [F2]. The example includes a loop and checks why stack-relative dimension and properness must be read from the specified correspondence, not from finiteness of its fibers. AC is inherited through [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

39 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