Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 two-dimensional gl(1|1) action is well-defined

Statement

For every a,b∈C, the action data in Two-dimensional highest-weight module data for gl(1|1) make K(a,b) a left gl(1∣1)-supermodule. The vector v is a highest-weight vector of weight (a,b), and it generates K(a,b).

Facts & Assumptions

Given: The bracket table and triangular decomposition of gl(1∣1), and the candidate action on K(a,b)=Cv⊕Cw.

[F1]

Bracket data for gl(1|1): h1,h2 are even, e,f odd, with the bracket table displayed in that definition.

[F2]

The gl(1|1) bracket data define a Lie superalgebra: the bracket data define a Lie superalgebra and the selected h,n+,n− form a triangular decomposition.

[F3]

Two-dimensional highest-weight module data for gl(1|1): K(a,b) has basis v even and w odd, the displayed actions, and weight functional λa,b(c1h1+c2h2)=c1a+c2b.

[F4]

Lie supermodules and representations: a module action must preserve parity and satisfy [x,y]u=x(yu)−(−1)∣x∣∣y∣y(xu) for homogeneous x,y.

[F5]

Highest-weight vectors and modules for a Lie superalgebra: a highest-weight vector is a nonzero homogeneous vector that is an h-weight vector and is annihilated by n+.

Proof

1.1givenF3F4algebra

The actions of h1,h2 preserve the parity of v,w, and the actions of e,f reverse it. Thus the candidate action has the parity required in [F4].

2.1F1F3step 1.1algebra

The operators h1,h2 are diagonal in the basis v,w, so they commute, matching [h1,h2]=0. On v, both the bracket actions [hi,e]v and the operator commutators (hie−ehi)v vanish for i=1,2, since [hi,e] is a multiple of e, ev=0, and each hiv is a scalar multiple of v. On w, the commutators h1e−eh1 and h2e−eh2 give (a−(a−1))(a+b)v=(a+b)v=[h1,e]w and (b−(b+1))(a+b)v=−(a+b)v=[h2,e]w. Likewise, h1f−fh1 and h2f−fh2 on v give ((a−1)−a)w=−w=[h1,f]v and ((b+1)−b)w=w=[h2,f]v, and both bracket actions and commutators vanish on w. Hence all even–odd bracket relations in [F1] hold.

2.2F1F3step 1.1algebra

Since e2=f2=0 on both basis vectors, the odd self-brackets act as zero. The anticommutator ef+fe sends v to (a+b)v and w to (a+b)w; this equals the action of h1+h2 on both vectors. Therefore the odd–odd relations in [F1] hold.

3.1F1F2F3F4F5step 2.1step 2.2∎

By bilinearity, the checked basis-pair identities imply the module identity in [F4] for every homogeneous pair. For h=c1h1+c2h2, its action on v is (c1a+c2b)v=λa,b(h)v by [F1] and [F3]. The vector v is nonzero and even, is killed by e, and e spans n+ by [F2]; hence [F5] makes it a highest-weight vector. Since fv=w, it generates both basis vectors.

Depends on

Used by

Cited to discharge well-definedness by Two-dimensional highest-weight module data for gl(1|1).

Dependency tree · two levels

9 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