corollaryroutine

Noncoordinate polynomials in every dimension at least four

So for every n≥4n\ge4 some non-coordinate ff has C[z]/(f)≅C[n−1]\CC[z]/(f)\cong\CC^{[n-1]}
payoff of the main theorem
Corollary·cor:dimension·§1 Introduction and statement

Statement (paper)

For every integer n≥4n\ge4, there is a polynomial f∈C[z1,…,zn]f\in\CC[z_1,\ldots,z_n] such that C[z1,…,zn]/(f)≅C[n−1]\CC[z_1,\ldots,z_n]/(f)\cong\CC^{[n-1]} and ff is not a coordinate.

In plain English

For every n≥4n\ge4 there is a polynomial f∈C[z1,…,zn]f\in\CC[z_1,\ldots,z_n] with C[z1,…,zn]/(f)≅C[n−1]\CC[z_1,\ldots,z_n]/(f)\cong\CC^{[n-1]} that is not a coordinate.

Why it's here

This extends the four-variable example of the main theorem to all n≥4n\ge4, so the phenomenon is not confined to one dimension. The natural route is to take the polynomial FF from the main theorem and adjoin extra variables, which keeps the quotient a polynomial ring and keeps ff from being a coordinate.
Classified routine:
Follows from the main theorem by adjoining n−4n-4 variables: the quotient remains a polynomial ring, and the critical point of FF persists, ruling out a coordinate.

Sources

PaperOpen
Section
§1 Introduction and statement
Page
—
Label
cor:dimension
Line
paper.tex:116
Leannot aligned

Phase 2 aligns this node to a Lean declaration.