Let $\Omega\subset\mathbb R^n$ be simply connected and compact and let $\vec F:\Omega\to \mathbb R^n$ be a smooth vector field. Is there a way to find a function (or functions) $f:\Omega\to \mathbb R^n$ such that $$ \|\nabla f-\vec F\|_{C^0(\Omega)} $$ is minimal? In case $\vec F$ has a potential, this quantity is of course zero. I'm interested in the case where $\vec F$ fails to have a potential.
2026-03-30 13:54:32.1774878872
Find a function $f$ such that given $\vec F$, $\|\nabla f-\vec F\|$ is minimal
116 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in VECTOR-ANALYSIS
- Does curl vector influence the final destination of a particle?
- Gradient and Hessian of quadratic form
- Regular surfaces with boundary and $C^1$ domains
- Estimation of connected components
- Finding a unit vector that gives the maximum directional derivative of a vector field
- Gradient of transpose of a vector.
- Solve line integral
- Directional derivative: what is the relation between definition by limit and definition as dot product?
- Chain rule with intermediate vector function
- For which $g$ is $f(x)= g(||x||) \frac{x}{||x||}$ divergence free.
Related Questions in APPROXIMATION-THEORY
- Almost locality of cubic spline interpolation
- Clarification for definition of admissible: $\Delta\in (K)$
- Best approximation of a function out of a closed subset
- Approximation for the following integral needed
- approximate bijective function such that the inverses are bijective and "easily" computable
- Approximating $\frac{\frac{N}{2}!\frac{N}{2}!}{(\frac{N}{2}-m)!(\frac{N}{2}+m)!}$ without using logs
- Prove that a set is not strictly convex
- Uniform approximation of second derivative via Bernstein polynomial
- Show that there exists 2 different best approximations
- Zolotarev number and commuting matrices
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
This is a good question but the chosen norm is not the most natural one, therefore the present is a partial answer only.
Consider the reference The American Mathematical Monthly, Volume 109, Issue 5 (2002) (Cantarella, De Turck, Gluck, "Vector Calculus and the Topology of Domains in 3-Space"), which contains the following version of the Hodge decomposition theorem on $\Omega\subset \mathbb R^3$ (see their Proposition 1). The space $\mathrm{VF}(\Omega)$ of all smooth vector fields on $\Omega$ decomposes into the orthogonal direct sum $$ \mathrm{VF}(\Omega)=\mathrm{K}\oplus \mathrm{G}$$ where $\mathrm{K}$ is the space of knots, while $\mathrm{G}$ is the space of gradients (the paper futher decomposes knots as $\mathrm{K}=\mathrm{FK}\oplus \mathrm{HK}$ and gradients as $\mathrm{G}=\mathrm{CG}\oplus \mathrm{HC}\oplus \mathrm{GC}$, but this is not needed for the present question). Here, the scalar product on $\mathrm{VF}(\Omega)$ is defined to be $$\tag{1}\langle V, W\rangle = \int_\Omega V(x)\cdot W(x)\, dx,$$ where $\cdot$ denotes the usual dot product in $\mathbb R^3$.
Using this decomposition, we can immediately give an answer to the present question provided that the $C^0$ norm is replaced with the natural, pre-Hilbert norm $\lVert F\rVert^2=\langle F, F\rangle$. Indeed, given $F\in \mathrm{VF}(\Omega)$, we can decompose it as $F=P_\mathrm{G}F + P_\mathrm{K}F$, where $P_\mathrm{G}, P_\mathrm{K}$ denote the orthogonal projectors onto $\mathrm{G}$ and $\mathrm{K}$ respectively, and so it immediately follows that $$ \inf_{\nabla \phi\in \mathrm{G}}\lVert F-\nabla \phi\rVert^2=\lVert P_\mathrm{K} F\rVert^2.$$
Moreover, the projection $P_\mathrm{K}F$ is explicitly constructed in Section 7 of the linked paper. It involves solving the Poisson partial differential equation $-\Delta \phi = \nabla \cdot F$ on $\Omega$, with Neumann boundary condition $\frac{\partial \phi}{\partial n} = F\cdot n$ (here, as it is usual, $n$ denotes the normal unit vector on the boundary of $\Omega$).
Conclusion. As remarked, this is not a complete answer to the present question, because I used the norm defined by (1). If instead we wanted the $C^0$ norm, that is the supremum norm, then I would not know how to answer. The latter problem is a lot harder.
Concluding remarks on the harder problem. A toy model for the harder problem is the "best approximation with polynomials in the uniform norm", a classical question of approximation theory. In this toy model, the object to approximate is a continuous function $f$ on $[0, 1]$, rather than a vector field $F\in \mathrm{VF}(\Omega)$, and the approximants are polynomials, rather than gradients. Some numerical considerations on this toy problem are on the MathWorks site.