Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passjudge 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.

Positive N=4 scalar potential for two noncommuting SU(2) fields

Physical scope

A finite-dimensional classical field-value calculation in the adopted N=4 SU(2) scalar potential; it is not a field solution or empirical claim.

Example

For real a,b∈R with units m−1, take canonical adjoint scalar values Xcan1=aT1, Xcan2=bT2, and XcanI=0 for I=3,4,5,6, where Ta=−iσa/2 and σ1=(0110),σ2=(0−ii0),σ3=(100−1). If a,b≠0, the adopted N=4 scalar potential is g2a2b2/2>0; if either coefficient is zero, it is zero.

Facts & Assumptions

Given: The N=4 canonical scalar potential, the SU(2) basis, and its normalized Lie bracket and invariant form.

[A1]

Four-dimensional N=4 SU(2) super-Yang-Mills model: V=g22∑I<Jκ([XcanI,XcanJ],[XcanI,XcanJ]).

[F1]

Classical pure SU(2) Yang–Mills model: κ(T3,T3)=1.

Verification

Given: [A1], [F1], and g>0.

1.1givenA1algebra

Direct multiplication gives σ1σ2=(i00−i)=iσ3 and σ2σ1=−iσ3. Therefore [T1,T2]=(−i/2)2(σ1σ2−σ2σ1)=T3, so [Xcan1,Xcan2]=abT3; every other commutator in the sum contains a zero field.

2.1givenA1F1step 1.1algebra∎

Substitution into [A1] yields V=g22a2b2κ(T3,T3)=g2a2b22. Since g>0, this is positive exactly when both a and b are nonzero, and the formula gives zero on either zero-coefficient boundary.

Depends on

Dependency tree · 2 levels