Alphabeta Math
DefinitionDefinition: AI-generatedProof: AI-generated
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.

Signed vector-spin objectives and low-rank Gram factors

Definition

Let n,r≥1 be integers and let B=(Bij) be a real symmetric n×n matrix. A vector-spin configuration is a matrix Y∈Rn×r whose rows u1,…,un∈Rr are unit vectors for the Euclidean inner product: ui⋅ui=1. Its signed vector-spin objective is FB(Y)=Tr⁡(YTBY). The entries of B may have either sign.

The Gram matrix of the configuration is X=YYT, with Xij=ui⋅uj. A real symmetric matrix X is positive semidefinite if cTXc≥0 for every c∈Rn. The factor Y has at most r columns; using X=YYT with unit rows of Y as a parametrization of a positive semidefinite matrix variable with diagonal entries one is a Burer–Monteiro factorization. It imposes the rank bound rank⁡X≤r.

Identify matrices with Rnr by listing their entries. The feasible set is Mn,r={Y∈Rn×r:ui⋅ui=1 for every i}, with the relative Euclidean topology and the smooth structure of the regular level set of Q:Rnr→Rn, Q(Y)=(ui⋅ui)i=1n, at (1,…,1). Its dimension is n(r−1) and its tangent space is TYMn,r={V=(vi)i=1n:ui⋅vi=0 for every i}. The objective is smooth in this structure.

A feasible Y is a local minimum of FB when there is ε>0 such that FB(Y)≤FB(Z) for every feasible Z with ∑i=1n∑a=1r(Zia−Yia)2<ε2. A local maximum reverses the inequality; a local extremum is either. A critical point is a feasible Y for which the differential d(FB)Y:TYMn,r→R is the zero linear functional. For r=1, Mn,1={−1,1}n is discrete with zero-dimensional tangent spaces: every configuration is critical and is both a local minimum and a local maximum.

Definition references

Facts & Assumptions

Given: The integers n,r, symmetric matrix B, unit-row matrix Y, and X=YYT in the Definition.

[F1]

Matrix multiplication is defined by finite sums of products of entries, and the trace is the sum of diagonal entries (Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes, The trace tr(A) as the sum of the diagonal entries). Finite sums are additive and admit scalar factors (Laws of finite sums and finite products). For finite sets S,T and a real-valued array a:S×T→R, ∑i∈S∑j∈Taij=∑j∈T∑i∈Saij (∑_i ∈ S∑j ∈ T aᵢⱼ = ∑(i,j) ∈ S × T aᵢⱼ = ∑_j ∈ T∑_i ∈ S aᵢⱼ for finite index sets S and T).

[F2]

The Euclidean dot product is the sum of coordinate products and is nonnegative on a vector paired with itself; the Gram matrix records pairwise inner products (The Euclidean inner product ⟨ x,y⟩ = ∑_k<n xₖ yₖ on ℝⁿ, The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1).

[F4]

For an m×k matrix A, its transpose AT has shape k×m and entries (AT)ji=Aij (The transpose A^T of a matrix).

[F6]

Euclidean Ck regularity means existence and continuity of the iterated coordinate partial derivatives; smoothness means this for every finite k, componentwise in Euclidean coordinates and in charts (Cᵏ maps and multi-index derivative notation in Euclidean space, Cʳ and smooth maps between smooth manifolds). Continuous partial derivatives give the total derivative with the Jacobian matrix (If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative). Composites of smooth maps are smooth (Identity maps and composites of smooth maps are smooth).

[F7]

A nonempty regular fibre of a smooth map from an m-manifold to a k-manifold is an embedded manifold of dimension m−k (A regular level set is an embedded submanifold). Embedded submanifolds carry the relative topology and the smooth atlas obtained by restricting slice charts (Embedded submanifolds and slice charts, Slice-chart restrictions form a smooth atlas). For a regular fibre in Euclidean space its tangent space is the kernel of the constraint derivative (The tangent space to a regular level set).

[F8]

For a smooth real-valued function, the differential at a point is a linear functional on its tangent space, and the point is critical when that functional is zero (The differential of a smooth real-valued function, Critical points and critical values of a smooth function).

[F9]

If F:M→N is smooth, q is a regular value and p∈F−1(q), the intrinsic tangent space of the embedded fibre is identified with ker⁡dFp in TpM (The tangent space of a regular level set is the kernel). At a∈Rk, the canonical identification TaRk≅Rk sends w to the derivation [g]↦∑jwj∂jg(a) (The tangent space of Euclidean space). In coordinate tangent bases the differential of a smooth map is represented by the Jacobian of its coordinate expression (Coordinate formula for the differential).

Justification

Given: The data and facts above.

Goal: Establish the stated Gram properties, objective identity, feasible smooth structure and rank-one boundary case.

1.1 Entrywise multiplication gives Xij=∑a=1rYiaYja=ui⋅uj, so X is symmetric and Xii=1. For any c∈Rn, cTXc=∑a=1r(∑i=1nciYia)2≥0; hence X is positive semidefinite. [given, F1, F2, F4, algebra]

1.2 Each row of X=Y(YT) is a linear combination of the r rows of YT. The row space of X is therefore a subspace of the row space of YT. By equality of row and column ranks, the latter has dimension equal to the dimension of the column space of YT, a subspace of Rr; its dimension is at most r. Thus rank⁡X≤r. [given, F1, F3, F4, algebra]

1.3 Each component Qi(Y)=∑aYia2 is smooth: its first coordinate partials are 2Yia in row i and zero in other rows, its second partials are constants, and all partials of order at least three vanish. These functions are continuous. Its total derivative is consequently DQ(Y)V=(2ui⋅vi)i=1n. The fibre over (1,…,1) is exactly Mn,r and is nonempty, since every row can be (1,0,…,0). At a point of this fibre and for any b∈Rn, the choice vi=(bi/2)ui gives DQ(Y)V=b. By the Euclidean identifications and coordinate differential formula in [F9], dQY is consequently surjective at every point of this fibre. Thus this is a regular fibre. [given, F2, F6, F9, algebra, construct]

2.1 Expanding the trace and rearranging the finite sums yields Tr⁡(YTBY)=∑a=1r∑i,j=1nYiaBijYja=∑i,j=1nBij(ui⋅uj). This proves the objective identity and the stated Gram properties. [given, F1, F2, F4, step 1.1, step 1.2, algebra]

2.2 By the regular-fibre theorem, Mn,r is an embedded smooth manifold of dimension nr−n=n(r−1), with the relative Euclidean topology and the restricted slice-chart atlas. Apply [F9] to the smooth map Q:Rnr→Rn and its regular value (1,…,1) established in step 1.3: the intrinsic tangent space of this embedded fibre is identified with ker⁡dQY. Under the canonical Euclidean tangent identifications, the coordinate formula in [F9] represents dQY by the already computed DQ(Y), so this intrinsic tangent space is represented by exactly the matrices V with ui⋅vi=0 for every i. This also identifies it with the ambient constraint-kernel definition in [F7]. The squared Euclidean distance of the listed entries is ∑i,a(Zia−Yia)2, so the local-extremum definitions use neighbourhoods in precisely this relative topology. [F2, F5, F7, F9, step 1.3, algebra]

3.1 On the ambient matrix space, Tr⁡(ZTBZ) is a quadratic polynomial in the entries of Z, by the same expansion as step 2.1; its coordinate partials of order at least three vanish and its lower partials are continuous. It is therefore smooth. In a restricted slice chart of Mn,r its coordinate expression is the composite of this ambient polynomial with the smooth inverse ambient chart and the linear slice inclusion x↦(x,0). This composite is smooth, so FB is smooth on Mn,r and the critical-point definition in [F8] applies. [F1, F4, F6, F7, F8, step 2.1, step 2.2, algebra]

4.1 When r=1, the row equations are ui2=1, hence ui∈{−1,1}. Distinct configurations have squared Euclidean distance at least 4, so the relative ball of radius 1 about any configuration contains only that configuration. Both local-extremum inequalities thus hold there. The tangent equations uivi=0 force every vi=0; the differential on this zero vector space is necessarily zero. Thus every rank-one configuration is critical as asserted. [given, F2, F5, F8, step 2.2, step 3.1, algebra] ∎

Remarks

A landscape is the behavior of an objective on its feasible configurations, including its local extrema and critical points in the topology and smooth structure specified above. This definition alone makes no assertion about those points or about statistical recovery. Such assertions require a separately specified model and hypotheses; signed weights do not automatically satisfy inequalities proved for nonnegative weights.

Depends on

Used by · 4

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.