Communication on the boundary of a $C^1$ domainThe localization of smooth boundaryOn a method to compute dimension of moduli space of Riemann surfacesIs every hypersurface in $mathbbR^n$ the boundary of an open domain?Properties of $Omega_epsilon$A domain in $mathbbR^n$ with $C^2$-boundary satisfies an “outer spherical condition”Maximum of functionFind boundary of a set (interval), What to use?Is a Lipschitz bounded domain verifies (H)To get a small strip near the boundary of a smooth bounded domainStrictly convex sets and angles

What is the most common color to indicate the input-field is disabled?

files created then deleted at every second in tmp directory

What is a Samsaran Word™?

Different meanings of こわい

How badly should I try to prevent a user from XSSing themselves?

How dangerous is XSS

Car headlights in a world without electricity

How to stretch the corners of this image so that it looks like a perfect rectangle?

OP Amp not amplifying audio signal

Finding the reason behind the value of the integral.

Finitely generated matrix groups whose eigenvalues are all algebraic

In Bayesian inference, why are some terms dropped from the posterior predictive?

Can I hook these wires up to find the connection to a dead outlet?

Send out email when Apex Queueable fails and test it

Pact of Blade Warlock with Dancing Blade

Is this draw by repetition?

How can I deal with my CEO asking me to hire someone with a higher salary than me, a co-founder?

Is it possible to map the firing of neurons in the human brain so as to stimulate artificial memories in someone else?

Did 'Cinema Songs' exist during Hiranyakshipu's time?

What exactly is ineptocracy?

How obscure is the use of 令 in 令和?

Which ISO should I use for the cleanest image?

Machine learning testing data

Unlock My Phone! February 2018



Communication on the boundary of a $C^1$ domain


The localization of smooth boundaryOn a method to compute dimension of moduli space of Riemann surfacesIs every hypersurface in $mathbbR^n$ the boundary of an open domain?Properties of $Omega_epsilon$A domain in $mathbbR^n$ with $C^2$-boundary satisfies an “outer spherical condition”Maximum of functionFind boundary of a set (interval), What to use?Is a Lipschitz bounded domain verifies (H)To get a small strip near the boundary of a smooth bounded domainStrictly convex sets and angles













2












$begingroup$


Assume $Omega$ is a $C^1$ bounded domain of $mathbbR^d$, $d geq 2$. For $(x,y) in (partial Omega)^2$, we say $x sim y$ if $n_x cdot (y-x) > 0$, $n_y cdot (x-y) > 0$, and $(tx+(1-t)y) in Omega$ for all $t in (0,1)$.



Is it true that for any $(x,y) in (partial Omega)^2$ such that $x sim y$, one can find $epsilon_1 > 0, epsilon_2 > 0$ such that $(B(x,epsilon_1) cap partial Omega) sim (B(y,epsilon_2) cap partial Omega)$ (in the sense that for any $a in (B(x,epsilon_1) cap partial Omega)$, $b in B(y,epsilon_2) cap partial Omega)$, $a sim b$)?



From the $C^1$ property of the domain it seems clear that for all $(x,y) in partial Omega^2$, one can find $epsilon > 0$ such that $x sim B(y,epsilon) cap partial Omega$. However the stronger result that I ask, although I don't see any reason why this should not hold, puzzles me a lot more.



Any idea whether the statement is true ? And how to show it ?










share|cite|improve this question











$endgroup$











  • $begingroup$
    In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
    $endgroup$
    – quarague
    Mar 28 at 15:49










  • $begingroup$
    Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
    $endgroup$
    – Gâteau-Gallois
    Mar 28 at 15:55
















2












$begingroup$


Assume $Omega$ is a $C^1$ bounded domain of $mathbbR^d$, $d geq 2$. For $(x,y) in (partial Omega)^2$, we say $x sim y$ if $n_x cdot (y-x) > 0$, $n_y cdot (x-y) > 0$, and $(tx+(1-t)y) in Omega$ for all $t in (0,1)$.



Is it true that for any $(x,y) in (partial Omega)^2$ such that $x sim y$, one can find $epsilon_1 > 0, epsilon_2 > 0$ such that $(B(x,epsilon_1) cap partial Omega) sim (B(y,epsilon_2) cap partial Omega)$ (in the sense that for any $a in (B(x,epsilon_1) cap partial Omega)$, $b in B(y,epsilon_2) cap partial Omega)$, $a sim b$)?



From the $C^1$ property of the domain it seems clear that for all $(x,y) in partial Omega^2$, one can find $epsilon > 0$ such that $x sim B(y,epsilon) cap partial Omega$. However the stronger result that I ask, although I don't see any reason why this should not hold, puzzles me a lot more.



Any idea whether the statement is true ? And how to show it ?










share|cite|improve this question











$endgroup$











  • $begingroup$
    In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
    $endgroup$
    – quarague
    Mar 28 at 15:49










  • $begingroup$
    Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
    $endgroup$
    – Gâteau-Gallois
    Mar 28 at 15:55














2












2








2


2



$begingroup$


Assume $Omega$ is a $C^1$ bounded domain of $mathbbR^d$, $d geq 2$. For $(x,y) in (partial Omega)^2$, we say $x sim y$ if $n_x cdot (y-x) > 0$, $n_y cdot (x-y) > 0$, and $(tx+(1-t)y) in Omega$ for all $t in (0,1)$.



Is it true that for any $(x,y) in (partial Omega)^2$ such that $x sim y$, one can find $epsilon_1 > 0, epsilon_2 > 0$ such that $(B(x,epsilon_1) cap partial Omega) sim (B(y,epsilon_2) cap partial Omega)$ (in the sense that for any $a in (B(x,epsilon_1) cap partial Omega)$, $b in B(y,epsilon_2) cap partial Omega)$, $a sim b$)?



From the $C^1$ property of the domain it seems clear that for all $(x,y) in partial Omega^2$, one can find $epsilon > 0$ such that $x sim B(y,epsilon) cap partial Omega$. However the stronger result that I ask, although I don't see any reason why this should not hold, puzzles me a lot more.



Any idea whether the statement is true ? And how to show it ?










share|cite|improve this question











$endgroup$




Assume $Omega$ is a $C^1$ bounded domain of $mathbbR^d$, $d geq 2$. For $(x,y) in (partial Omega)^2$, we say $x sim y$ if $n_x cdot (y-x) > 0$, $n_y cdot (x-y) > 0$, and $(tx+(1-t)y) in Omega$ for all $t in (0,1)$.



Is it true that for any $(x,y) in (partial Omega)^2$ such that $x sim y$, one can find $epsilon_1 > 0, epsilon_2 > 0$ such that $(B(x,epsilon_1) cap partial Omega) sim (B(y,epsilon_2) cap partial Omega)$ (in the sense that for any $a in (B(x,epsilon_1) cap partial Omega)$, $b in B(y,epsilon_2) cap partial Omega)$, $a sim b$)?



From the $C^1$ property of the domain it seems clear that for all $(x,y) in partial Omega^2$, one can find $epsilon > 0$ such that $x sim B(y,epsilon) cap partial Omega$. However the stronger result that I ask, although I don't see any reason why this should not hold, puzzles me a lot more.



Any idea whether the statement is true ? And how to show it ?







analysis differential-geometry analytic-geometry






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Mar 28 at 15:55







Gâteau-Gallois

















asked Mar 28 at 15:05









Gâteau-GalloisGâteau-Gallois

455213




455213











  • $begingroup$
    In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
    $endgroup$
    – quarague
    Mar 28 at 15:49










  • $begingroup$
    Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
    $endgroup$
    – Gâteau-Gallois
    Mar 28 at 15:55

















  • $begingroup$
    In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
    $endgroup$
    – quarague
    Mar 28 at 15:49










  • $begingroup$
    Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
    $endgroup$
    – Gâteau-Gallois
    Mar 28 at 15:55
















$begingroup$
In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
$endgroup$
– quarague
Mar 28 at 15:49




$begingroup$
In the second paragraph, do you mean for any $(x,y)$ such that $x sim y$? If I understand you definition correctly, if $Omega$ is convex, then $x sim y$ for any two points on the boundary?
$endgroup$
– quarague
Mar 28 at 15:49












$begingroup$
Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
$endgroup$
– Gâteau-Gallois
Mar 28 at 15:55





$begingroup$
Of course ! Thank you, I have corrected it. Actually $x sim y$ for any two points on the boundary if $Omega$ is strictly convex, not with the sole convex assumption (a square for instance will not satisfy this). However convex + $C^1$ is probably enough.
$endgroup$
– Gâteau-Gallois
Mar 28 at 15:55











0






active

oldest

votes












Your Answer





StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













draft saved

draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3166002%2fcommunication-on-the-boundary-of-a-c1-domain%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes















draft saved

draft discarded
















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid


  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3166002%2fcommunication-on-the-boundary-of-a-c1-domain%23new-answer', 'question_page');

);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ