Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedPipeline-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 N=1 supercharge bracket is a translation

Example

Use the complexified algebra of Complexified four-dimensional N=1 super-Poincare bracket data and The complexified N=1 super-Poincare bracket data satisfy super-Jacobi. Let u1=(1,0),u2=(0,1) be the standard basis of S+, and let ϕ1(z1,z2)=z1,ϕ2(z1,z2)=z2 be the coordinate-dual basis of S−. Set Qα=uα, Q‾β˙=ϕβ, and Pαβ˙=uα⊗ϕβ. These four Pαβ˙ form a basis of the translation space, and [Qα,Q‾β˙]=[Q‾β˙,Qα]=Pαβ˙. For the explicit Pauli basis and dual-basis translation elements defined in step 3.1, this becomes the familiar convention {Qα,Q‾β˙}=2iσαβ˙μPμ. The braces denote the superbracket of two odd elements, hence the anticommutator whenever the action is realized by odd elements of an associative superalgebra.

Facts & Assumptions

Given: The bracket data of the complexified N=1 super-Poincare superalgebra and the tensor-product translation space V=S+⊗S−.

[F1]

Complexified four-dimensional N=1 super-Poincare bracket data: [u,ϕ]=u⊗ϕ for u∈S+, ϕ∈S−, and the translation space is V=S+⊗S−.

[F2]

The complexified N=1 super-Poincare bracket data satisfy super-Jacobi: this bracket data define a complex Lie superalgebra.

[F3]

Associative superalgebra over the complex numbers: in a graded associative representation, the superbracket of odd operators is their anticommutator.

[F4]

The elementary tensors of two bases form the product basis of the tensor product: for free modules over a commutative ring with specified bases, the elementary tensors form a basis of their tensor product.

[F5]

Linear functionals and the algebraic dual V∗=L(V,F): the algebraic dual consists of all complex-linear maps from S+ to C.

Verification

technique · direct
1.1givenF1F4F5F6algebra

The coordinate forms ϕ1,ϕ2 are linear by [F5]. For any ϕ∈S− and (z1,z2)∈S+, linearity gives ϕ(z1,z2)=z1ϕ(u1)+z2ϕ(u2), hence ϕ=ϕ(u1)ϕ1+ϕ(u2)ϕ2; evaluating at u1,u2 proves their independence. Thus u1,u2 and ϕ1,ϕ2 are bases of the two free C-modules. By [F6], the scalar ring is commutative; [F4] then makes their four elementary tensors a basis of S+⊗S− and hence of the translation space.

2.1F1F2F3step 1.1algebra

The bracket formula in [F1] gives [Qα,Q‾β˙]=Pαβ˙. Because both entries are odd, graded skew symmetry makes this bracket symmetric; in a graded associative representation [F3] identifies it with the anticommutator. Same-chirality odd brackets vanish and translations commute by the definition in [F1].

3.1givenF1F4step 1.1algebra∎

Let σ0=I, σ1=(0110), σ2=(0−ii0), and σ3=(100−1). Direct multiplication gives tr⁡(σμσν)=2δμν, so τμ=σμ/2 is trace-dual to the four σν. The trace-pairing identity makes the σμ linearly independent; since a 2×2 matrix has four entries, they form a basis of M2(C). Regard P=(Pαβ˙) as a matrix with entries in V, and define Pμ=(2i)−1tr⁡(τμP). The dual-basis expansion gives P=∑μσμtr⁡(τμP)=2i∑μσμPμ. This is an invertible coordinate change followed by multiplication by the nonzero scalar (2i)−1, so the Pμ form a basis of translations and the displayed normalization follows. The dotted bar on Q‾ is a chiral label, not complex conjugation. This algebraic normalization supplies no real form, positive-energy representation, or field-theoretic off-shell closure.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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