Here is a proof that for any convex polyhedron there exist 2 faces with equal number of edges. I was told that it doesn't work for non convex polyhedra but I can't find out why. Could someone show a counterexample or explain why it fails?
2026-03-31 23:34:47.1775000087
Why this proof doesn't work for non convex polyhedra?
79 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in EXAMPLES-COUNTEREXAMPLES
- A congruence with the Euler's totient function and sum of divisors function
- Seeking an example of Schwartz function $f$ such that $ \int_{\bf R}\left|\frac{f(x-y)}{y}\right|\ dy=\infty$
- Inner Product Uniqueness
- Metric on a linear space is induced by norm if and only if the metric is homogeneous and translation invariant
- Why do I need boundedness for a a closed subset of $\mathbb{R}$ to have a maximum?
- A congruence with the Euler's totient function and number of divisors function
- Analysis Counterexamples
- A congruence involving Mersenne numbers
- If $\|\ f \|\ = \max_{|x|=1} |f(x)|$ then is $\|\ f \|\ \|\ f^{-1}\|\ = 1$ for all $f\in \mathcal{L}(\mathbb{R}^m,\mathbb{R}^n)$?
- Unbounded Feasible Region
Related Questions in POLYHEDRA
- Dimension of Flow Polytope
- Algorithm to find the convex polyhedron
- What is the name of the polyhedral shape of the Humanity Star?
- Number of congruences for given polyhedron
- How to find the "interior boundary" for a set of points?
- Do the second differences of the fifth powers count the sphere packing of a polyhedron?
- PORTA software and Polyhedron theory
- Convex polyhedron given its vertices
- Name of irregular convex octahedron
- Coordinates of a tetrahedron containing a cube
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?
It is possible that two faces are connected by more than one edge. See for example the toroidal polyhedron on this page (about 3/4 of the way down).
Suppose $K$ is a face with the greatest number of edges, $n$. There may be fewer than $n$ distinct faces connected to $K$. That is where the proof fails.
However, any polyhedron like this is degenerate, in the sense that there are two faces in the same plane, or two edges on the same line.
Two distinct planes meet in at most one line, so two faces are connected by at most one edge, in a non-degenerate polyhedron. So the proof works in that case.