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

A subcritical planar cubic Hopf bifurcation

Example

Consider x˙=μx−y+x(x2+y2),y˙=x+μy+y(x2+y2). This has the same eigenvalue crossing as the preceding cubic example but the opposite first Lyapunov sign.

Facts & Assumptions

Given: The polynomial vector field in the Example, ω0=1, and the normalization q∗q=p∗q=1.

[F1]

Hopf spectral and multilinear normal-form data: ℓ1=Re⁡G21/(2ω0) with the displayed normalized eigenvectors.

[F2]

A simple nondegenerate Hopf point creates a local periodic branch: a simple crossing with ℓ1≠0 has its local cycle on βℓ1<0; radial stability requires β>0.

Verification

1.1givenalgebra

The origin is an equilibrium and A(μ)=[μ−11μ] has eigenvalues μ±i. Hence β′(0)=1 and there is no transverse spectrum.

1.2F1givenalgebra

With q=p=(1,−i)T/2, B=0. The cubic vector field is ∥(x,y)∥2(x,y), so C(u,v,w)=2((u⋅v)w+(u⋅w)v+(v⋅w)u). Since q⋅q=0 and q⋅qˉ=1, C(q,q,qˉ)=4q and G21=4.

2.1F1F2step 1.1step 1.2algebra

Thus ℓ1=2>0, and [F2] gives a small branch only for μ<0; its radial multiplier is unstable because β<0.

3.1step 1.1algebra∎

Directly, polar coordinates give R˙=μR+R3 and θ˙=1. At μ<0, R=−μ is a radial equilibrium with derivative μ+3R2=−2μ>0, so the periodic orbit is unstable.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 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