Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

For smooth domains $\Omega$ in $\mathbb{R}^n$ it is known that one can decompose vector fields in $L^p(\Omega)^n$, $1 < p <\infty $ into a "gradient"- and a "divergence-free"-part such that

$L^p(\Omega)^n=G^p(\Omega) \oplus D^p(\Omega)$,

where $G^p(\Omega)= \{ w\in L^p(\Omega)^n; w= \nabla p$ for some $p\in W^{1,p}(\Omega)\}$, and $D^p(\Omega)$ is the completion of $\{ u\in \mathcal{C}^\infty_0(\Omega)^n; \nabla \cdot u=0 \}$ in $L^p$.

Is such a decomposition also available on a compact Riemannian manifold (with boundary) $M$ with respect to the gradient- and divergence-operator induced by the Riemannian metric? Does one additionally have a "annihilator"-property in the spirit of $D^p(\Omega)^\perp = G^q(\Omega)$ (with dual exponent $q$)?

share|improve this question
6  
For closed manifolds this is established in jstor.org/stable/2154923 –  Willie Wong Sep 2 '11 at 12:01
    
It seems to me that the formula for L^p(Ω)^n should have direct sum instead of tensor product. –  Dmitri Pavlov Sep 3 '11 at 19:48
    
Thank you - this is what I meant. –  Sören Sep 5 '11 at 7:16
    
Concerning the comment of Willie Wong: This paper deals only with manifolds without boundary. A later paper including manifolds with boundary would be springerlink.com/content/c0737x2130116676. However, I have some doubts about the results on orthogonal complements (see the table after Theorem 5.7), since the proof seems to rely on a L^p-decomposition of a function in L^q (without having the appropriate embedding, see at the end of page 67). –  Sören Sep 5 '11 at 12:15
add comment

1 Answer

up vote 1 down vote accepted

Günter Schwarz, Hodge Decomposition - A Method for Solving Boundary Value Problems, Lecture Notes in Maths 1607 (1995)

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.