I have made a definition of s-convex set for some $s\in(0,1]$. The definition is: For a fixed $s\in(0,1]$, a subset $A\in\mathbb{R}^2$ is called s-convex if $$t^sx+(1-t)^sy\in A$$ for all $x,y\in A$ and $0\leq t\leq 1$. I don't know if this definition has already been defined. Please give any suggestion.
2026-03-29 23:41:20.1774827680
Is this definition already been defined?
64 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- optimization with strict inequality of variables
- Gradient of Cost Function To Find Matrix Factorization
- Calculation of distance of a point from a curve
- Find all local maxima and minima of $x^2+y^2$ subject to the constraint $x^2+2y=6$. Does $x^2+y^2$ have a global max/min on the same constraint?
- What does it mean to dualize a constraint in the context of Lagrangian relaxation?
- Modified conjugate gradient method to minimise quadratic functional restricted to positive solutions
- Building the model for a Linear Programming Problem
- Maximize the function
- Transform LMI problem into different SDP form
Related Questions in CONVEX-ANALYSIS
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Convex open sets of $\Bbb R^m$: are they MORE than connected by polygonal paths parallel to the axis?
- Show that this function is concave?
- In resticted domain , Applying the Cauchy-Schwarz's inequality
- Area covered by convex polygon centered at vertices of the unit square
- How does positive (semi)definiteness help with showing convexity of quadratic forms?
- Why does one of the following constraints define a convex set while another defines a non-convex set?
- Concave function - proof
- Sufficient condition for strict minimality in infinite-dimensional spaces
- compact convex sets
Related Questions in CONVEX-OPTIMIZATION
- Optimization - If the sum of objective functions are similar, will sum of argmax's be similar
- Least Absolute Deviation (LAD) Line Fitting / Regression
- Check if $\phi$ is convex
- Transform LMI problem into different SDP form
- Can a linear matrix inequality constraint transform to second-order cone constraint(s)?
- Optimality conditions - necessary vs sufficient
- Minimization of a convex quadratic form
- Prove that the objective function of K-means is non convex
- How to solve a linear program without any given data?
- Distance between a point $x \in \mathbb R^2$ and $x_1^2+x_2^2 \le 4$
Related Questions in CONVEX-GEOMETRY
- Lemma 1.8.2 - Convex Bodies: The Brunn-Minkowski Theory
- Why does one of the following constraints define a convex set while another defines a non-convex set?
- Is the logarithm of Banach-Mazur distance between convex bodies an actual distance?
- Convex set in $\mathbb{R}^2_+$
- Unit-length 2D curve segment with maximal width along all directions
- A point in a convex hull
- Geometric proof of Caratheodory's theorem
- The permutations of (1,1,0,0), (-1,1,0,0), (-1,-1,0,0) are vertices of a polytope.
- Computing the subgradient of an indicator function or the normal cone of a set
- 3 Dimensional space
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?
As the comments say, yes: this $s$-convexity is well-defined. Perhaps you're more interested in knowing how it differs from ordinary convexity.
For $s\neq1$ and nontrivial $t$, an $s$-combination of points $t^sx+(1-t)^sy$ is not an affine combination, i.e. the coefficients don't sum to $1$. So $s$-convexity really requires us to work in a vector space, not just an affine space. Maybe this is obvious, but I wanted to point out the consequence that an affine transformation of an $s$-convex set is not necessarily $s$-convex. On the contrary, if a proper subset $A\subset \mathbb R^2$ is $s$-convex, then I suspect that no nontrivial translation of $A$ is $s$-convex. It would be interesting to flesh out that conjecture.
Single points are not $s$-convex. Instead, the $s$-convex hull of a point $x\neq 0$ is the ray $[1,\infty)\cdot x$.
The convex hull of a pair of points is not generally a curve between them. For example, the $\frac12$-convex hull of the points $\{(1,0),(0,1)\}$ is the first quadrant of the plane, $[0,\infty)\times[0,\infty)$, minus the unit open ball.
The preceding example shows that an $s$-convex set need not be convex, and a convex set need not be $s$-convex. This is somewhat unfortunate; ideally when you set up a range of conditions like "$\alpha$-foo" sets, then you want every $\alpha$-foo set to be $\beta$-foo whenever $\alpha\geq\beta$. Or, when $\alpha\leq\beta$. Especially, if there's already a concept of a "foo set", then the $\alpha$-foo should be either stronger or weaker. It's nice to have some relationship.
Note in both the above examples that the $s$-convex hull of a finite set of points is not bounded, and it is not a polygon(al curve) unless you allow points on the line at infinity.
I haven't even thought about how $s$-convex functions will work. You'll probably have to be pretty careful while developing them.