SWhat changed
Hilbert proved that a system of homogeneous polynomial forms in finitely many variables admits a finite subfamily generating every member by polynomial linear combinations. He supplied a separate integer-coefficient version, proved termination of successive minimal systems of relations in the stated polynomial setting, and applied the finite-basis mechanism together with invariant-producing differential operators to establish finite generation for the classical invariant systems treated in the paper. The argument turned finiteness questions about infinitely many forms into finite algebraic data.
Scientific scope
Hilbert proved that a system of homogeneous polynomial forms in finitely many variables admits a finite subfamily generating every member by polynomial linear combinations. He supplied a separate integer-coefficient version, proved termination of successive minimal systems of relations in the stated polynomial setting, and applied the finite-basis mechanism together with invariant-producing differential operators to establish finite generation for the classical invariant systems treated in the paper. The argument turned finiteness questions about infinitely many forms into finite algebraic data. The original forms are homogeneous and have coefficients in the stated numerical rationality field; integer coefficients require the separate Theorem II proof. Theorem III uses minimal systems of polynomial relations and its own equation-chain indexing: the number-of-variables bound is not asserted for arbitrary coefficient rings or arbitrary nonminimal free complexes. Section V treats the specified full linear transformations of finite form systems; the paper explicitly warns that finite generation for an arbitrary subgroup does not follow. Its invariant projection divides by nonzero positive numerical factors, so no unrestricted positive-characteristic extension is inferred. No efficient degree-bounded algorithm or arbitrary-subalgebra finiteness theorem is claimed.
Evidence
The linked original works support the scoped statement and contribution attribution. WRS has not independently replayed experiments or reconstructed a full mathematical proof. The original forms are homogeneous and have coefficients in the stated numerical rationality field; integer coefficients require the separate Theorem II proof. Theorem III uses minimal systems of polynomial relations and its own equation-chain indexing: the number-of-variables bound is not asserted for arbitrary coefficient rings or arbitrary nonminimal free complexes. Section V treats the specified full linear transformations of finite form systems; the paper explicitly warns that finite generation for an arbitrary subgroup does not follow. Its invariant projection divides by nonzero positive numerical factors, so no unrestricted positive-characteristic extension is inferred. No efficient degree-bounded algorithm or arbitrary-subalgebra finiteness theorem is claimed.
Contributors
- The named authors in the research record · SCIENCE: Source-listed authors for the exact contribution; experimental subjects are not autonomous scientific authors. Source support and predecessor work retain separate roles. Individual effort shares and unresolved identities are not inferred.
Provisional WRS assessment, edition 2026-10-23.3. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction