Search arXivSearch

arXiv · 1210.1284

Factorization from an order-theoretic view 1&2

Abstract

Drawing inspiration from Emmy Noether'set-theoretic foundations for algebra and Charles Ehresmann's topology without points, we adopt a new order-theoretic approach to ideal theory. For this we emphasize the order of divisibility in factorization and use it as a medium for relating algebra to topology 1. Replacing principal ideals and their intersections by equivalence classes and their collections respectively, we transform integral divisorial ideals into B-ideals in order to provide an order-theoretic frame for treating decomposition dispensing with addition. The idea of a B-ideal is connected closely with generalized-algebraicty originated from semantics for programme languages. 2. Since B-ideals constitute a complete lattice, we can utilize the fact that decomposition, which means that each element can be decomposed into the join of all elements way-below it, is equivalent to complete distributivity. B-ideals with decomposition theorems in themselves do not depend on algebraic structures and can be applied to any poset 3. Closed-set lattice is cotopology based on multiplication and independent of a partioular prime in the sense of pointless topology by Ehresmann. It differs from Zariski topology in using prime-powers rather than primes so that multiplicity in algebra acquires geometric meaning. 4. Factorial group is also a free module with multiplication instead of addition. Hence poset-theoretic constructions have corresponding algebraic analoques. They are introduced based on Noether's set-theoretic approach but quotient is within like a subset rather than outside.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zike Deng. 2012-10-04. Factorization from an order-theoretic view 1&2. https://arxiv.org/abs/1210.1284

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC