arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.01264quant-phhep-thmath-phmath.MP
收藏

一般排序定理

General ordering theorem

Luca Ferialdi

AI总结:

本文证明了General Ordering Theorem(GOT),建立了任意算符排序间的一般转换关系,并展示了其通过特例恢复Magnus展开与BCH公式且提供紧凑表达式的潜力。

摘要:

自量子力学创立以来,算符排序问题一直困扰着该领域。人们已经设计出几种排序方式,但至今仍缺乏一种在不同排序之间进行转换的系统化程序。建立不同排序之间关系的重要性可由Wick定理(它将时间排序与正规排序联系起来)来证明,该定理在量子场论的发展中发挥了关键作用。我们证明了General Ordering Theorem(GOT),该定理在作用于满足一般(即算符)对易关系的算符时,建立了任意一对排序之间的关系。我们通过简单示例阐明了GOT的工作原理,并通过将两个著名的代数定理作为特例进行恢复来展示其潜力:Magnus展开和Baker-Campbell-Hausdorff公式。值得注意的是,GOT建立了这两个定理之间的形式关系,并为它们提供了紧凑的表达式,这与目前已知且极其复杂的表达式不同。

英文摘要:

The problem of ordering operators has afflicted quantum mechanics since its foundation. Several orderings have been devised, but a systematic procedure to move from one ordering to another is still missing. The importance of establishing relations among different orderings is demonstrated by Wick's theorem (which relates time ordering to normal ordering), which played a crucial role in the development of quantum field theory. We prove the General Ordering Theorem (GOT), which establishes a relation among any pair of orderings, that act on operators satisfying generic (i.e. operatorial) commutation relations. We expose the working principles of the GOT by simple examples, and we demonstrate its potential by recovering two famous algebraic theorems as special instances: the Magnus expansion and the Baker-Campbell-Hausdorff formula. Remarkably, the GOT establishes a formal relation between these two theorems, and it provides compact expressions for them, unlike the notoriously complicated ones currently known.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑