16
$\begingroup$

The vertices of a pentagram are five uniformly random points on a circle. The areas of three consecutive triangular "petals" are $a,b,c$. The petals are randomly chosen, but they must be consecutive, either clockwise or anticlockwise.

enter image description here

A simulation of $10^7$ such random pentagrams yielded a proportion of $0.5000179$ satisfying $a^2<bc$.

Is the following conjecture true: $P(a^2<bc)=\frac{1}{2}$

Remarks

Note that the three petals must be consecutive. Calling the areas of consecutive petals $a,b,c,d,e$, simulations suggest that:

  • $P(a^2<bd)\approx0.468$
  • $P(a^2<be)\approx0.505$
  • $P(a^2<cd)\approx0.460$

Curiously, the probability that seems to equal $\frac{1}{2}$, i.e. $P(a^2<bc)$, does not involve a symmetrical arrangement of three petals.

As for other random star polygons $\{\frac{n}{2}\}$ inscribed in a circle, simulations suggest that

  • Star polygon $\left\{\frac{6}{2}\right\}$: $P(a^2<bc)\approx0.505$.
  • Star polygon $\{\frac{7}{2}\}$: $P(a^2<bc)\approx0.504$.

I used the shoelace formula to calculate the areas of the triangular petals.

One might expect that a probability of $\frac12$ should have an intuitive explanation, but sometimes probabilities of $\frac12$ are hard to explain.

Underlying reason?

Simulations suggest that the random pentagram/pentagon shape is teeming with probabilities of powers of $\frac12$. In the following diagram, the letters represent areas of the regions.

enter image description here

  • $P(g+b+h<a+f+c)\overset{?}{=}\color{red}{\frac{1}{2}}$
  • $P(g+h<f)\overset{?}{=}\color{red}{\frac{1}{4}}$
  • $P((g+a+k)(h+c+i)>(b+f+e+d+j)^2)\overset{?}{=}\color{red}{\frac{1}{8}}$
  • $P(\text{each region with area $g,b,f,l$ contains the centre of the circle})=\color{red}{\frac{1}{16}}$ (proved)
  • $P(\text{areas of petals increase going around once, clockwise or anticlockwise})\overset{?}{=}\color{red}{\frac{1}{32}}$

I am not asking to prove these other probability claims. I am presenting them to suggest that there may be an underlying reason why the pentagram has probabilities of powers of $\frac12$, which may be relevant to my conjecture. These simulations make me more inclined to believe that my conjecture is true, but I could be wrong.

$\endgroup$
13
  • 1
    $\begingroup$ What is exactly a? Which triangle? $\endgroup$ Commented Apr 18 at 8:56
  • 1
    $\begingroup$ This is exactly my question; a ray is a line and hence has no area. Maybe you can denote the points on the picture and explain which triangle (?) do you mean. $\endgroup$ Commented Apr 18 at 9:18
  • 1
    $\begingroup$ I though for a moment that it might be that $a^2<bc \iff a^2>de$, because that would immediately give the result by a symmetry argument. However, that cannot be true since you could have $a$ be the smallest triangle which has $a^2<bc, a^2<de$. $\endgroup$ Commented Apr 18 at 9:29
  • 2
    $\begingroup$ It is also not true that the 10 possible inequalities between $a,b,c,d,e$ always split exactly in half if you use any 5 positive numbers for the areas, so if the probability in question is exactly half, then it really has to be due to the relationship imposed on them by the geomety of the pentagram and circle. $\endgroup$ Commented Apr 18 at 11:19
  • 2
    $\begingroup$ @theREALyumdub Why do they become off topic? (I want to include the edited part in this question, because it suggests that the there may be an underlying reason why the pentagram has probabilities of powers of $\frac12$, which is relevant to this question.) $\endgroup$
    – Dan
    Commented Apr 28 at 0:09

1 Answer 1

9
$\begingroup$

TL;DR: Simulation with larger sample-sizes effectively shows $P(a^2<bc)<{1\over 2}.$

EDIT: Although sample-size $10^{10}$ was adequate, I've updated to show the results for $10^{11}$.

For $p:=P(a^2<bc),$ your simulation with sample-size $n=10^7$ gave you an observed proportion $\hat p=0.5000179,$ so an approximate confidence interval with a $99.9\%$ "confidence level" is $$\hat p\pm 3.29\,\sqrt{\hat p(1-\hat p)\over n}=(0.4995, 0.5005).$$

Although ${1\over 2}$ does lie in this interval, the interval only estimates $p$ to about three digits of precision. Simulation using larger sample-size suggests -- with the same very high level of confidence/credibility -- that $p\ne {1\over 2},$ the difference showing up in the fourth decimal place. Here's a picture of what I find with sample-size $n=10^{11}$:

99.9% CI for p using sample-size 10^11

The posterior distribution is $\text{Beta}(a,b)$, with $(a,b)=(n\hat p+{1\over 2}, n(1-\hat p)+{1\over 2}),$ assuming a noninformative prior as $\text{Beta}({1\over 2},{1\over 2}).$ NB: With such a large sample size the posterior is insensitive to whether we use this prior or the flat Uniform prior, which is $\text{Beta}(1,1)$.

The $100(1-\alpha)\%$ credibility interval is therefore $$(B_{\alpha\over 2},B_{1-{\alpha\over 2}})$$ where $B_q$ is the $q$-th quantile of the $\text{Beta}(a,b)$ distribution.

The $100(1-\alpha)\%$ confidence interval is $$\hat p\pm z_{1-{\alpha\over 2}}\,\sqrt{\hat p(1-\hat p)\over n}$$ where $z_q$ is the $q$-th quantile of the standard normal distribution.

The sample-size of $10^{11}$ is sufficiently large that the various approaches to confidence/credibility intervals for $p$ should all give practically the same results (assuming a non-informative prior distribution in the Bayesian methods); e.g., they all give the same $99.9\%$ confidence/credibility interval for $p$, namely

$$0.499948 \pm 0.000005 = (0.499943, 0.499953).$$


EDIT: To perform a cross-check suggested in a comment, I re-ran the simulation with sample-size $10^{10}$, now using a completely different PRNG (Python's random.SystemRandom().random(), which is a much slower cryptographic PRNG). The resulting $99.9\%$ CI -- $0.49995 \pm 0.00002$ -- is consistent with the previous one for that sample-size -- $0.49994 \pm 0.00002$ -- and of course with the more-precise one given above for the $10^{11}$ sample-size.


Python code that I used for the simulation can be found here. It can also be run using the pypy interpreter for better speed; even so, on my system the simulation with sample-size $10^{11}$ took about 16 hrs.

$\endgroup$
8
  • 1
    $\begingroup$ This does rely on believing in the random number generator being perfect. it might be useful try some different ones to see if you get the same result. $\endgroup$
    – Simd
    Commented May 6 at 6:22
  • $\begingroup$ @Simd Alternatively, the reliability of the random number generator could be tested by telling it to generate a large number of uniformly random real numbers from $0$ to $1$, and seeing how often the numbers are less than $0.5$. $\endgroup$
    – Dan
    Commented May 6 at 7:00
  • $\begingroup$ @Simd I would say it relies on the PRNG being in some sense adequate. Cross-checking with some other PRNG is an excellent idea; unfortunately, it doesn't seem doable using pypy (which I've been using for 10X speed) -- I'll look into some alternatives. $\endgroup$
    – r.e.s.
    Commented May 6 at 15:26
  • 1
    $\begingroup$ @Dan that is not at all a thorough test of the quality of a PRNG. Plenty of distributions can satisfy $P(X<0.5)=0.5$ but have terrible matches in other statistics to the uniform distribution. And then there's correlation of consecutive values. $\endgroup$
    – aschepler
    Commented May 7 at 1:31
  • 2
    $\begingroup$ @Simd Following your suggestion, I repeated the simulation three more times (with $n=10^{10}$), using three new & completely different PRNGs -- a crypto. PRNG (see edit) plus both of the PRNGs listed at the link you posted. All 3 results agree with my already-posted $99.9\%$ CI (with $n=10^{11}$): each of the 3 new CIs contains the old one, and none of them contains ${1\over 2}.$ In summary, combining all 5 of my simulations, there were $1.4\times 10^{11}$ pseudorandom trials, of which $69992521805$ had $a^2<bc$, giving the $99.9\%$ CI: $0.499947 \pm 0.000004 = (0.499942, 0.499951).$ $\endgroup$
    – r.e.s.
    Commented May 9 at 18:11

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .