更改

跳到导航 跳到搜索
删除429字节 、 2020年10月25日 (日) 21:15
第1行: 第1行: −
此词条暂由彩云小译翻译,未经人工整理和审校,带来阅读不便,请见谅。
+
此词条暂由彩云小译翻译,翻译字数共1572,未经人工整理和审校,带来阅读不便,请见谅。
    
{{Refimprove|date=December 2009}}
 
{{Refimprove|date=December 2009}}
第7行: 第7行:  
In physics and probability theory, mean-field theory (aka MFT or rarely self-consistent field theory) studies the behavior of high-dimensional random (stochastic) models by studying a simpler model that approximates the original by averaging over degrees of freedom. Such models consider many individual components that interact with each other. In MFT, the effect of all the other individuals on any given individual is approximated by a single averaged effect, thus reducing a many-body problem to a one-body problem.
 
In physics and probability theory, mean-field theory (aka MFT or rarely self-consistent field theory) studies the behavior of high-dimensional random (stochastic) models by studying a simpler model that approximates the original by averaging over degrees of freedom. Such models consider many individual components that interact with each other. In MFT, the effect of all the other individuals on any given individual is approximated by a single averaged effect, thus reducing a many-body problem to a one-body problem.
   −
在物理学和概率论学中,平均场理论(又称 MFT 或罕见的自洽场理论)通过研究一个更简单的模型来研究高维随机(随机)模型的行为,这个模型通过超过自由度的平均值来近似原始模型。这些模型考虑了许多相互交互的单个组件。在 MFT 中,所有其他个体对任何给定个体的影响都近似于单一平均效应,从而将多体问题降低为一体问题。
+
在物理学和概率论学中,平均场理论(又称 MFT 或罕见的自洽场理论)通过研究一个更简单的模型来研究高维随机(随机)模型的行为,这个模型通过超过自由度的平均来近似原始模型。这些模型考虑了许多相互交互的单个组件。在 MFT 中,所有其他个体对任何给定个体的影响都近似于单一平均效应,从而将多体问题降低为一体问题。
         −
The main idea of MFT is to replace all interactions to any one body with an average or effective interaction, sometimes called a ''molecular field''.<ref>{{cite book|title=Principles of condensed matter physics|last=Chaikin|first=P. M.|last2=Lubensky|first2=T. C.|publisher=Cambridge University Press|year=2007|isbn=978-0-521-79450-3|edition=4th print|location=Cambridge}}</ref> This reduces any multi-body problem into an effective one-body problem. The ease of solving MFT problems means that some insight into the behavior of the system can be obtained at a lower computational cost.
+
The main idea of MFT is to replace all interactions to any one body with an average or effective interaction, sometimes called a ''molecular field''.<ref>{{cite book |title=Principles of condensed matter physics |last1=Chaikin |first1=P. M. |last2=Lubensky |first2=T. C. |publisher=Cambridge University Press |year=2007 |isbn=978-0-521-79450-3 |edition=4th print |location=Cambridge}}</ref> This reduces any many-body problem into an effective one-body problem. The ease of solving MFT problems means that some insight into the behavior of the system can be obtained at a lower computational cost.
   −
The main idea of MFT is to replace all interactions to any one body with an average or effective interaction, sometimes called a molecular field. This reduces any multi-body problem into an effective one-body problem. The ease of solving MFT problems means that some insight into the behavior of the system can be obtained at a lower computational cost.
+
The main idea of MFT is to replace all interactions to any one body with an average or effective interaction, sometimes called a molecular field. This reduces any many-body problem into an effective one-body problem. The ease of solving MFT problems means that some insight into the behavior of the system can be obtained at a lower computational cost.
   −
Mft 的主要思想是用一个平均的或有效的相互作用,有时称为分子场,来代替任何一个物体的所有相互作用。这将任何多体问题降低为一个有效的单体问题。解决 MFT 问题的容易性意味着可以以较低的计算成本获得对系统行为的一些了解。
+
MFT 的主要思想是用一个平均的或有效的相互作用,有时称为分子场,来代替任何一个物体的所有相互作用。这就把任何多体问题转化为有效的单体问题。解决 MFT 问题的容易性意味着可以以较低的计算成本获得对系统行为的一些了解。
         −
MFT has since been applied to a wide range of fields outside of physics, including [[statistical inference]], [[graphical models]], [[neuroscience]], [[artificial intelligence]], [[epidemic model]]s,<ref>{{Cite book|url=http://www.cs.toronto.edu/~marbach/ENS/leboudec.pdf|title=Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)|last1=Boudec|first1=J. Y. L.|last2=McDonald|first2=D.|last3=Mundinger|first3=J.|year=2007|isbn=978-0-7695-2883-0|pages=3|chapter=A Generic Mean Field Convergence Result for Systems of Interacting Objects|doi=10.1109/QEST.2007.8|pmc=|pmid=|citeseerx=10.1.1.110.2612}}</ref> [[queueing theory]],<ref>{{Cite journal|last1=Baccelli|first1=F.|last2=Karpelevich|first2=F. I.|last3=Kelbert|first3=M. Y.|last4=Puhalskii|first4=A. A.|last5=Rybko|first5=A. N.|last6=Suhov|first6=Y. M.|year=1992|title=A mean-field limit for a class of queueing networks|journal=Journal of Statistical Physics|volume=66|issue=3–4|pages=803|bibcode=1992JSP....66..803B|doi=10.1007/BF01055703|pmc=|pmid=}}</ref> [[Network performance|computer network performance]] and [[mean field game theory|game theory]],<ref>{{Cite journal|last1=Lasry|first1=J. M.|last2=Lions|first2=P. L.|authorlink2=Pierre-Louis Lions|year=2007|title=Mean field games|journal=Japanese Journal of Mathematics|volume=2|pages=229–260|doi=10.1007/s11537-007-0657-8|pmc=|pmid=|url=https://basepub.dauphine.fr//bitstream/123456789/2263/1/Cahier_Chaire_2.pdf}}</ref> as in the [[Quantal response equilibrium]].
+
MFT has since been applied to a wide range of fields outside of physics, including [[statistical inference]], [[graphical models]], [[neuroscience]]<ref>{{cite journal |last1=Parr |first1=Thomas |last2=Sajid |first2=Noor |last3=Friston |first3=Karl |title=Modules or Mean-Fields? |journal=Entropy |date=2020 |volume=22 |issue=552 |page=552 |doi=10.3390/e22050552 |url=https://res.mdpi.com/d_attachment/entropy/entropy-22-00552/article_deploy/entropy-22-00552.pdf |accessdate=22 May 2020}}</ref>, [[artificial intelligence]], [[epidemic model]]s,<ref>{{Cite book |url=http://www.cs.toronto.edu/~marbach/ENS/leboudec.pdf |title=Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007) |last1=Boudec |first1=J. Y. L. |last2=McDonald |first2=D. |last3=Mundinger |first3=J. |year=2007 |isbn=978-0-7695-2883-0 |pages=3 |chapter=A Generic Mean Field Convergence Result for Systems of Interacting Objects |doi=10.1109/QEST.2007.8 |pmc= |pmid= |citeseerx=10.1.1.110.2612|s2cid=15007784 }}</ref> [[queueing theory]],<ref>{{Cite journal |last1=Baccelli |first1=F. |last2=Karpelevich |first2=F. I. |last3=Kelbert |first3=M. Y. |last4=Puhalskii |first4=A. A. |last5=Rybko |first5=A. N. |last6=Suhov |first6=Y. M. |year=1992 |title=A mean-field limit for a class of queueing networks |journal=Journal of Statistical Physics |volume=66 |issue=3–4 |pages=803 |bibcode=1992JSP....66..803B |doi=10.1007/BF01055703 |pmc= |pmid=|s2cid=120840517 }}</ref> [[Network performance|computer-network performance]] and [[mean-field game theory|game theory]],<ref>{{Cite journal |last1=Lasry |first1=J. M. |last2=Lions |first2=P. L. |authorlink2=Pierre-Louis Lions |year=2007 |title=Mean field games |journal=Japanese Journal of Mathematics |volume=2 |pages=229–260 |doi=10.1007/s11537-007-0657-8 |pmc= |pmid= |s2cid=1963678 |url=https://basepub.dauphine.fr//bitstream/123456789/2263/1/Cahier_Chaire_2.pdf}}</ref> as in the [[quantal response equilibrium]].
   −
MFT has since been applied to a wide range of fields outside of physics, including statistical inference, graphical models, neuroscience, artificial intelligence, epidemic models, queueing theory, computer network performance and game theory, as in the Quantal response equilibrium.
+
MFT has since been applied to a wide range of fields outside of physics, including statistical inference, graphical models, neuroscience, artificial intelligence, epidemic models, queueing theory, computer-network performance and game theory, as in the quantal response equilibrium.
    
此后,MFT 被广泛应用于物理学以外的领域,包括推论统计学、图形模型、神经科学、人工智能、传染病模型、排队论、计算机网络性能和博弈论,如量子反应均衡。
 
此后,MFT 被广泛应用于物理学以外的领域,包括推论统计学、图形模型、神经科学、人工智能、传染病模型、排队论、计算机网络性能和博弈论,如量子反应均衡。
第29行: 第29行:  
== Origins ==
 
== Origins ==
   −
The ideas first appeared in physics ([[statistical mechanics]]) in the work of [[Pierre Curie]]<ref>{{Cite journal | last1 = Kadanoff | first1 = L. P. | authorlink1 = Leo Kadanoff| title = More is the Same; Phase Transitions and Mean Field Theories | doi = 10.1007/s10955-009-9814-1 | journal = Journal of Statistical Physics | volume = 137 | issue = 5–6 | pages = 777–797 | year = 2009 | arxiv = 0906.0653| pmid =  | pmc = |bibcode = 2009JSP...137..777K }}</ref> and [[Pierre Weiss]] to describe [[phase transitions]].<ref>{{cite journal | title = L'hypothèse du champ moléculaire et la propriété ferromagnétique | first = Pierre | last = Weiss | authorlink = Pierre Weiss | journal = J. Phys. Theor. Appl. | volume = 6 | issue = 1 | year= 1907 | pages= 661–690 | doi = 10.1051/jphystap:019070060066100 | url = http://hal.archives-ouvertes.fr/jpa-00241247/en }}</ref> MFT has been used in the [[Bragg–Williams approximation]], models on [[Bethe lattice]], [[Landau theory]], [[Pierre–Weiss approximation]], [[Flory–Huggins solution theory]], and [[Scheutjens–Fleer theory]].
+
The ideas first appeared in physics ([[statistical mechanics]]) in the work of [[Pierre Curie]]<ref>{{Cite journal | last1 = Kadanoff | first1 = L. P. | authorlink1 = Leo Kadanoff| title = More is the Same; Phase Transitions and Mean Field Theories | doi = 10.1007/s10955-009-9814-1 | journal = Journal of Statistical Physics | volume = 137 | issue = 5–6 | pages = 777–797 | year = 2009 | arxiv = 0906.0653| pmid =  | pmc = |bibcode = 2009JSP...137..777K | s2cid = 9074428 }}</ref> and [[Pierre Weiss]] to describe [[phase transitions]].<ref>{{cite journal | title = L'hypothèse du champ moléculaire et la propriété ferromagnétique | first = Pierre | last = Weiss | authorlink = Pierre Weiss | journal = J. Phys. Theor. Appl. | volume = 6 | issue = 1 | year= 1907 | pages= 661–690 | doi = 10.1051/jphystap:019070060066100 | url = http://hal.archives-ouvertes.fr/jpa-00241247/en }}</ref> MFT has been used in the [[Bragg–Williams approximation]], models on [[Bethe lattice]], [[Landau theory]], [[Pierre–Weiss approximation]], [[Flory–Huggins solution theory]], and [[Scheutjens–Fleer theory]].
    
The ideas first appeared in physics (statistical mechanics) in the work of Pierre Curie and Pierre Weiss to describe phase transitions. MFT has been used in the Bragg–Williams approximation, models on Bethe lattice, Landau theory, Pierre–Weiss approximation, Flory–Huggins solution theory, and Scheutjens–Fleer theory.
 
The ideas first appeared in physics (statistical mechanics) in the work of Pierre Curie and Pierre Weiss to describe phase transitions. MFT has been used in the Bragg–Williams approximation, models on Bethe lattice, Landau theory, Pierre–Weiss approximation, Flory–Huggins solution theory, and Scheutjens–Fleer theory.
   −
这个想法最早出现在物理学(统计力学)的 Pierre Curie 和 Pierre Weiss 描述相变的著作中。Mft 在 Bragg-Williams 近似、 Bethe 晶格模型、 Landau 理论、 Pierre-Weiss 近似、 Flory-Huggins 解理论和 Scheutjens-Fleer 理论中都有应用。
+
这个想法最早出现在物理学(统计力学)的 Pierre Curie 和 Pierre Weiss 描述相变的著作中。MFT 在 Bragg-Williams 近似、 Bethe 晶格模型、 Landau 理论、 Pierre-Weiss 近似、 Flory-Huggins 解理论和 Scheutjens-Fleer 理论中都有应用。
         −
[[Many-body system|Systems]] with many (sometimes infinite) degrees of freedom are generally hard to solve exactly or compute in closed, analytic form, except for some simple cases (e.g. certain Gaussian [[random field]] theories, the 1D [[Ising model]]). Often combinatorial problems arise that make things like computing the [[Partition function (mathematics)|partition function]] of a system difficult. MFT is an approximation method that often makes the original solvable and open to calculation. Sometimes, MFT gives very accurate approximations.
+
[[Many-body system|Systems]] with many (sometimes infinite) degrees of freedom are generally hard to solve exactly or compute in closed, analytic form, except for some simple cases (e.g. certain Gaussian [[random-field]] theories, the 1D [[Ising model]]). Often combinatorial problems arise that make things like computing the [[Partition function (mathematics)|partition function]] of a system difficult. MFT is an approximation method that often makes the original solvable and open to calculation. Sometimes, MFT gives very accurate approximations.
   −
Systems with many (sometimes infinite) degrees of freedom are generally hard to solve exactly or compute in closed, analytic form, except for some simple cases (e.g. certain Gaussian random field theories, the 1D Ising model). Often combinatorial problems arise that make things like computing the partition function of a system difficult. MFT is an approximation method that often makes the original solvable and open to calculation. Sometimes, MFT gives very accurate approximations.
+
Systems with many (sometimes infinite) degrees of freedom are generally hard to solve exactly or compute in closed, analytic form, except for some simple cases (e.g. certain Gaussian random-field theories, the 1D Ising model). Often combinatorial problems arise that make things like computing the partition function of a system difficult. MFT is an approximation method that often makes the original solvable and open to calculation. Sometimes, MFT gives very accurate approximations.
   −
具有许多(有时是无限)自由度的系统通常难以精确地求解或以封闭的解析形式进行计算,除了一些简单的情况(例如:。高斯随机场理论,一维伊辛模型)。经常出现组合问题,使得像计算系统的配分函数 / 值这样的事情变得困难。Mft 是一种近似方法,它常常使原问题变得可解,易于计算。有时,MFT 给出非常精确的近似值。
+
具有许多(有时是无限)自由度的系统通常难以精确地求解或以封闭的解析形式计算,除了一些简单的情况(例如:。高斯随机场理论,一维伊辛模型)。组合问题经常出现,使得计算一个系统的配分函数/值变得困难。MFT 是一种近似方法,它常常使原问题变得可解,易于计算。有时,MFT 给出非常精确的近似值。
         −
In [[classical field theory|field theory]], the Hamiltonian may be expanded in terms of the magnitude of fluctuations around the mean of the field. In this context, MFT can be viewed as the "zeroth-order" expansion of the Hamiltonian in fluctuations.  Physically, this means an MFT system has no fluctuations, but this coincides with the idea that one is replacing all interactions with a "mean field."
+
In [[classical field theory|field theory]], the Hamiltonian may be expanded in terms of the magnitude of fluctuations around the mean of the field. In this context, MFT can be viewed as the "zeroth-order" expansion of the Hamiltonian in fluctuations.  Physically, this means that an MFT system has no fluctuations, but this coincides with the idea that one is replacing all interactions with a "mean field".
   −
In field theory, the Hamiltonian may be expanded in terms of the magnitude of fluctuations around the mean of the field. In this context, MFT can be viewed as the "zeroth-order" expansion of the Hamiltonian in fluctuations.  Physically, this means an MFT system has no fluctuations, but this coincides with the idea that one is replacing all interactions with a "mean field."
+
In field theory, the Hamiltonian may be expanded in terms of the magnitude of fluctuations around the mean of the field. In this context, MFT can be viewed as the "zeroth-order" expansion of the Hamiltonian in fluctuations.  Physically, this means that an MFT system has no fluctuations, but this coincides with the idea that one is replacing all interactions with a "mean field".
   −
在场论中,哈密顿量可以根据场平均周围起伏的大小来展开。在这种背景下,MFT 可以看作是哈密顿量在涨落中的“零阶”展开。在物理上,这意味着 MFT 系统没有波动,但这与“平均场”取代所有相互作用的观点不谋而合
+
在场论中,哈密顿量可以根据场平均周围起伏的大小来展开。在这种背景下,MFT 可以看作是哈密顿量在涨落中的“零阶”展开。物理上,这意味着 MFT 系统没有波动,但这与“平均场”取代所有相互作用的观点不谋而合。
         −
Quite often, MFT provides a convenient launch-point to studying higher order fluctuations. For example, when computing the [[Partition function (statistical mechanics)|partition function]], studying the [[combinatorics]] of the interaction terms in the [[Hamiltonian mechanics|Hamiltonian]] can sometimes at best produce [[Perturbation theory|perturbative]] results or [[Feynman diagram|Feynman diagrams]] that correct the mean field approximation.
+
Quite often, MFT provides a convenient launch point to studying higher-order fluctuations. For example, when computing the [[Partition function (statistical mechanics)|partition function]], studying the [[combinatorics]] of the interaction terms in the [[Hamiltonian mechanics|Hamiltonian]] can sometimes at best produce [[Perturbation theory|perturbative]] results or [[Feynman diagram]]s that correct the mean-field approximation.
   −
Quite often, MFT provides a convenient launch-point to studying higher order fluctuations. For example, when computing the partition function, studying the combinatorics of the interaction terms in the Hamiltonian can sometimes at best produce perturbative results or Feynman diagrams that correct the mean field approximation.
+
Quite often, MFT provides a convenient launch point to studying higher-order fluctuations. For example, when computing the partition function, studying the combinatorics of the interaction terms in the Hamiltonian can sometimes at best produce perturbative results or Feynman diagrams that correct the mean-field approximation.
   −
通常,MFT 为研究高阶涨落提供了一个方便的起点。例如,当计算配分函数时,研究哈密顿量中相互作用项的组合有时候最多只能产生微扰结果或者修正平均场近似的费曼图。
+
MFT 常常为研究高阶波动提供了一个方便的起点。例如,当计算配分函数时,研究哈密顿量中相互作用项的组合有时候最多只能产生微扰结果或修正平均场近似的费曼图。
      第63行: 第63行:  
== Validity ==
 
== Validity ==
   −
In general, dimensionality plays a strong role in determining whether a mean-field approach will work for any particular problem. There is sometimes a [[critical dimension]] above which MFT is valid and below which not so much.  
+
In general, dimensionality plays a strong role in determining whether a mean-field approach will work for any particular problem. There is sometimes a [[critical dimension]], above which MFT is valid and below which it is not.  
   −
In general, dimensionality plays a strong role in determining whether a mean-field approach will work for any particular problem. There is sometimes a critical dimension above which MFT is valid and below which not so much.  
+
In general, dimensionality plays a strong role in determining whether a mean-field approach will work for any particular problem. There is sometimes a critical dimension, above which MFT is valid and below which it is not.  
   −
一般来说,维数在确定平均场方法是否适用于任何特定问题时起着重要作用。有时存在一个临界维度,高于这个维度 MFT 是有效的,低于这个维度 MFT 就不那么有效了。
+
一般来说,维数在确定平均场方法是否适用于任何特定问题时起着重要作用。有时存在一个临界维度,高于该维度 MFT 有效,低于该维度 MFT 无效。
         −
Heuristically in MFT, many interactions are replaced by one effective interaction. So if the field or particle exhibits many random interactions in the original system, they tend to cancel each other out so the mean effective interaction and MFT will be more accurate. This is true in cases of high dimensionality, when the Hamiltonian includes long-range forces, or when the particles are extended (e.g. polymers). The [[Ginzburg criterion]] is the formal expression of how fluctuations render MFT a poor approximation, often depending upon the number of spatial dimensions in the system of interest.
+
Heuristically, many interactions are replaced in MFT by one effective interaction. So if the field or particle exhibits many random interactions in the original system, they tend to cancel each other out, so the mean effective interaction and MFT will be more accurate. This is true in cases of high dimensionality, when the Hamiltonian includes long-range forces, or when the particles are extended (e.g. polymers). The [[Ginzburg criterion]] is the formal expression of how fluctuations render MFT a poor approximation, often depending upon the number of spatial dimensions in the system of interest.
   −
Heuristically in MFT, many interactions are replaced by one effective interaction. So if the field or particle exhibits many random interactions in the original system, they tend to cancel each other out so the mean effective interaction and MFT will be more accurate. This is true in cases of high dimensionality, when the Hamiltonian includes long-range forces, or when the particles are extended (e.g. polymers). The Ginzburg criterion is the formal expression of how fluctuations render MFT a poor approximation, often depending upon the number of spatial dimensions in the system of interest.
+
Heuristically, many interactions are replaced in MFT by one effective interaction. So if the field or particle exhibits many random interactions in the original system, they tend to cancel each other out, so the mean effective interaction and MFT will be more accurate. This is true in cases of high dimensionality, when the Hamiltonian includes long-range forces, or when the particles are extended (e.g. polymers). The Ginzburg criterion is the formal expression of how fluctuations render MFT a poor approximation, often depending upon the number of spatial dimensions in the system of interest.
   −
MFT 中,许多互动被一个有效的互动所取代。因此,如果场或粒子在原系统中表现出许多随机相互作用,它们往往相互抵消,从而使平均有效相互作用和 MFT 更加精确。这在高维情况下是正确的,当哈密顿量包含长程力时,或者当粒子被扩展时(例如:。聚合物)。金兹堡准则是波动如何使 MFT 成为一个糟糕的近似的正式表达,通常取决于感兴趣的系统中的空间维数。
+
启发式地,MFT 中的许多交互被一个有效的交互所取代。因此,如果场或粒子在原系统中表现出许多随机相互作用,它们往往会相互抵消,从而使平均有效相互作用和 MFT 更加精确。这在高维情况下是正确的,当哈密顿量包括远程力时,或者当粒子被扩展时(例如:。聚合物)。金兹堡准则是波动如何使 MFT 成为一个糟糕的近似的正式表达,通常取决于感兴趣的系统中的空间维数。
      第81行: 第81行:  
==Formal approach (Hamiltonian)==
 
==Formal approach (Hamiltonian)==
   −
The formal basis for mean field theory is the [[Helmholtz free energy#Bogoliubov inequality|Bogoliubov inequality]]. This inequality states that the [[thermodynamic free energy|free energy]] of a system with Hamiltonian
+
The formal basis for mean-field theory is the [[Helmholtz free energy#Bogoliubov inequality|Bogoliubov inequality]]. This inequality states that the [[thermodynamic free energy|free energy]] of a system with Hamiltonian
   −
The formal basis for mean field theory is the Bogoliubov inequality. This inequality states that the free energy of a system with Hamiltonian
+
The formal basis for mean-field theory is the Bogoliubov inequality. This inequality states that the free energy of a system with Hamiltonian
    
平均场理论的形式基础是波格留波夫不等式。这个不等式说明了哈密顿量系统的自由能
 
平均场理论的形式基础是波格留波夫不等式。这个不等式说明了哈密顿量系统的自由能
第89行: 第89行:       −
:<math>\mathcal{H} = \mathcal{H}_0 + \Delta \mathcal{H}</math>
+
: <math>\mathcal{H} = \mathcal{H}_0 + \Delta \mathcal{H}</math>
   −
<math>\mathcal{H} = \mathcal{H}_0 + \Delta \mathcal{H}</math>
+
<math>\mathcal{H} = \mathcal{H}_0 + \Delta \mathcal{H}</math>
   −
数学[数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][
+
数学 = 数学 = 数学 = 数学 = 数学 = 数学 = 数学 = 数学 = 数学 = 数学 = 数学
      第105行: 第105行:       −
:<math>F \leq F_0 \ \stackrel{\mathrm{def}}{=}\  \langle \mathcal{H} \rangle_0 - T S_0</math>
+
: <math>F \leq F_0 \ \stackrel{\mathrm{def}}{=}\  \langle \mathcal{H} \rangle_0 - T S_0,</math>
   −
<math>F \leq F_0 \ \stackrel{\mathrm{def}}{=}\  \langle \mathcal{H} \rangle_0 - T S_0</math>
+
<math>F \leq F_0 \ \stackrel{\mathrm{def}}{=}\  \langle \mathcal{H} \rangle_0 - T S_0,</math>
   −
数学 f = f = 0-t = 0 / math
+
1. 数学,数学,数学,数学
         −
where <math>S_0</math> is the [[entropy]] and <math>F</math> and <math>F_0</math> are [[Helmholtz free energy|Helmholtz free energies]]. The average is taken over the equilibrium [[Statistical ensemble (mathematical physics)|ensemble]] of the reference system with Hamiltonian <math>\mathcal{H}_{0}</math>. In the special case that the reference Hamiltonian is that of a non-interacting system and can thus be written as
+
where <math>S_0</math> is the [[entropy]], and <math>F</math> and <math>F_0</math> are [[Helmholtz free energy|Helmholtz free energies]]. The average is taken over the equilibrium [[Statistical ensemble (mathematical physics)|ensemble]] of the reference system with Hamiltonian <math>\mathcal{H}_0</math>. In the special case that the reference Hamiltonian is that of a non-interacting system and can thus be written as
   −
where <math>S_0</math> is the entropy and <math>F</math> and <math>F_0</math> are Helmholtz free energies. The average is taken over the equilibrium ensemble of the reference system with Hamiltonian <math>\mathcal{H}_{0}</math>. In the special case that the reference Hamiltonian is that of a non-interacting system and can thus be written as
+
where <math>S_0</math> is the entropy, and <math>F</math> and <math>F_0</math> are Helmholtz free energies. The average is taken over the equilibrium ensemble of the reference system with Hamiltonian <math>\mathcal{H}_0</math>. In the special case that the reference Hamiltonian is that of a non-interacting system and can thus be written as
   −
数学 s0 / math 是熵,数学 f / math 和数学 f0 / math 是亥姆霍兹自由能。利用哈密顿数学方法对参考系的平衡系综取平均值。在特殊情况下,参考哈密顿量是非相互作用系统的哈密顿量,因此可以写成
+
其中,s _ 0 </math > 是熵,而 < math > f </math > 和 < math > f _ 0 </math > 是亥姆霍兹自由能。用哈密顿数学方法求出参考系平衡系综的平均值。在特殊情况下,参考哈密顿量是非相互作用系统的哈密顿量,因此可以写成
         −
:<math>\mathcal{H}_0 = \sum_{i=1}^N h_i \left( \xi_i \right)</math>
+
: <math>\mathcal{H}_0 = \sum_{i=1}^N h_i(\xi_i),</math>
   −
<math>\mathcal{H}_0 = \sum_{i=1}^N h_i \left( \xi_i \right)</math>
+
<math>\mathcal{H}_0 = \sum_{i=1}^N h_i(\xi_i),</math>
   −
数学{ h }0 sum { i 1} ^ n h i left ( xi i right) / math
+
0 = sum { i = 1} ^ n h _ i (xi _ i) ,</math >
         −
where <math>\left(\xi_i\right) </math> is shorthand for the [[degrees of freedom (physics and chemistry)|degrees of freedom]] of the individual components of our statistical system (atoms, spins and so forth), one can consider sharpening the upper bound by minimizing the right hand side of the inequality. The minimizing reference system is then the "best" approximation to the true system using non-correlated degrees of freedom, and is known as the '''mean field approximation'''.
+
where <math>\xi_i</math> are the [[degrees of freedom (physics and chemistry)|degrees of freedom]] of the individual components of our statistical system (atoms, spins and so forth), one can consider sharpening the upper bound by minimizing the right side of the inequality. The minimizing reference system is then the "best" approximation to the true system using non-correlated degrees of freedom and is known as the '''mean-field approximation'''.
   −
where <math>\left(\xi_i\right) </math> is shorthand for the degrees of freedom of the individual components of our statistical system (atoms, spins and so forth), one can consider sharpening the upper bound by minimizing the right hand side of the inequality. The minimizing reference system is then the "best" approximation to the true system using non-correlated degrees of freedom, and is known as the mean field approximation.
+
where <math>\xi_i</math> are the degrees of freedom of the individual components of our statistical system (atoms, spins and so forth), one can consider sharpening the upper bound by minimizing the right side of the inequality. The minimizing reference system is then the "best" approximation to the true system using non-correlated degrees of freedom and is known as the mean-field approximation.
   −
如果 math  left ( xi i  right) / math 是我们统计系统中各个组成部分(原子、自旋等等)自由度的简写,我们可以考虑通过最小化不平等的右手边来锐化上限。最小化参考系是使用不相关自由度的真实系统的“最佳”近似,被称为平均场近似。
+
如果我们的统计系统的各个组成部分(原子、自旋等等)的自由度,我们可以考虑通过最小化不平等的右边来加强上限。最小化的参考系是使用非相关自由度的真实系统的“最佳”近似,被称为平均场近似。
         −
For the most common case that the target Hamiltonian contains only pairwise interactions, ''i.e.,''
+
For the most common case that the target Hamiltonian contains only pairwise interactions, i.e.,
    
For the most common case that the target Hamiltonian contains only pairwise interactions, i.e.,
 
For the most common case that the target Hamiltonian contains only pairwise interactions, i.e.,
第145行: 第145行:       −
:<math>\mathcal{H} = \sum_{(i,j) \in \mathcal{P}} V_{i,j} \left( \xi_i, \xi_j \right)</math>
+
: <math>\mathcal{H} = \sum_{(i,j) \in \mathcal{P}} V_{i,j}(\xi_i, \xi_j),</math>
   −
<math>\mathcal{H} = \sum_{(i,j) \in \mathcal{P}} V_{i,j} \left( \xi_i, \xi_j \right)</math>
+
<math>\mathcal{H} = \sum_{(i,j) \in \mathcal{P}} V_{i,j}(\xi_i, \xi_j),</math>
   −
数学[数学][数学[数学][数学][数学][数学][数学][数学][数学[数][][][][][][][][][][][][][][][][][][][数][][][数][数][数][数][数][数][数][数][数][数][数][数][数]
+
[数学]数学[数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学][数学]][数学][数学][数学]
      第157行: 第157行:  
where <math>\mathcal{P}</math> is the set of pairs that interact, the minimizing procedure can be carried out formally. Define <math>\operatorname{Tr}_i f(\xi_i)</math> as the generalized sum of the observable <math>f</math> over the degrees of freedom of the single component (sum for discrete variables, integrals for continuous ones). The approximating free energy is given by
 
where <math>\mathcal{P}</math> is the set of pairs that interact, the minimizing procedure can be carried out formally. Define <math>\operatorname{Tr}_i f(\xi_i)</math> as the generalized sum of the observable <math>f</math> over the degrees of freedom of the single component (sum for discrete variables, integrals for continuous ones). The approximating free energy is given by
   −
其中 math mathcal { p } / math 是相互作用的对集合,最小化过程可以正式进行。将 math  operatorname { Tr } i f ( xi i) / math 定义为单个组件自由度上可观测数学 f / math 的广义和(离散变量的和,连续变量的积分)。给出了近似自由能的表达式
+
其中 < math > mathcal { p } </math > 是相互作用的对集合,最小化过程可以正式执行。定义{ Tr } _ i f (xi _ i) </math > 为单个分量自由度上可观测的 < math > f </math > 的广义和(离散变量的和,连续变量的积分)。给出了近似自由能的表达式
    
:<math>\begin{align}
 
:<math>\begin{align}
第163行: 第163行:  
<math>\begin{align}
 
<math>\begin{align}
   −
数学 begin { align }
+
1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3
   −
  F_{0} ={} &\operatorname{Tr}_{1,2,\ldots,N} \mathcal{H} \left(\xi_1,\xi_2,\ldots,\xi_N\right) P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right) \\
+
F_0 &= \operatorname{Tr}_{1,2,\ldots,N} \mathcal{H}(\xi_1, \xi_2, \ldots, \xi_N) P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N) \\
   −
  F_{0} ={} &\operatorname{Tr}_{1,2,\ldots,N} \mathcal{H} \left(\xi_1,\xi_2,\ldots,\xi_N\right) P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right) \\
+
F_0 &= \operatorname{Tr}_{1,2,\ldots,N} \mathcal{H}(\xi_1, \xi_2, \ldots, \xi_N) P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N) \\
   −
F {0} & 操作名{ Tr }{1,2, ldots,n } mathcal { h }( xi 1, xi 2, ldots, xi n ) p ^ {(n)}0左( xi 1, xi 2, ldots, xi n )
+
F _ 0 & = 操作数名{ Tr }{1,2,ldots,n } cal { h }(xi _ 1,xi _ 2,ldots,xi _ n) p ^ {(n)} _ 0(xi _ 1,xi _ 2,ldots,xi _ n)
   −
            &{} + kT \,\operatorname{Tr}_{1,2,\ldots,N} P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right) \log P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right)
+
    &+ kT \,\operatorname{Tr}_{1,2,\ldots,N} P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N) \log P^{(N)}_0(\xi_1, \xi_2, \ldots,\xi_N),
   −
            &{} + kT \,\operatorname{Tr}_{1,2,\ldots,N} P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right) \log P^{(N)}_0 \left(\xi_1,\xi_2,\ldots,\xi_N\right)
+
    &+ kT \,\operatorname{Tr}_{1,2,\ldots,N} P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N) \log P^{(N)}_0(\xi_1, \xi_2, \ldots,\xi_N),
   −
1,2,ldots,n } p ^ {(n)}0左( xi 1,xi 2,ldots, xi n ) log p ^ (n)}0左( xi 1,xi 2,ldots,xi n )
+
1,2,ldots,n } p ^ {(n)} _ 0(xi _ 1,xi _ 2,ldots,xi _ n) log p ^ {(n)} _ 0(xi _ 1,xi _ 2,ldots,xi _ n)
    
\end{align}</math>
 
\end{align}</math>
第181行: 第181行:  
\end{align}</math>
 
\end{align}</math>
   −
End { align } / math
+
结束{ align } </math >
         −
where <math>P^{(N)}_{0}(\xi_{1},\xi_{2},...,\xi_{N})</math> is the probability to find the reference system in the state specified by the variables <math>(\xi_{1},\xi_{2},...,\xi_{N})</math>. This probability is given by the normalized [[Boltzmann factor]]
+
where <math>P^{(N)}_0(\xi_1, \xi_2, \dots, \xi_N)</math> is the probability to find the reference system in the state specified by the variables <math>(\xi_1, \xi_2, \dots, \xi_N)</math>. This probability is given by the normalized [[Boltzmann factor]]
   −
where <math>P^{(N)}_{0}(\xi_{1},\xi_{2},...,\xi_{N})</math> is the probability to find the reference system in the state specified by the variables <math>(\xi_{1},\xi_{2},...,\xi_{N})</math>. This probability is given by the normalized Boltzmann factor
+
where <math>P^{(N)}_0(\xi_1, \xi_2, \dots, \xi_N)</math> is the probability to find the reference system in the state specified by the variables <math>(\xi_1, \xi_2, \dots, \xi_N)</math>. This probability is given by the normalized Boltzmann factor
   −
其中 math p ^ {(n)}{0}( xi {1} , xi {2} ,... , xi { n }) / math 是在变量 math ( xi {1} , xi {2} ,... ,xi { n }) / math 指定的状态下找到引用系统的概率。这个概率是由归一化玻尔兹曼因子给出的
+
其中 < math > p ^ {(n)} _ 0(xi _ 1,xi _ 2,dots,xi _ n) </math > 是在变量 < math > (xi _ 1,xi _ 2,dots,xi _ n) </math > 指定状态下找到参考系的概率。这个概率是由归一化玻尔兹曼因子给出的
   −
:<math>\begin{align}
+
: <math>\begin{align}
   −
<math>\begin{align}
+
<math>\begin{align}
   −
数学 begin { align }
+
1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3
   −
   P^{(N)}_0(\xi_1,\xi_2,\ldots,\xi_N)
+
   P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N)
   −
   P^{(N)}_0(\xi_1,\xi_2,\ldots,\xi_N)
+
   P^{(N)}_0(\xi_1, \xi_2, \ldots, \xi_N)
   −
P ^ {(n)}0( xi 1, xi 2, ldots, xi n)
+
P ^ {(n)} _ 0(xi _ 1,xi _ 2,ldots,xi _ n)
   −
     & {}= \frac{1}{Z^{(N)}_0} e^{-\beta \mathcal{H}_0 (\xi_1, \xi_2, \ldots, \xi_N)} \\
+
     &= \frac{1}{Z^{(N)}_0} e^{-\beta \mathcal{H}_0(\xi_1, \xi_2, \ldots, \xi_N)} \\
   −
     & {}= \frac{1}{Z^{(N)}_0} e^{-\beta \mathcal{H}_0 (\xi_1, \xi_2, \ldots, \xi_N)} \\
+
     &= \frac{1}{Z^{(N)}_0} e^{-\beta \mathcal{H}_0(\xi_1, \xi_2, \ldots, \xi_N)} \\
   −
{}{ z ^ {(n)}0} e ^ {- beta  mathcal { h }0( xi 1, xi 2, ldots, xi n)}
+
0(xi _ 1,xi _ 2,ldots,xi _ n)}
   −
     & {}= \prod_{i=1}^N \frac{1}{Z_0} e^{-\beta h_i \left( \xi_i \right)} \ \stackrel{\mathrm{def}}{=}\  \prod_{i=1}^N P^{(i)}_0 (\xi_i)
+
     &= \prod_{i=1}^N \frac{1}{Z_0} e^{-\beta h_i(\xi_i)} \ \stackrel{\mathrm{def}}{=}\  \prod_{i=1}^N P^{(i)}_0(\xi_i),
   −
     & {}= \prod_{i=1}^N \frac{1}{Z_0} e^{-\beta h_i \left( \xi_i \right)} \ \stackrel{\mathrm{def}}{=}\  \prod_{i=1}^N P^{(i)}_0 (\xi_i)
+
     &= \prod_{i=1}^N \frac{1}{Z_0} e^{-\beta h_i(\xi_i)} \ \stackrel{\mathrm{def}}{=}\  \prod_{i=1}^N P^{(i)}_0(\xi_i),
   −
& }{{{}{ i } ^ n frac {1}{ z 0}{- beta h i ileft ( xi i right)}}}{ mathrm def }}{ i }{ i }}{ n p ^ (i)}0( xi i)
+
1} ^ n frac {1}{ z _ 0} e ^ {-beta h _ i (xi _ i)} stackrel { mathrm { def }{ = } prod _ { i = 1} ^ n p ^ {(i)} _ 0(xi _ i) ,
    
\end{align}</math>
 
\end{align}</math>
第219行: 第219行:  
\end{align}</math>
 
\end{align}</math>
   −
End { align } / math
+
结束{ align } </math >
         −
where <math> Z_0 </math> is the [[Partition function (statistical mechanics)|partition function]]. Thus
+
where <math>Z_0</math> is the [[Partition function (statistical mechanics)|partition function]]. Thus
   −
where <math> Z_0 </math> is the partition function. Thus
+
where <math>Z_0</math> is the partition function. Thus
   −
其中 z 0 / math 是配分函数。因此
+
其中 z 0是配分函数。因此
    
:<math>\begin{align}
 
:<math>\begin{align}
第233行: 第233行:  
<math>\begin{align}
 
<math>\begin{align}
   −
数学 begin { align }
+
1.1.1.2.2.2.2.2.2.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3.3.3.4.3.3.3.3.3.3.3.3.3
   −
   F_0 ={} &\sum_{(i,j)\in\mathcal{P}} \operatorname{Tr}_{i,j} V_{i,j} \left( \xi_i,\xi_j \right) P^{(i)}_0 (\xi_i) P^{(j)}_0 (\xi_j) \\
+
   F_0 &= \sum_{(i,j) \in \mathcal{P}} \operatorname{Tr}_{i,j} V_{i,j}(\xi_i, \xi_j) P^{(i)}_0(\xi_i) P^{(j)}_0(\xi_j) \\
   −
   F_0 ={} &\sum_{(i,j)\in\mathcal{P}} \operatorname{Tr}_{i,j} V_{i,j} \left( \xi_i,\xi_j \right) P^{(i)}_0 (\xi_i) P^{(j)}_0 (\xi_j) \\
+
   F_0 &= \sum_{(i,j) \in \mathcal{P}} \operatorname{Tr}_{i,j} V_{i,j}(\xi_i, \xi_j) P^{(i)}_0(\xi_i) P^{(j)}_0(\xi_j) \\
   −
F 0} & sum {(i,j) in mathcal { p } operatorname { Tr }{ i,j } v { i,j }( xi i, xi j right) p ^ {(i)}0( xi i) p ^ {(j)}0( xi j)}
+
F _ 0 & = sum _ {(i,j) in mathcal { p }算子名{ Tr } _ { i,j } v _ { i,j }(xi _ i,xi _ j) p ^ {(i)} _ 0(xi _ i) p ^ {(j)} _ 0(xi _ j))
   −
          &{} + kT \sum_{i=1}^N \operatorname{Tr}_i P^{(i)}_0 (\xi_i) \log P^{(i)}_0 (\xi_i).
+
      &+ kT \sum_{i=1}^N \operatorname{Tr}_i P^{(i)}_0(\xi_i) \log P^{(i)}_0(\xi_i).
   −
          &{} + kT \sum_{i=1}^N \operatorname{Tr}_i P^{(i)}_0 (\xi_i) \log P^{(i)}_0 (\xi_i).
+
      &+ kT \sum_{i=1}^N \operatorname{Tr}_i P^{(i)}_0(\xi_i) \log P^{(i)}_0(\xi_i).
   −
& {} + kT sum { i } ^ n operatorname { Tr } i p ^ {(i)}0( xi i) log p ^ {(i)}0( xi i).
+
& + kT sum { i = 1} ^ n 操作符名称{ Tr } i p ^ {(i)} _ 0(xi _ i) log p ^ {(i)} _ 0(xi _ i)
    
\end{align}</math>
 
\end{align}</math>
第251行: 第251行:  
\end{align}</math>
 
\end{align}</math>
   −
End { align } / math
+
结束{ align } </math >
         −
In order to minimize we take the derivative with respect to the single degree-of-freedom probabilities <math>P^{(i)}_0</math> using a [[Lagrange multiplier]] to ensure proper normalization. The end result is the set of self-consistency equations
+
In order to minimize, we take the derivative with respect to the single-degree-of-freedom probabilities <math>P^{(i)}_0</math> using a [[Lagrange multiplier]] to ensure proper normalization. The end result is the set of self-consistency equations
   −
In order to minimize we take the derivative with respect to the single degree-of-freedom probabilities <math>P^{(i)}_0</math> using a Lagrange multiplier to ensure proper normalization. The end result is the set of self-consistency equations
+
In order to minimize, we take the derivative with respect to the single-degree-of-freedom probabilities <math>P^{(i)}_0</math> using a Lagrange multiplier to ensure proper normalization. The end result is the set of self-consistency equations
   −
为了最小化,我们对单自由度概率的导数 p ^ {(i)}0 / math 使用拉格朗日乘数来确保正确的归一化。最终得到的结果是自洽方程组
+
为了最小化,我们对单自由度概率 p ^ {(i)} _ 0 </math > 使用拉格朗日乘数来确保正确的归一化。最终得到的结果是自洽方程组
   −
:<math>P^{(i)}_0(\xi_i) = \frac{1}{Z_0} e^{-\beta h_i^{MF}(\xi_i)}\qquad i = 1, 2, \ldots, N</math>
+
: <math>P^{(i)}_0(\xi_i) = \frac{1}{Z_0} e^{-\beta h_i^{MF}(\xi_i)},\quad i = 1, 2, \ldots, N,</math>
   −
<math>P^{(i)}_0(\xi_i) = \frac{1}{Z_0} e^{-\beta h_i^{MF}(\xi_i)}\qquad i = 1, 2, \ldots, N</math>
+
<math>P^{(i)}_0(\xi_i) = \frac{1}{Z_0} e^{-\beta h_i^{MF}(\xi_i)},\quad i = 1, 2, \ldots, N,</math>
   −
0( xi i) frac {1}{ z 0} e ^ {- beta h i ^ { MF }( xi i)} qquad i 1,2,ldots,n / math
+
< math > p ^ {(i)} _ 0(xi _ i) = frac {1}{ z _ 0} e ^ {-beta h _ i ^ { MF }(xi _ i)} ,quad i = 1,2,ldots,n,</math >
      第275行: 第275行:  
平均场是从哪里来的
 
平均场是从哪里来的
   −
:<math>h_i^{MF}\left(\xi_i\right) = \sum_{\{j|(i,j)\in\mathcal{P}\}} \operatorname{Tr}_j V_{i,j} \left( \xi_i,\xi_j \right) P^{(j)}_0 \left(\xi_j\right).</math>
+
: <math>h_i^\text{MF}(\xi_i) = \sum_{\{j \mid (i,j) \in \mathcal{P}\}} \operatorname{Tr}_j V_{i,j}(\xi_i, \xi_j) P^{(j)}_0(\xi_j).</math>
   −
<math>h_i^{MF}\left(\xi_i\right) = \sum_{\{j|(i,j)\in\mathcal{P}\}} \operatorname{Tr}_j V_{i,j} \left( \xi_i,\xi_j \right) P^{(j)}_0 \left(\xi_j\right).</math>
+
<math>h_i^\text{MF}(\xi_i) = \sum_{\{j \mid (i,j) \in \mathcal{P}\}} \operatorname{Tr}_j V_{i,j}(\xi_i, \xi_j) P^{(j)}_0(\xi_j).</math>
   −
数学中的左( xi i 右) sum { j | (i,j) in 数学中的操作员名称{ Tr } j { i,j }( xi i, xi j ) p ^ (j)}( xi j ) . / math
+
数学运算符名称{ Tr } j v { i,j }(xi _ i,xi _ j) p ^ { j } _ 0(xi _ j)
      第285行: 第285行:  
==Applications==
 
==Applications==
   −
Mean field theory can be applied to a number of physical systems so as to study phenomena such as [[phase transitions]].<ref name=Stanley>
+
Mean-field theory can be applied to a number of physical systems so as to study phenomena such as [[phase transitions]].<ref name=Stanley>
 
  −
Mean field theory can be applied to a number of physical systems so as to study phenomena such as phase transitions.<ref name=Stanley>
     −
平均场理论可以应用于许多物理系统,以便研究相变等现象。 裁判员姓名斯坦利
+
Mean-field theory can be applied to a number of physical systems so as to study phenomena such as phase transitions.
   −
{{cite book
+
平均场理论可以应用于许多物理系统,以便研究相变等现象。
    
{{cite book
 
{{cite book
  −
{引用书
      
  |title=Introduction to Phase Transitions and Critical Phenomena
 
  |title=Introduction to Phase Transitions and Critical Phenomena
  −
|title=Introduction to Phase Transitions and Critical Phenomena
  −
  −
相变和临界现象介绍
  −
  −
|first=H. E. |last=Stanley
      
  |first=H. E. |last=Stanley
 
  |first=H. E. |last=Stanley
   −
第一个 h。最后的斯坦利
+
Consider the Ising model on a <math>d</math>-dimensional lattice. The Hamiltonian is given by
   −
|publisher=Oxford University Press
+
考虑一个 < math > d </math > 维格上的 Ising 模型。哈密顿函数是由
    
  |publisher=Oxford University Press
 
  |publisher=Oxford University Press
   −
牛津大学出版社
+
<math>H = -J \sum_{\langle i, j \rangle} s_i s_j - h \sum_i s_i,</math>
   −
  |chapter=Mean Field Theory of Magnetic Phase Transitions
+
  <math>H = -J \sum_{\langle i, j \rangle} s_i s_j - h \sum_i s_i,</math>
    
  |chapter=Mean Field Theory of Magnetic Phase Transitions
 
  |chapter=Mean Field Theory of Magnetic Phase Transitions
   −
磁相变的平均场理论
+
where the <math>\sum_{\langle i, j \rangle}</math> indicates summation over the pair of nearest neighbors <math>\langle i, j \rangle</math>, and <math>s_i, s_j = \pm 1</math> are neighboring Ising spins.
   −
|isbn=0-19-505316-8
+
其中,[ math ] sum { langle i,j rangle } </math > 表示相邻的两个邻居 < math > langle i,j rangle </math > 和 < math > si,s _ j = pm 1 </math > 是相邻的伊辛自旋。
    
  |isbn=0-19-505316-8
 
  |isbn=0-19-505316-8
  −
| isbn 0-19-505316-8
      
  |year=1971
 
  |year=1971
   −
|year=1971
+
Let us transform our spin variable by introducing the fluctuation from its mean value <math>m_i \equiv \langle s_i \rangle</math>. We may rewrite the Hamiltonian as
   −
1971年
+
让我们通过引入涨落来转换自旋变量,从它的平均值 < math > m _ i = l _ i rangle </math > 。我们可以把哈密顿函数改写成
    
}}</ref>
 
}}</ref>
   −
}}</ref>
+
<math>H = -J \sum_{\langle i, j \rangle} (m_i + \delta s_i) (m_j + \delta s_j) - h \sum_i s_i,</math>
   −
{} / ref
+
< math > h =-j sum { langle i,j rangle }(m _ i + delta s _ i)(m _ j + delta s _ j)-h sum i s _ i,</math >
         −
===Ising Model===
+
===Ising model===
   −
Consider the [[Ising model]] on a <math>d</math>-dimensional lattice. The Hamiltonian is given by
+
where we define <math>\delta s_i \equiv s_i - m_i</math>; this is the fluctuation of the spin.
   −
Consider the Ising model on a <math>d</math>-dimensional lattice.  The Hamiltonian is given by
+
在这里我们定义“ math” ,这是自旋的涨落。
   −
考虑数学 d / 数学维格上的 Ising 模型。哈密顿函数是由
+
Consider the [[Ising model]] on a <math>d</math>-dimensional lattice. The Hamiltonian is given by
   −
:<math>H = -J \sum_{\langle i,j \rangle} s_i s_j - h \sum_i s_i</math>
+
: <math>H = -J \sum_{\langle i, j \rangle} s_i s_j - h \sum_i s_i,</math>
   −
<math>H = -J \sum_{\langle i,j \rangle} s_i s_j - h \sum_i s_i</math>
+
If we expand the right side, we obtain one term that is entirely dependent on the mean values of the spins and independent of the spin configurations. This is the trivial term, which does not affect the statistical properties of the system. The next term is the one involving the product of the mean value of the spin and the fluctuation value. Finally, the last term involves a product of two fluctuation values.
   −
<math>H = -J \sum_{\langle i,j \rangle} s_i s_j - h \sum_i s_i</math>
+
如果我们展开右边,我们得到一个项,它完全依赖于自旋的平均值,与自旋构型无关。这是一个平凡的术语,它不影响系统的统计特性。下一项是自旋平均值与涨落值的乘积。最后,最后一项涉及两个涨落值的乘积。
   −
where the <math>\sum_{\langle i,j \rangle}</math> indicates summation over the pair of nearest neighbors <math>\langle i,j \rangle</math>, and <math>s_i = \pm 1</math>
+
where the <math>\sum_{\langle i, j \rangle}</math> indicates summation over the pair of nearest neighbors <math>\langle i, j \rangle</math>, and <math>s_i, s_j = \pm 1</math> are neighboring Ising spins.
   −
where the <math>\sum_{\langle i,j \rangle}</math> indicates summation over the pair of nearest neighbors <math>\langle i,j \rangle</math>, and <math>s_i = \pm 1</math>
     −
其中的数学和 i,j-rangle / math 表示对最近邻居的数学和 i,j-rangle / math,和 math s i-pm 1 / math
     −
and <math>s_j</math> are neighboring Ising spins.
+
The mean-field approximation consists of neglecting this second-order fluctuation term:
   −
and <math>s_j</math> are neighboring Ising spins.
+
平均场近似忽略了这个二阶涨落项:
   −
math s / math 是邻近的 Ising 旋转。
+
Let us transform our spin variable by introducing the fluctuation from its mean value <math>m_i \equiv \langle s_i \rangle</math>. We may rewrite the Hamiltonian as
    +
<math>H \approx H^\text{MF} \equiv -J \sum_{\langle i, j \rangle} (m_i m_j + m_i \delta s_j + m_j \delta s_i) - h \sum_i s_i.</math>
    +
(m _ i m _ j + m _ i delta s _ j + m _ j delta s _ i)-h sum _ i s _ i.数学
   −
Let us transform our spin variable by introducing the fluctuation from its mean value <math> m_i \equiv \langle s_i \rangle </math>. We may rewrite the Hamiltonian:
+
: <math>H = -J \sum_{\langle i, j \rangle} (m_i + \delta s_i) (m_j + \delta s_j) - h \sum_i s_i,</math>
   −
Let us transform our spin variable by introducing the fluctuation from its mean value <math> m_i \equiv \langle s_i \rangle </math>. We may rewrite the Hamiltonian:
     −
让我们通过引入涨落来转换自旋变量,它的平均值是数学 m i-equiv-langle s i-rangle / math。我们可以重写哈密尔顿函数:
     −
:<math>H = -J \sum_{\langle i,j \rangle} \left(m_i + \delta s_i\right)\left(m_j + \delta s_j\right) - h \sum_i s_i</math>
+
These fluctuations are enhanced at low dimensions, making MFT a better approximation for high dimensions.
   −
<math>H = -J \sum_{\langle i,j \rangle} \left(m_i + \delta s_i\right)\left(m_j + \delta s_j\right) - h \sum_i s_i</math>
+
这些涨落在低维度上增强,使 MFT 成为高维度的更好近似值。
   −
数学 h-j  sum { langle i,j  rangle } left (mi + delta s i  right) left (mj + delta s j  right)-h  sum i s i / math
+
where we define <math>\delta s_i \equiv s_i - m_i</math>; this is the ''fluctuation'' of the spin.
         −
where we define <math> \delta s_i \equiv  s_i - m_i </math>; this is the ''fluctuation'' of the spin.
+
Again, the summand can be reexpanded. In addition, we expect that the mean value of each spin is site-independent, since the Ising chain is translationally invariant. This yields
   −
where we define <math> \delta s_i \equiv  s_i - m_i </math>; this is the fluctuation of the spin.
+
同样,可以重新扩大这一需求。另外,由于伊辛链具有平移不变性,我们希望每个自旋的平均值与位置无关。这就产生了
   −
在这里我们定义了数学增量,这是自旋的涨落。
+
If we expand the right side, we obtain one term that is entirely dependent on the mean values of the spins and independent of the spin configurations. This is the trivial term, which does not affect the statistical properties of the system. The next term is the one involving the product of the mean value of the spin and the fluctuation value. Finally, the last term involves a product of two fluctuation values.
         −
If we expand the right hand side, we obtain one term that is entirely dependent on the mean values of the spins, and independent of the spin configurations.  This is the trivial term, which does not affect the statistical properties of the system.  The next term is the one involving the product of the mean value of the spin and the fluctuation value. Finally, the last term involves a product of two fluctuation values.
+
  <math>H^\text{MF} = -J \sum_{\langle i, j \rangle} \big(m^2 + 2m(s_i - m)\big) - h \sum_i s_i.</math>
   −
If we expand the right hand side, we obtain one term that is entirely dependent on the mean values of the spins, and independent of the spin configurations.  This is the trivial term, which does not affect the statistical properties of the system.  The next term is the one involving the product of the mean value of the spin and the fluctuation value.  Finally, the last term involves a product of two fluctuation values.
+
=-j sum { langle i,j rangle } big (m ^ 2 + 2m (s _ i-m) big)-h sum _ i s _ i. </math >
   −
如果我们展开右边,我们得到一个项,这个项完全依赖于自旋的平均值,与自旋构型无关。这是一个平凡的术语,它不影响系统的统计特性。下一项是自旋平均值与涨落值的乘积。最后,最后一项涉及两个涨落值的乘积。
+
The mean-field approximation consists of neglecting this second-order fluctuation term:
    +
: <math>H \approx H^\text{MF} \equiv -J \sum_{\langle i, j \rangle} (m_i m_j + m_i \delta s_j + m_j \delta s_i) - h \sum_i s_i.</math>
    +
The summation over neighboring spins can be rewritten as <math>\sum_{\langle i, j \rangle} = \frac{1}{2} \sum_i \sum_{j \in nn(i)}</math>, where <math>nn(i)</math> means "nearest neighbor of <math>i</math>", and the <math>1/2</math> prefactor avoids double counting, since each bond participates in two spins. Simplifying leads to the final expression
   −
The mean-field approximation consists of neglecting this second order fluctuation term. These fluctuations are enhanced at low dimensions, making MFT a better approximation for high dimensions.
+
相邻自旋的和可以重写为 < math > sum _ { langle i,j rangle } = frac {1}{2} sum _ i sum _ { j in nn (i)} </math > ,其中 < math > nn (i) </math > 表示“ < math > i </math > 的最近邻” ,< math > 1/2 </math > 前因子避免了重复计算,因为每个键参与两个自旋。简化导致最终的表达式
   −
The mean-field approximation consists of neglecting this second order fluctuation term. These fluctuations are enhanced at low dimensions, making MFT a better approximation for high dimensions.
     −
平均场近似忽略了这个二阶涨落项。这些涨落在低维度被增强,使 MFT 成为一个更好的近似高维度。
      +
These fluctuations are enhanced at low dimensions, making MFT a better approximation for high dimensions.
    +
<math>H^\text{MF} = \frac{J m^2 N z}{2} - \underbrace{(h + m J z)}_{h^\text{eff.}} \sum_i s_i,</math>
   −
:<math>H \approx H^{MF} \equiv -J \sum_{\langle i,j \rangle} \left(m_i m_j + m_i \delta s_j + m_j \delta s_i \right) - h \sum_i s_i</math>
+
2}-underbrace {(h + m j z)} _ h ^ text { eff. }数学,数学
 
  −
<math>H \approx H^{MF} \equiv -J \sum_{\langle i,j \rangle} \left(m_i m_j + m_i \delta s_j + m_j \delta s_i \right) - h \sum_i s_i</math>
  −
 
  −
数学 h ^ { MF } equiv-j  sum { langle i,j  rangle }左(m i mj + m i  delta s j + m j  delta s i 右)-h  sum i s i / math
        第417行: 第401行:  
Again, the summand can be reexpanded. In addition, we expect that the mean value of each spin is site-independent, since the Ising chain is translationally invariant. This yields
 
Again, the summand can be reexpanded. In addition, we expect that the mean value of each spin is site-independent, since the Ising chain is translationally invariant. This yields
   −
Again, the summand can be reexpanded. In addition, we expect that the mean value of each spin is site-independent, since the Ising chain is translationally invariant. This yields
+
where <math>z</math> is the coordination number. At this point, the Ising Hamiltonian has been decoupled into a sum of one-body Hamiltonians with an effective mean field <math>h^\text{eff.} = h + J z m</math>, which is the sum of the external field <math>h</math> and of the mean field induced by the neighboring spins. It is worth noting that this mean field directly depends on the number of nearest neighbors and thus on the dimension of the system (for instance, for a hypercubic lattice of dimension <math>d</math>, <math>z = 2 d</math>).
   −
同样,需求可以再次扩大。另外,由于伊辛链具有平移不变性,我们希望每个自旋的平均值与位置无关。这就产生了
+
其中 z </math > 是协调数。在这一点上,伊辛哈密顿函数已经解耦为一个有效平均场 < math > h ^ text { eff. }的单体哈密顿函数之和= h + j z m </math > ,它是外场和相邻自旋引起的平均场的总和。值得注意的是,这个平均值域直接取决于最近邻居的数量,因此取决于系统的维数(例如,对于维数为 < math > d </math > ,< math > z = 2 d </math > 的超立方格)。
         −
:<math>H^{MF} = -J \sum_{\langle i,j \rangle} \left( m^2 + 2m(s_i - m) \right) - h \sum_i s_i</math>
+
: <math>H^\text{MF} = -J \sum_{\langle i, j \rangle} \big(m^2 + 2m(s_i - m)\big) - h \sum_i s_i.</math>
   −
<math>H^{MF} = -J \sum_{\langle i,j \rangle} \left( m^2 + 2m(s_i - m) \right) - h \sum_i s_i</math>
+
Substituting this Hamiltonian into the partition function and solving the effective 1D problem, we obtain
   −
数学 h ^ { MF }-j  sum { langle i,j  rangle }左(m ^ 2 + 2m (s i-m) right)-h  sum i s i / math
+
把这个哈密顿量代入配分函数,求解有效的一维问题,我们得到了
         −
The summation over neighboring spins can be rewritten as <math> \sum_{\langle i,j \rangle} = \frac{1}{2} \sum_i \sum_{j\in nn(i)}</math> where <math>nn(i)</math> means 'nearest-neighbor of <math>i</math>' and the <math>1/2</math> prefactor avoids double-counting, since each bond participates in two spins. Simplifying leads to the final expression
+
The summation over neighboring spins can be rewritten as <math>\sum_{\langle i, j \rangle} = \frac{1}{2} \sum_i \sum_{j \in nn(i)}</math>, where <math>nn(i)</math> means "nearest neighbor of <math>i</math>", and the <math>1/2</math> prefactor avoids double counting, since each bond participates in two spins. Simplifying leads to the final expression
   −
The summation over neighboring spins can be rewritten as <math> \sum_{\langle i,j \rangle} = \frac{1}{2} \sum_i \sum_{j\in nn(i)}</math> where <math>nn(i)</math> means 'nearest-neighbor of <math>i</math>' and the <math>1/2</math> prefactor avoids double-counting, since each bond participates in two spins. Simplifying leads to the final expression
+
<math> Z = e^{-\frac{\beta J m^2 Nz}{2}} \left[2 \cosh\left(\frac{h + m J z}{k_\text{B} T}\right)\right]^N,</math>
   −
其中 math nn (i) / math 意味着‘ math i / math’的最近邻,math 1 / 2 / premath 因子避免了重复计算,因为每个键参与两个旋转。简化导致最终的表达式
+
左[2 cosh left (frac { h + m j }{ k _ text { b } t } right)] ^ n,</math >
   −
:<math>H^{MF} = \frac{J m^2 N z}{2} - \underbrace{(h + m J z)}_{h^\text{eff}} \sum_i s_i </math>
     −
<math>H^{MF} = \frac{J m^2 N z}{2} - \underbrace{(h + m J z)}_{h^\text{eff}} \sum_i s_i </math>
     −
数学 h ^ { MF } frac { j m ^ 2 n z }{2}-底括号{(h + m j z)}{ h ^ text { eff } sum i / math
+
: <math>H^\text{MF} = \frac{J m^2 N z}{2} - \underbrace{(h + m J z)}_{h^\text{eff.}} \sum_i s_i,</math>
    +
where <math>N</math> is the number of lattice sites. This is a closed and exact expression for the partition function of the system. We may obtain the free energy of the system and calculate critical exponents. In particular, we can obtain the magnetization <math>m</math> as a function of <math>h^\text{eff.}</math>.
    +
其中 < math > n </math > 是格点的数量。这是一个封闭而精确的系统配分函数表达式。我们可以得到系统的自由能和计算临界指数。特别地,我们可以得到磁化作为 < math > h ^ text { eff 的函数。{/math > .
   −
where <math>z</math> is the [[coordination number]]. At this point, the Ising Hamiltonian has been ''decoupled'' into a sum of one-body Hamiltonians with an ''effective mean-field'' <math>h^\text{eff} = h + J z m</math> which is the sum of the external field <math>h</math> and of the ''mean-field'' induced by the neighboring spins. It is worth noting that this mean field directly depends on the number of nearest neighbors and thus on the dimension of the system (for instance, for a hypercubic lattice of dimension <math> d</math>, <math> z = 2 d</math>).
     −
where <math>z</math> is the coordination number. At this point, the Ising Hamiltonian has been decoupled into a sum of one-body Hamiltonians with an effective mean-field <math>h^\text{eff} = h + J z m</math> which is the sum of the external field <math>h</math> and of the mean-field induced by the neighboring spins. It is worth noting that this mean field directly depends on the number of nearest neighbors and thus on the dimension of the system (for instance, for a hypercubic lattice of dimension <math> d</math>, <math> z = 2 d</math>).
     −
其中 math z / math 是配位数。此时,伊辛哈密顿量已经解耦为一个单体哈密顿量的和,并用一个有效的平均场数学公式 h ^ ^ h + j z m / math,即外场数学公式 h / math 和相邻自旋引起的平均场之和。值得注意的是,这个平均值域直接取决于最近邻居的数量,因此也取决于系统的维数(例如,对于维数 d / math 的超立方格,math z2d / math)
+
where <math>z</math> is the [[coordination number]]. At this point, the Ising Hamiltonian has been ''decoupled'' into a sum of one-body Hamiltonians with an ''effective mean field'' <math>h^\text{eff.} = h + J z m</math>, which is the sum of the external field <math>h</math> and of the ''mean field'' induced by the neighboring spins. It is worth noting that this mean field directly depends on the number of nearest neighbors and thus on the dimension of the system (for instance, for a hypercubic lattice of dimension <math>d</math>, <math>z = 2 d</math>).
    +
We thus have two equations between <math>m</math> and <math>h^\text{eff.}</math>, allowing us to determine <math>m</math> as a function of temperature. This leads to the following observation:
    +
因此,我们有两个方程在 < math > 和 < math > h ^ text { eff 之间。这样我们就可以确定温度的函数。这导致了以下结论:
   −
Substituting this Hamiltonian into the partition function, and solving the effective 1D problem, we obtain
     −
Substituting this Hamiltonian into the partition function, and solving the effective 1D problem, we obtain
     −
把这个哈密顿量代入配分函数,并求解有效的一维问题,我们得到
+
Substituting this Hamiltonian into the partition function and solving the effective 1D problem, we obtain
         −
:<math> Z = e^{-\frac{\beta J m^2 Nz}{2}} \left[2 \cosh\left(\frac{h + m J z}{k_BT} \right)\right]^N </math>
+
: <math> Z = e^{-\frac{\beta J m^2 Nz}{2}} \left[2 \cosh\left(\frac{h + m J z}{k_\text{B} T}\right)\right]^N,</math>
   −
<math> Z = e^{-\frac{\beta J m^2 Nz}{2}} \left[2 \cosh\left(\frac{h + m J z}{k_BT} \right)\right]^N </math>
+
<math>T_\text{c}</math> is given by the following relation: <math>T_\text{c} = \frac{J z}{k_B}</math>.
   −
数学 z ^ {- beta j ^ 2 Nz }左[2 cosh  left ( frac { h + m j }{ k bt }右)右] ^ n / math
+
“数学”是通过以下关系给出的: < math > t _ text { c } = frac { j }{ k _ b } </math > 。
         −
where <math> N </math> is the number of lattice sites. This is a closed and exact expression for the partition function of the system. We may obtain the free energy of the system, and calculate [[critical exponent]]s. In particular, we can obtain the magnetization <math>m</math> as a function of <math>h^{\mathrm{eff}}</math>.
+
where <math>N</math> is the number of lattice sites. This is a closed and exact expression for the partition function of the system. We may obtain the free energy of the system and calculate [[critical exponent]]s. In particular, we can obtain the magnetization <math>m</math> as a function of <math>h^\text{eff.}</math>.
   −
where <math> N </math> is the number of lattice sites.  This is a closed and exact expression for the partition function of the system.  We may obtain the free energy of the system, and calculate critical exponents. In particular, we can obtain the magnetization <math>m</math> as a function of <math>h^{\mathrm{eff}}</math>.
+
This shows that MFT can account for the ferromagnetic phase transition.
   −
其中数学 n / math 是格点的数量。这是一个封闭而精确的系统配分函数表达式。我们可以得到系统的自由能,并计算临界指数。特别地,我们可以得到磁化数学 m / math 作为数学 h ^ (eff) / math 的函数。
+
这说明 MFT 可以解释铁磁相变。
         −
We thus have two equations between <math>m</math> and <math>h^\text{eff}</math>, allowing us to determine <math>m</math> as a function of temperature. This leads to the following observation:
+
We thus have two equations between <math>m</math> and <math>h^\text{eff.}</math>, allowing us to determine <math>m</math> as a function of temperature. This leads to the following observation:
   −
We thus have two equations between <math>m</math> and <math>h^\text{eff}</math>, allowing us to determine <math>m</math> as a function of temperature. This leads to the following observation:
+
* For temperatures greater than a certain value <math>T_\text{c}</math>, the only solution is <math>m = 0</math>. The system is paramagnetic.
   −
因此,我们在数学 m / math 和数学 h ^  text { eff } / math 之间有两个方程,使我们能够确定数学 m / math 是温度的函数。这导致了以下结论:
+
Similarly, MFT can be applied to other types of Hamiltonian as in the following cases:
   −
* for temperatures greater than a certain value <math>T_c</math>, the only solution is <math>m = 0</math>. The system is paramagnetic.
+
同样,MFT 也可以应用于其他类型的哈密顿量,如下列情况:
   −
* for <math>T < T_c</math>, there are two non-zero solutions: <math> m = \pm m_0 </math>. The system is ferromagnetic.
+
* For <math>T < T_\text{c}</math>, there are two non-zero solutions: <math>m = \pm m_0</math>. The system is ferromagnetic.
         −
<math>T_c</math> is given by the following relation: <math> T_c = \frac{J z}{k_B} </math>.
+
<math>T_\text{c}</math> is given by the following relation: <math>T_\text{c} = \frac{J z}{k_B}</math>.
   −
<math>T_c</math> is given by the following relation: <math> T_c = \frac{J z}{k_B} </math>.
     −
数学 t c / math 是通过以下关系给出的: math t c  frac { j }{ k b } / math。
      
This shows that MFT can account for the ferromagnetic phase transition.
 
This shows that MFT can account for the ferromagnetic phase transition.
  −
This shows that MFT can account for the ferromagnetic phase transition.
  −
  −
这说明 MFT 可以解释铁磁相变。
        第507行: 第483行:  
Similarly, MFT can be applied to other types of Hamiltonian as in the following cases:
 
Similarly, MFT can be applied to other types of Hamiltonian as in the following cases:
   −
Similarly, MFT can be applied to other types of Hamiltonian as in the following cases:
+
* To study the metal–[[superconductor]] transition. In this case, the analog of the magnetization is the superconducting gap <math>\Delta</math>.
   −
同样,MFT 也可以应用于其他类型的哈密顿量,如下列情况:
+
In mean-field theory, the mean field appearing in the single-site problem is a scalar or vectorial time-independent quantity. However, this need not always be the case: in a variant of mean-field theory called dynamical mean-field theory (DMFT), the mean field becomes a time-dependent quantity. For instance, DMFT can be applied to the Hubbard model to study the metal–Mott-insulator transition.
   −
* To study the metal-[[superconductor]] transition. In this case, the analog of the magnetization is the superconducting gap <math>\Delta</math>.
+
在平均场理论中,单点问题中出现的平均场是一个与时间无关的标量或向量。然而,情况并非总是如此: 在一种称为动态平均场理论(DMFT)的平均场理论的变体中,平均场变成了一个与时间有关的量。例如,DMFT 可以应用于哈伯德模型来研究金属-莫特-绝缘体的转变。
    
* The molecular field of a [[liquid crystal]] that emerges when the [[Laplacian]] of the director field is non-zero.
 
* The molecular field of a [[liquid crystal]] that emerges when the [[Laplacian]] of the director field is non-zero.
第527行: 第503行:       −
In mean-field theory, the mean field appearing in the single-site problem is a scalar or vectorial time-independent quantity. However, this need not always be the case: in a variant of mean-field theory called [[dynamical mean field theory]] (DMFT), the mean-field becomes a time-dependent quantity. For instance, DMFT can be applied to the [[Hubbard model]] to study the metal-Mott insulator transition.
+
In mean-field theory, the mean field appearing in the single-site problem is a scalar or vectorial time-independent quantity. However, this need not always be the case: in a variant of mean-field theory called [[dynamical mean-field theory]] (DMFT), the mean field becomes a time-dependent quantity. For instance, DMFT can be applied to the [[Hubbard model]] to study the metal–Mott-insulator transition.
 
  −
In mean-field theory, the mean field appearing in the single-site problem is a scalar or vectorial time-independent quantity. However, this need not always be the case: in a variant of mean-field theory called dynamical mean field theory (DMFT), the mean-field becomes a time-dependent quantity. For instance, DMFT can be applied to the Hubbard model to study the metal-Mott insulator transition.
  −
 
  −
在平均场理论中,单点问题中出现的平均场是一个与时间无关的标量或向量。然而,情况并非总是如此: 在一种称为动态平均场理论(DMFT)的平均场理论的变体中,平均场变成了一个与时间有关的量。例如,DMFT 可以应用于哈伯德模型来研究金属-莫特绝缘体的转变。
        第537行: 第509行:  
==See also==
 
==See also==
   −
*[[Dynamical mean-field theory]]
+
* [[Dynamical mean-field theory]]
 
  −
*[[Mean field game theory]]
  −
 
  −
*[[Generalized Epidemic Mean-Field Model]]
  −
 
  −
 
  −
 
  −
==References==
  −
 
  −
{{Reflist}}
  −
 
  −
 
  −
 
  −
{{DEFAULTSORT:Mean Field Theory}}
  −
 
  −
[[Category:Statistical mechanics]]
      
Category:Statistical mechanics
 
Category:Statistical mechanics
第559行: 第515行:  
类别: 统计力学
 
类别: 统计力学
   −
[[Category:Concepts in physics]]
+
* [[Mean-field game theory]]
    
Category:Concepts in physics
 
Category:Concepts in physics
第567行: 第523行:  
<noinclude>
 
<noinclude>
   −
<small>This page was moved from [[wikipedia:en:Mean field theory]]. Its edit history can be viewed at [[平均场理论/edithistory]]</small></noinclude>
+
<small>This page was moved from [[wikipedia:en:Mean-field theory]]. Its edit history can be viewed at [[平均场理论/edithistory]]</small></noinclude>
    
[[Category:待整理页面]]
 
[[Category:待整理页面]]
1,569

个编辑

导航菜单