Reputation
1,163
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
6 17
Newest
 Yearling
Impact
~9k people reached

Feb
4
awarded  Yearling
Nov
20
comment Is every hyperplane in $\mathbb{R}^n$ determined by a unique normal vector?
@AnuragA Good call, I've updated my answer accordingly.
Nov
20
revised Is every hyperplane in $\mathbb{R}^n$ determined by a unique normal vector?
added 143 characters in body
Nov
20
answered Is every hyperplane in $\mathbb{R}^n$ determined by a unique normal vector?
Oct
31
awarded  Enlightened
Oct
31
awarded  Nice Answer
Aug
1
comment Proving $\sum_{i=1}^n 2^i = 2^{n+1} - 2$ using strong induction
Did you mean $2^{n+1}$ on the right side of your first equation?
Jul
30
comment Disequality in Type Theory
@ZhenLin Thank you! The HoTT in the title threw me off.
Jul
30
awarded  Cleanup
Jul
30
revised Disequality in Type Theory
rolled back to a previous revision
Jul
30
comment Disequality in Type Theory
@user122283 I used disequality because inequality risks confusion with inequalities (i.e. $x > y$), which are totally distinct. This term is used for example in the Homotopy Type Theory book, so it is not without precedent.
Jul
30
asked Disequality in Type Theory
Jul
7
comment Is it known whether a hypothetical P-time NP-complete decision procedure has to find a specific solution to the given constraint satisfaction problem?
Yes, it is precisely the opposite. A witness to primality would be a proof of some property that only primes have. The most trivial one would be the results of division by all integers less than the number. AKS almost provides a (different) witness of primality, but its polynomial running time relies on a proof that it (in essence) doesn't have to check all cases of the property.
Jul
7
comment Is it known whether a hypothetical P-time NP-complete decision procedure has to find a specific solution to the given constraint satisfaction problem?
The formal definition of $P$ requires a mere (correct) yes-or-no answer, so the possibility that a problem in $P$ may require more than polynomial time to find a witness of the result is not immediately ruled out. In general, there are algorithms that use such ad-hoc methods to answer decision problems; the AKS primality test provides a yes or no answer without a witness of primality. However primality is not believed to be NP-complete.
Jul
4
revised Proof by reflection and Homotopy Type Theory
edited body
Jul
4
asked Proof by reflection and Homotopy Type Theory
Jul
3
awarded  Civic Duty
Jun
26
comment anyone can help me with solving this $x^{x^{3}}=3$?
@EulCan $\sqrt[3]{3}$ is in fact a solution to the latter form.
Jun
26
comment Can one differentiate a series after taking its limit?
@DanielLittlewood His error in fact was not the interaction between the limit and the derivative, so no it doesn't show anything of the sort.
Jun
26
comment Can one differentiate a series after taking its limit?
You are not taking a limit of the variable you are differentiating with respect to, so it is still a free variable in the resulting expression. If you tried to differentiate with respect to $n$ after taking the limit of partial sums, then yes that would be an issue. However you are ignoring the radius of convergence of the series, which is why you are able to prove a false conclusion.