Wikipedia:Reference desk/Mathematics

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The Wikipedia Reference Desk covering the topic of mathematics.

Welcome to the mathematics reference desk.
Want a faster answer?

Main page: Help searching Wikipedia

How can I get my question answered?

  • Provide a short header that gives the general topic of the question.
  • Type '~~~~' (that is, four tilde characters) at the end – this signs and dates your contribution so we know who wrote what and when.
  • Post your question to only one desk.
  • Don't post personal contact information – it will be removed. All answers will be provided here.
  • Specific questions, that are likely to produce reliable sources, will tend to get clearer answers.
  • Note:
    • We don't answer (and may remove) questions that require medical diagnosis or legal advice.
    • We don't answer requests for opinions, predictions or debate.
    • We don't do your homework for you, though we'll help you past the stuck point.
    • We don't conduct original research or provide a free source of ideas, but we'll help you find information you need.



How do I answer a question?

Main page: Wikipedia:Reference desk/Guidelines

  • The best answers address the question directly, and back up facts with wikilinks and links to sources. Do not edit others' comments and do not give any medical or legal advice.
 
Choose a topic:
 
See also:
Help desk
Village pump
Help manual


December 6[edit]

Confidence intervals/error bars on fit parameters[edit]

Original problem: I have N experimental observations of a certain phenomenon; the i-th experimental observation consists of a certain number of repetitions of the experiment at a parameter , and from that I extracted the sample mean and standard deviation of the result . I know a predicted linear relationship between the parameter and the result: . I want to use the experimental data to extract the parameters' values and the uncertainty affecting those.

What I tried so far: get the fit parameters by least squares weighted by the reverse of the uncertainty on each point; that is, find as the values that minimize . That does give an estimation of the parameters, but not uncertainty bounds on them. Intuitively I would look at what produces a "large" value for the weighted least squares but I do not really know how to properly do it and I am sure it has already been done before by my Google-fu was weak.

I have already read reduced chi-squared statistic which is close but not what I want. TigraanClick here to contact me 15:20, 6 December 2018 (UTC)

You are doing a weighted least squares estimation of and in
with intercept term The estimate for k is simply the estimated coefficient of and its variance is the variance of that estimated coefficient, which is standard in regression output. We need to find the variance of given the variances of k and of the estimated intercept. I would think that you could state the variance of the estimated intercept as a probability-weighted average of the possible values of k times the variance of :
where f(k) is the probability density of k, inferred from the regression by the estimated variance of k and a normality assumption on k. Then the only unknown in this equation is the desired var(), which the equation says equals the variance of the intercept. Does any of that make any sense? Loraof (talk) 19:53, 6 December 2018 (UTC)
I think that you can find all answers in Simple linear regression. Ruslik_Zero 20:00, 8 December 2018 (UTC)

Minimal CNF form[edit]

Is the following statement correct:

Let be a formula in CNF form over the set of variables .

Assume that:

  1. For every clause all of its variables appear in their positive form. (that is, no in the )
  2. Every two clauses of , satisfy ( is not a subset of )

Then is in its minimal CNF form (there's no equivalent CNF formula with smaller size) David (talk) 18:58, 6 December 2018 (UTC)

I believe (A∨B)∧(¬A∨¬B)∧(A∨C)∧(¬A∨¬C)∧(B∨C)∧(¬B∨¬C) has the form you describe, but it's equivalent to False or (A)∧(¬A). Pretty sure that if there was a rule like this then you'd be able to solve SAT in polynomial time, and if such a scheme existed it's extremely unlikely it wouldn't have been found already. --RDBury (talk) 05:51, 7 December 2018 (UTC)
First, it's a good counterexample, so I changed my question, and replaced it with a stronger condition, under which I hope we can promise it's the minimal CNF form.
Second, I agree that one can't expect to get a method that works in general that decides whether or not a given formula is in its minimal CNF form (for then, SAT were in P). Nevertheless, there could be many methods for deciding in some special cases if they're in their minimal CNF form. David (talk) 12:48, 7 December 2018 (UTC)
Just for clarity, the original conditions were:
Assume that every two clauses of , satisfy:
  1. ( is not a subset of )
  2. (the symmetric difference of and is not equal to any variable and its negation).
You may have had no way of knowing this, but in general it's better to just strikethrough material in your previous posts rather than deleting; especially if someone has already replied to the original. If you're just fixing a typo or something that doesn't change the meaning then don't worry about it; WP does have a habit of inserting typos into what people have written after they hit the 'Publish' button.
The example is basically just a Boolean version of the statement '2 divides 3', so not that hard to dome up with if you're used to this type of conversion. The new version of the question appears in a StackExchange post. The only response missed the 'positive' part of the question, so as far as I know it's still unanswered. --RDBury (talk) 15:16, 7 December 2018 (UTC)
PS. I think I have a proof that, given the positive condition, the minimal expression is unique. It's not that hard so I'm a bit surprised the StackExchange people didn't find it, or maybe it's just that my proof is incorrect. In any case I'll write it up and post it in a bit. --RDBury (talk) 15:50, 7 December 2018 (UTC)
Proof: Let S and T be two equivalent positive expressions in CNF which are both minimal. Let {Si} be the set of clauses in S and {Tj} be the set of clauses in T. Each Si and Tj, in turn, correspondes to a subset of a set of Boolean variables {xk}. Since S is minimal, no Si is contained in Sj for j≠i, and similarly for T. For each assignment a:xk → {T, F}, define Z(a) to be the set of variables for which a is F, i.e. Z(a) is the compliment of the support of a. A clause Si evaluates to F iff Si⊆Z(a) and the expression S evaluates to F iff Si⊆Z(a) for some i. A similar statements holds for T. Fix i and define the truth assignment ai(xk) to be 'T' when xk is not in Si, in other words ai is the truth assignment so that Z(ai) = Si. The clause Si evaluates to F under this assignment, so S evaluates to F. But S and T are equivalent so T evaluates to F. Therefore Tj⊆Z(ai)= Si for sime j. Similary, for each j there is k so that Sk ⊆ Tj.(I think another way of saying this is that S and T are refinements of each other.) If Si is an element of S, then there is Tj in T so that Tj ⊆ Si, and there is an Sk so that Sk ⊆ Tj. Then Sk ⊆ Si and so, since S is minimal, i=k. We then have Si ⊆ Tj ⊆ Si, Si = TjT. So ST and similarly TS, therefore S = T. --RDBury (talk) 17:04, 7 December 2018 (UTC)

December 7[edit]

Pool Adjusted Risk Ratio[edit]

I'm looking into the relation between Benzodiazepines and Dementia. I found in an article: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0127836 that "Compared with never users, pooled adjusted risk ratios (RRs) for dementia were 1.49 (95% confidence interval (CI) 1.30–1.72) for ever users" is this the same as the Odds_ratio? Is 1.49 a high figure? In the example in the article the wine drinking variable is highly correlated with men compared to women and has a ration of 36 which would make me think that 1.49 is not that high. What does it mean exactly? --MadScientistX11 (talk) 21:25, 7 December 2018 (UTC)

From our article Risk ratio:
In epidemiology, risk ratio (RR) or relative risk is the ratio of the probability of an outcome in an exposed group to the probability of an outcome in an unexposed group.
So a risk ratio of 1.49 means that the dementia probability of people exposed to the drug is half again as big as that for people not exposed to the drug. For example, if 10% of unexposed people develop dementia, then 1.49 × 10% = 14.9% of exposed people develop dementia. The risk ratio is very similar to, but not identical to, the odds ratio, which is the ratio of odds rather than of probabilities. 1.49 seems pretty high to me. Loraof (talk) 23:20, 7 December 2018 (UTC)
Excellent, just what I needed to know. Thanks. --MadScientistX11 (talk) 23:56, 7 December 2018 (UTC)

December 8[edit]

AGM[edit]

I was reading the article Arithmetic–geometric mean (AGM). I was wondering, is the AGM of two algebraic numbers necessarily transcendental? More generally, when is it transcendental and when is it not? I was hoping to get such information added to the AGM article.--Solomonfromfinland (talk) 06:13, 8 December 2018 (UTC)

@Solomonfromfinland: Here’s how to find an infinitude of cases with algebraic (non-transcendental) AGM. Consider hypothesized initial conditions that converge exactly, rather than asymptotically, to AGM. The initial conditions are our unknowns, and we require that the system converge exactly to Use the given iterative formula twice to obtain
Then equate , square both sides, rearrange, and isolate the remaining square root and square both sides. The result is a polynomial equation in and For any arbitrary algebraic value of each of the solutions for is an algebraic number. Then by the two equations above, is an algebraic number.
This approach presumably works for any finite number of steps to exact convergence. We can still hypothesize that all cases that converge only asymptotically converge to a trancendental number. Loraof (talk) 00:12, 10 December 2018 (UTC)

December 9[edit]

Statistically intractable[edit]

Is there a thing like a problem being "statistically intractable"? Or are problems just NP-complete, unfeasible, intractable in general, no matter whether for statistical methods or any other approach? --Doroletho (talk) 03:24, 9 December 2018 (UTC)

December 10[edit]