Full-rank polynomial equations for a normalized group neighborhood
ProvedPhilipponMultiplicity.exists_full_rank_normalized_group_equationsLet be an algebraically closed field of characteristic zero, and let be a finite product of embedded commutative algebraic groups. If the projective blocks have dimensions , write
for their homogeneous coordinate tuples. There exist an integer , one pivot in each block, a tuple , and polynomials satisfying the following conditions.
The tuple is a normalized representative of the identity, belongs to the principal open set, and satisfies all equations:
The formal Jacobian at has full row rank. Equivalently, the linear map
is surjective.
The equations give exactly the original group in normalized coordinates on the chosen principal open: for every with ,
if and only if all pivot coordinates of equal one and there is a point with in every block. The pivots ensure that these representatives are nonzero.
This is the smooth local-equation theorem at the group identity in the given embedding. All derivatives in the statement are formal polynomial partial derivatives. No norm, analytic derivative, complementary projection, or analytic chart is assumed; disconnected groups are allowed.
Formalization Note. The geometric reduction proves regularity of the actual homogeneous cone over algebraically closed fields, identifies a principal-open cone neighborhood with genuine group representatives, and appends the normalization equations using the blockwise Euler identity. The sole remaining input is the general regular-point affine Jacobian criterion, which contains no group, projective, or analytic data. The original formal statement is unchanged.
import Definitions.Def_PhilipponMultiplicity_Geometry set_option autoImplicit false open scoped BigOperators
namespace PhilipponMultiplicity
theorem exists_full_rank_normalized_group_equations
(K : Type*) [Field K] [IsAlgClosed K] [CharZero K]
(G : EmbeddedGroupProduct K) :
∃ (r : ℕ)
(c : ∀ i : G.FactorIndex, Fin ((G.factor i).ambientDimension + 1))
(a : G.ambient.Variable → K)
(P : Fin r → G.CoordinateRing) (H : G.CoordinateRing),
(∀ i, a ⟨i, c i⟩ = 1) ∧
(∀ i, ∃ h : (fun j => a ⟨i, j⟩) ≠ 0,
Projectivization.mk K (fun j => a ⟨i, j⟩) h = G.embedding 0 i) ∧
MvPolynomial.eval a H ≠ 0 ∧
(∀ i, MvPolynomial.eval a (P i) = 0) ∧
Function.Surjective (fun v : G.ambient.Variable → K => fun i : Fin r =>
∑ j, MvPolynomial.eval a (MvPolynomial.pderiv j (P i)) * v j) ∧
(∀ v : G.ambient.Variable → K, MvPolynomial.eval v H ≠ 0 →
((∀ i, MvPolynomial.eval v (P i) = 0) ↔
((∀ i, v ⟨i, c i⟩ = 1) ∧
∃ x : G.Point, ∀ i, ∃ h : (fun j => v ⟨i, j⟩) ≠ 0,
Projectivization.mk K (fun j => v ⟨i, j⟩) h = G.embedding x i))) := by sorry
end PhilipponMultiplicity