Math 2.0

statement theorem

Poincaré lemma for one-forms on convex sets

Statement

Let U⊆RnU \subseteq \mathbb{R}^n be open and convex, and let ω=∑ifi dxi\omega = \sum_i f_i \, dx_i be a closed one-form on UU with C1C^1 coefficients. Then ω\omega is exact. Explicitly, for a fixed p∈Up \in U, the function g(x)=∫01∑i=1nfi(p+t(x−p)) (xi−pi) dtg(x) = \int_0^1 \sum_{i=1}^n f_i\big( p + t (x - p) \big) \, (x_i - p_i) \, dt satisfies dg=ωdg = \omega on UU.

Remarks

Proof: differentiate under the integral sign, and use ∂jfi=∂ifj\partial_j f_i = \partial_i f_j. The integrand of ∂jg\partial_j g becomes ddt(t fj(p+t(x−p)))\frac{d}{dt} \big( t \, f_j(p + t (x - p)) \big), which integrates to fj(x)f_j(x). In R3\mathbb{R}^3, this is the theorem that a curl-free field on a convex set is conservative. The lemma also holds for closed kk-forms with k≥1k \ge 1 on star-shaped open sets. For one-forms, it holds on simply connected open sets. Some condition on UU is needed: the angle form on R2∖{0}\mathbb{R}^2 \setminus \{0\} is closed but not exact. See also the vortex field.

Explanations

L1 human

On a convex set, a one-form that passes the local test for being a derivative really is a derivative. The proof builds the function by integrating the form along straight segments from one base point.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

13 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Poincar%C3%A9_lemma, lead section
  2. Web https://en.wikipedia.org/wiki/Poincar%C3%A9_lemma, Direct proof
  3. Web https://en.wikipedia.org/wiki/Poincar%C3%A9_lemma, Simply connected case