积分域上多项式上升和下降半星运算

A. Okabe
{"title":"积分域上多项式上升和下降半星运算","authors":"A. Okabe","doi":"10.5036/MJIU.42.3","DOIUrl":null,"url":null,"abstract":"In 1994, A. Okabe and R. Matsuda introduced the notion of a semistar operation in [OM] as a generalization of the notion of a star operation which was introduced in 1936 by W. Krull and was developed in [G] by R. Gilmer. In 2000, M. Fontana and J.A. Huckaba investigated the relation between semistar operations and localizing systems and they associated the semistar operation ∗F for each localizing system F on D and the localizing system F∗ for each semistar operation ∗ on D. Using these correspondences, they established a very natural bridge between semistar operations and localizing systems which has been proven to be a very important and essential tool in the study of semistar operation theory. Let D be an integral domain with quotient field K and let D[X] be the ring of polynomials over D in indeterminate X. We shall denote the set of all semistar operations on D (resp. D[X]) by SS(D) (resp. SS(D[X])) as in [O5]. We have much interest in considering the relation between SS(D) and SS(D[X]). First, in [OM], a correspondence ∗ 7→ ∗′ from SS(D[X]) into SS(D) was given by setting E∗ ′ = (ED[X])∗ ⋂ K for each nonzero D-submodule E of K. In this paper, this semistar operation ∗′ is called the polynomial descent semistar operation associated to ∗ and is denoted by ∗. Next, in [P3], G. Picozza defined a reverse correspondence ∗ 7→ ∗′ from SS(D) into SS(D[X]) by setting ∗′ = ∗F∗[X] for each ∗ ∈ SS(D). In this paper, this semistar operation ∗′ is called the polynomial ascent semistar operation associated to ∗ and is denoted by ∗. Thus we have two correspondences between SS(D) and SS(D[X]). The purpose of this paper is to investigate the relation between SS(D) and SS(D[X]) using these two semistar operations ∗ and ∗. In Section 1, we first recall some well-known results on semistar operations and localizing systems on an integral domain D which will be used in sequel and we shall show some new results concerning semistar operations [∗] and ∗a which were introduced in [FL1]. In Section 2, we shall prove some important properties of semistar operations ∗ and ∗. In Theorem 27, we show that (∗) = ∗̄ for each semistar operation ∗ on D","PeriodicalId":18362,"journal":{"name":"Mathematical Journal of Ibaraki University","volume":"89 1","pages":"3-16"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On polynomial ascent and descent semistar operations on an integral domain\",\"authors\":\"A. Okabe\",\"doi\":\"10.5036/MJIU.42.3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In 1994, A. Okabe and R. Matsuda introduced the notion of a semistar operation in [OM] as a generalization of the notion of a star operation which was introduced in 1936 by W. Krull and was developed in [G] by R. Gilmer. In 2000, M. Fontana and J.A. Huckaba investigated the relation between semistar operations and localizing systems and they associated the semistar operation ∗F for each localizing system F on D and the localizing system F∗ for each semistar operation ∗ on D. Using these correspondences, they established a very natural bridge between semistar operations and localizing systems which has been proven to be a very important and essential tool in the study of semistar operation theory. Let D be an integral domain with quotient field K and let D[X] be the ring of polynomials over D in indeterminate X. We shall denote the set of all semistar operations on D (resp. D[X]) by SS(D) (resp. SS(D[X])) as in [O5]. We have much interest in considering the relation between SS(D) and SS(D[X]). First, in [OM], a correspondence ∗ 7→ ∗′ from SS(D[X]) into SS(D) was given by setting E∗ ′ = (ED[X])∗ ⋂ K for each nonzero D-submodule E of K. In this paper, this semistar operation ∗′ is called the polynomial descent semistar operation associated to ∗ and is denoted by ∗. Next, in [P3], G. Picozza defined a reverse correspondence ∗ 7→ ∗′ from SS(D) into SS(D[X]) by setting ∗′ = ∗F∗[X] for each ∗ ∈ SS(D). In this paper, this semistar operation ∗′ is called the polynomial ascent semistar operation associated to ∗ and is denoted by ∗. Thus we have two correspondences between SS(D) and SS(D[X]). The purpose of this paper is to investigate the relation between SS(D) and SS(D[X]) using these two semistar operations ∗ and ∗. In Section 1, we first recall some well-known results on semistar operations and localizing systems on an integral domain D which will be used in sequel and we shall show some new results concerning semistar operations [∗] and ∗a which were introduced in [FL1]. In Section 2, we shall prove some important properties of semistar operations ∗ and ∗. In Theorem 27, we show that (∗) = ∗̄ for each semistar operation ∗ on D\",\"PeriodicalId\":18362,\"journal\":{\"name\":\"Mathematical Journal of Ibaraki University\",\"volume\":\"89 1\",\"pages\":\"3-16\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Journal of Ibaraki University\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5036/MJIU.42.3\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Journal of Ibaraki University","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5036/MJIU.42.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

1994年,a . Okabe和R. Matsuda在[OM]中引入了半星形运算的概念,作为对1936年由W. Krull提出并由R. Gilmer在[G]中发展的星形运算概念的推广。2000年,M. Fontana和J.A. Huckaba研究了半星运算和定位系统之间的关系,并将D上每一个定位系统F的半星运算∗F和D上每一个半星运算∗的定位系统F∗联系起来。利用这些对应关系,他们在半星运算和定位系统之间建立了一座非常自然的桥梁,这已被证明是半星运算理论研究中非常重要和必不可少的工具。设D是一个有商域K的积分定义域,设D[X]是不定X中D上的多项式环。我们将表示D上所有半星运算的集合。D[X])由SS(D)(代表)SS(D[X])),如[5]。我们很有兴趣考虑SS(D)和SS(D[X])之间的关系。首先,在[OM]中,对于K的每个非零D子模E,通过设E∗' = (ED[X])∗K,给出了从SS(D[X])到SS(D)的对应关系∗7→∗'。在本文中,这种半星运算∗'称为与∗相关的多项式下降半星运算,用∗表示。接着,在[P3]中,G. Picozza定义了从SS(D)到SS(D[X]的反向对应(∗7→∗'),方法是对每个∗∈SS(D)设∗' =∗F∗[X]。在本文中,这个半星运算* '被称为与*相关的多项式上升半星运算,并用*表示。因此,我们在SS(D)和SS(D[X])之间有两个对应关系。本文的目的是研究SS(D)和SS(D[X])之间的关系,使用这两个半星运算∗和∗。在第1节中,我们首先回顾一些关于积分域D上半星运算和定域系统的著名结果,这些结果将在后续中使用,并且我们将展示在[FL1]中引入的关于半星运算[∗]和* a的一些新结果。在第2节中,我们将证明半星运算∗和∗的一些重要性质。在定理27中,我们证明了对于D上的每一个半星操作*,(∗)=∗
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On polynomial ascent and descent semistar operations on an integral domain
In 1994, A. Okabe and R. Matsuda introduced the notion of a semistar operation in [OM] as a generalization of the notion of a star operation which was introduced in 1936 by W. Krull and was developed in [G] by R. Gilmer. In 2000, M. Fontana and J.A. Huckaba investigated the relation between semistar operations and localizing systems and they associated the semistar operation ∗F for each localizing system F on D and the localizing system F∗ for each semistar operation ∗ on D. Using these correspondences, they established a very natural bridge between semistar operations and localizing systems which has been proven to be a very important and essential tool in the study of semistar operation theory. Let D be an integral domain with quotient field K and let D[X] be the ring of polynomials over D in indeterminate X. We shall denote the set of all semistar operations on D (resp. D[X]) by SS(D) (resp. SS(D[X])) as in [O5]. We have much interest in considering the relation between SS(D) and SS(D[X]). First, in [OM], a correspondence ∗ 7→ ∗′ from SS(D[X]) into SS(D) was given by setting E∗ ′ = (ED[X])∗ ⋂ K for each nonzero D-submodule E of K. In this paper, this semistar operation ∗′ is called the polynomial descent semistar operation associated to ∗ and is denoted by ∗. Next, in [P3], G. Picozza defined a reverse correspondence ∗ 7→ ∗′ from SS(D) into SS(D[X]) by setting ∗′ = ∗F∗[X] for each ∗ ∈ SS(D). In this paper, this semistar operation ∗′ is called the polynomial ascent semistar operation associated to ∗ and is denoted by ∗. Thus we have two correspondences between SS(D) and SS(D[X]). The purpose of this paper is to investigate the relation between SS(D) and SS(D[X]) using these two semistar operations ∗ and ∗. In Section 1, we first recall some well-known results on semistar operations and localizing systems on an integral domain D which will be used in sequel and we shall show some new results concerning semistar operations [∗] and ∗a which were introduced in [FL1]. In Section 2, we shall prove some important properties of semistar operations ∗ and ∗. In Theorem 27, we show that (∗) = ∗̄ for each semistar operation ∗ on D
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信