Blog Archive

Tuesday, December 3, 2024

An Analogy Between Integer Factorization and Decomposition in Noetherian Spaces

 

Definition. A topology space X is called Noetherian if it satisfies the descending chain condition for closed subsets: for any for any sequence Y1⊇Y2... of closed subset Yi of X, there is an integer m such that Ym=Ym+1=...

Remark. By definition, for a Noetherian ring R, Spec(R)​​ is Noetherian.

Recall tha a topology space Y is called irreducible if Y=Y1∪Y2⟹Y1=Y or Y2=Y for any closed set Y1,Y2​.

This property looks like prime number and we know that on affine scheme, V(I) is irreducible iff I 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 X is the maximal irreducible set, whcih is closed, since

U is irreducible iff U― is irreducible.

Proposition. In a Noetherian space X, every closed subset Y can be expressed as finite union Y=⋃i=1nYi 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 V(ab)=V(a)∪V(b)​ and treat irreducible component as prime number. Recall that p is prime if p|ab implies p|a or p|b.

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 S⊆N 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 S be the set of nonempty closed subsets of Y whcih can not be written as a finite union of irreducibe components.

Since N is well ordered, then we could find the minimal of S, denote as m

Since X is Noetherian space, by axiom of choice, we can find a minimal element of S denote as T.

Then we could find two nonprime numbers a,b and ab=m. But since a,b<m, a,b is the product of prime number, hence m is the product of prime number, therefore S=∅.

Then we could find two proper closed subset of T such that T1∪T2=T. If we could not, then T=∅∪T is the unique way to decompose T to two closed subsets, but that means T is irreducible but T is not irreducible since T is not finite union of irreducible components. But T1,T2⊂T⟹T1,T2 is union of irreducible components, hence T is union of irreducible components, hence S=∅.

Now let us proof the uniqueness.

Let p1...pn=q1...qm be two prime factorizations. Then p1 divides the right side, hence p1|qi for some i. Since both are prime, p1=q1. Cancel them and continue by induction.

Let Y=Y1∪Y2∪...∪Yn=Z1∪Z2∪...∪Zm, then Yi=Yi∩Y=Yi∩⋃j=1mZj=⋃j=1m(Yi∩Zj). But Yi is irreducible, hence Yi=Yi∩Zj for a j hence Yi⊆Zj, but Yi is irreducible component, which means it is maximal, hence Yi=Zj. ◻

 

 

No comments:

Post a Comment

Popular Posts