Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Classical Lie-action BRST cochain complex

Definition

Let k be a characteristic-zero field, let g be a Lie algebra over k, and let A be a unital commutative k-algebra. A classical Lie-action BRST input is a Lie algebra homomorphism ρ:g→End⁡k(A) whose values are derivations: for x∈g and a,b∈A, ρ(x)(ab)=ρ(x)(a)b+aρ(x)(b),ρ(x)(1)=0. In particular, A is a g-module, so its Chevalley–Eilenberg cochains are CBRSTn(g,A)=Hom⁡k(Λng,A)(n≥0), and are zero for n<0. Define the degree-+1 classical Lie-action BRST operator by the fixed zero-based formula (dBRSTf)(x0,…,xn)=∑i=0n(−1)iρ(xi)f(x0,…,xi^,…,xn)+∑0≤i<j≤n(−1)i+jf([xi,xj],x0,…,xi^,…,xj^,…,xn). A hat denotes omission; the bracket is inserted first. This is exactly the Chevalley–Eilenberg differential for the stated representation, with the BRST name reserved here for this classical Lie-action model.

Its square-zero property and the resulting quotient cohomology are established in The classical Lie-action BRST differential squares to zero. This model does not claim a Koszul–Tate resolution, a BFV charge for arbitrary first-class constraints, reducible or open gauge algebras, field-dependent structure functions, or quantum BRST cohomology.

Depends on

Used by

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