An Analogy Between Integer Factorization and Decomposition in Noetherian Spaces
Definition. A topology space is called Noetherian if it satisfies the descending chain condition for closed subsets: for any for any sequence of closed subset of , there is an integer such that
Remark. By definition, for a Noetherian ring , is Noetherian.
Recall tha a topology space is called irreducible if or for any closed set .
This property looks like prime number and we know that on affine scheme, is irreducible iff is prime ideal.
A subset of a topological space is called irreducible if it is irreducible resepct to the subspace topology.
Recall that irreducible component of a topological space is the maximal irreducible set, whcih is closed, since
is irreducible iff is irreducible.
Proposition. In a Noetherian space X, every closed subset can be expressed as finite union of irreducible component, and this decomposition is unique.
The proof will looks similar to the proof of the fundamental theorem of arithmetic. Readers should image that as product since and treat irreducible component as prime number. Recall that is prime if implies or .
Let's draw a parallel proof of this proposition and the fundamental theorem of arithmetic.
Proof.
Let us proof the existence of the decomposition first. Let be the set of the natural number which is not prime and not product of prime.
Let us proof the existence of the decomposition first. Let be the set of nonempty closed subsets of whcih can not be written as a finite union of irreducibe components.
Since is well ordered, then we could find the minimal of , denote as
Since is Noetherian space, by axiom of choice, we can find a minimal element of denote as .
Then we could find two nonprime numbers and . But since , is the product of prime number, hence is the product of prime number, therefore .
Then we could find two proper closed subset of such that . If we could not, then is the unique way to decompose to two closed subsets, but that means is irreducible but is not irreducible since is not finite union of irreducible components. But is union of irreducible components, hence is union of irreducible components, hence .
Now let us proof the uniqueness.
Let be two prime factorizations. Then divides the right side, hence for some . Since both are prime, . Cancel them and continue by induction.
Let , then . But is irreducible, hence for a hence , but is irreducible component, which means it is maximal, hence .
No comments:
Post a Comment