Re: Proving something is an affine variety




ngr wrote:
Question: Prove that a single point (a1,...,an) E k^n is an affine variety.

How would I go about doing this? I can't really think of how to do it properly.

(a1,...,an) is an arbitrarily chosen point, and I believe that there must be a function that equals 0 at that point - a function that is also a zero polynomial would work, or a function that is just f(a1,...,an) = 0, the zero function. If there is at least one function f where f(a1,...,an)=0, then (a1,...,an) can be considered an affine variety, correct? I guess my biggest problem is I don't know how to prove that there will always be a function that is zero at (a1,...,an), other than stating f(a1,...,an)=0 is always a possible function.

Ideas? Suggestions to put me on the right track? Thanks!

You need to come up with a finite set of polynomials such that the only
point satisfying those polynomials is (a_1,...,a_n). This is easy:
x_1=a_1, x_2=a_2, ... x_n=a_n. Some definitions of affine variety also
require that affine varieties be irreducible, but irreducibility is
trivial in this case.

.



Relevant Pages

  • Re: Help proving lemma about the roots of a polynomial
    ... However his suggested proof of the left-hand inequality yields me only ... 39 of a book by Marden called "Geometry of Polynomials" to which I ... You never mentioned degrees or irreducibility. ... coefficients and irreducibility, ...
    (sci.math)
  • Re: Is this polynomial irreducible?
    ... The papers reference the work of Schur. ... Filaseta, Michael; Williams, Richard L., Jr. ... On the irreducibility of a certain class of Laguerre polynomials. ...
    (sci.math)
  • Re: irreducible polynomial in integrand
    ... it as a partial fraction, ... the rationals) of the polynomials are all twos and threes. ... irreducibility is over the real numbers, ... triangle whose apex angle is 108 degrees and whose other angles are ...
    (sci.math)
  • Re: Irreducibility
    ... these should be polynomials without roots ... The proof is an easy exercise using only basic properties of finite fields. ... Note that this practical polynomial irreducibility test is an analog of the ... of finite fields to cryptography, etc., e.g. see the Math Review below. ...
    (sci.math)
  • Re: algebraic integers - logarithmic expression
    ... |let Pbe the set of all irreducible monic polynomials with integer ... such that all roots are of modulus less than d. ... |zero and hence has a limit. ... By Eisenstein's irreducibility criterion ...
    (sci.math.research)