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 be integers and let be a real symmetric matrix. A vector-spin configuration is a matrix whose rows are unit vectors for the Euclidean inner product: . Its signed vector-spin objective is . The entries of may have either sign.
The Gram matrix of the configuration is , with . A real symmetric matrix is positive semidefinite if for every . The factor has at most columns; using with unit rows of as a parametrization of a positive semidefinite matrix variable with diagonal entries one is a Burer–Monteiro factorization. It imposes the rank bound .
Identify matrices with by listing their entries. The feasible set is , with the relative Euclidean topology and the smooth structure of the regular level set of , , at . Its dimension is and its tangent space is . The objective is smooth in this structure.
A feasible is a local minimum of when there is such that for every feasible with . A local maximum reverses the inequality; a local extremum is either. A critical point is a feasible for which the differential is the zero linear functional. For , is discrete with zero-dimensional tangent spaces: every configuration is critical and is both a local minimum and a local maximum.
Definition references
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
Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes
Row space, column space, nullspace, row rank, column rank and matrix rank
The trace tr(A) as the sum of the diagonal entries
Embedded submanifolds and slice charts
A regular level set is an embedded submanifold
Slice-chart restrictions form a smooth atlas
The tangent space to a regular level set
Cʳ and smooth maps between smooth manifolds
Cᵏ maps and multi-index derivative notation in Euclidean space
Identity maps and composites of smooth maps are smooth
Critical points and critical values of a smooth function
The differential of a smooth real-valued function
The tangent space of a regular level set is the kernel
Facts & Assumptions
Given: The integers , symmetric matrix , unit-row matrix , and in the Definition.
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 and a real-valued array , (∑_i ∈ S∑j ∈ T aᵢⱼ = ∑(i,j) ∈ S × T aᵢⱼ = ∑_j ∈ T∑_i ∈ S aᵢⱼ for finite index sets S and T).
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).
Matrix rank is row-space dimension; row rank equals column rank. A subspace has dimension at most that of its finite-dimensional ambient space, and has dimension (Row space, column space, nullspace, row rank, column rank and matrix rank, Row rank equals column rank, and both equal the number of pivots, If dim_F V = n and U is a linear subspace of V, then U is finite-dimensional, dim_F U ≤ n, and dim_F U = n if and only if U = V, The standard list e : n → Fⁿ with eᵢ(i) = 1_F and eᵢ(j) = 0_F for j ≠ i is an ordered basis of Fⁿ; hence dim_F Fⁿ = n, and F⁰ is the zero space with basis ∅ and dimension 0).
For an matrix , its transpose has shape and entries (The transpose A^T of a matrix).
The Euclidean metric topology has balls as neighbourhoods, and the relative topology consists of intersections with ambient open sets (The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
Euclidean regularity means existence and continuity of the iterated coordinate partial derivatives; smoothness means this for every finite , 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).
A nonempty regular fibre of a smooth map from an -manifold to a -manifold is an embedded manifold of dimension (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).
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).
If is smooth, is a regular value and , the intrinsic tangent space of the embedded fibre is identified with in (The tangent space of a regular level set is the kernel). At , the canonical identification sends to the derivation (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 , so is symmetric and . For any , ; hence is positive semidefinite. [given, F1, F2, F4, algebra]
1.2 Each row of is a linear combination of the rows of . The row space of is therefore a subspace of the row space of . By equality of row and column ranks, the latter has dimension equal to the dimension of the column space of , a subspace of ; its dimension is at most . Thus . [given, F1, F3, F4, algebra]
1.3 Each component is smooth: its first coordinate partials are in row 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 . The fibre over is exactly and is nonempty, since every row can be . At a point of this fibre and for any , the choice gives . By the Euclidean identifications and coordinate differential formula in [F9], 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 . 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, is an embedded smooth manifold of dimension , with the relative Euclidean topology and the restricted slice-chart atlas. Apply [F9] to the smooth map and its regular value established in step 1.3: the intrinsic tangent space of this embedded fibre is identified with . Under the canonical Euclidean tangent identifications, the coordinate formula in [F9] represents by the already computed , so this intrinsic tangent space is represented by exactly the matrices with for every . This also identifies it with the ambient constraint-kernel definition in [F7]. The squared Euclidean distance of the listed entries is , 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, is a quadratic polynomial in the entries of , 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 its coordinate expression is the composite of this ambient polynomial with the smooth inverse ambient chart and the linear slice inclusion . This composite is smooth, so is smooth on and the critical-point definition in [F8] applies. [F1, F4, F6, F7, F8, step 2.1, step 2.2, algebra]
4.1 When , the row equations are , hence . Distinct configurations have squared Euclidean distance at least , so the relative ball of radius about any configuration contains only that configuration. Both local-extremum inequalities thus hold there. The tangent equations force every ; 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
- The Gram matrix G(v₀,…,vᵣ₋₁)=(⟨ vᵢ,vⱼ⟩)_i,j<r and Gram determinant, with empty value 1
- Row space, column space, nullspace, row rank, column rank and matrix rank
- The Euclidean inner product ⟨ x,y⟩ = ∑_k<n xₖ yₖ on ℝⁿ
- The trace tr(A) as the sum of the diagonal entries
- Rectangular matrix multiplication and the identity matrix Iₙ, including zero-sized shapes
- Laws of finite sums and finite products
- ∑_i ∈ S∑_j ∈ T aᵢⱼ = ∑_(i,j) ∈ S × T aᵢⱼ = ∑_j ∈ T∑_i ∈ S aᵢⱼ for finite index sets S and T
- Row rank equals column rank, and both equal the number of pivots
- If dim_F V = n and U is a linear subspace of V, then U is finite-dimensional, dim_F U ≤ n, and dim_F U = n if and only if U = V
- The standard list e : n → Fⁿ with eᵢ(i) = 1_F and eᵢ(j) = 0_F for j ≠ i is an ordered basis of Fⁿ; hence dim_F Fⁿ = n, and F⁰ is the zero space with basis ∅ and dimension 0
- The transpose A^T of a matrix
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace
- Embedded submanifolds and slice charts
- A regular level set is an embedded submanifold
- Slice-chart restrictions form a smooth atlas
- The tangent space to a regular level set
- Cʳ and smooth maps between smooth manifolds
- Cᵏ maps and multi-index derivative notation in Euclidean space
- If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative
- Identity maps and composites of smooth maps are smooth
- Critical points and critical values of a smooth function
- The differential of a smooth real-valued function
- The tangent space of a regular level set is the kernel
- The tangent space of Euclidean space
- Coordinate formula for the differential
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.