# Quantum as potential, 2

Only measurement results (aka physical phenomena) form the physical reality.

Quantum Mechanics is a theory of measurement results.

Quantum Mechanics is a theory of reality.

Quantum Mechanics is not a theory of unobservables (undefined-observables).

.

Quantum mechanics is a story of reality, not a story of story.

— Me@2022-07-27 10:38:32 AM

.

.

# Bee

Even if the Bee could explain to the fly why pollen is better than shit, the fly would not understand.

.

.

2022.07.29 Friday ACHK

# 女敵人 2

.

.

— Me@2022-07-29 02:37:02 PM

.

.

# Org-babel-clojure

SICMUtils, 2

.

The goal of this post to setup the Emacs editor for Clojure programming.

.

.

2. Open the .emacs file. Go to the end of the file. Add the following code:

(require 'org)
(require 'ob-clojure)

(setq org-babel-clojure-backend 'cider)
(require 'cider)

(set-register ?c '(file . "~/my-stuff/my-stuff.org"))

(setq org-confirm-babel-evaluate nil)

(setq org-src-tab-acts-natively t)


3. Close Emacs.

.

4. Go to the directory “~/my-stuff/” and then create a file named “my-stuff.org“.

5. Use Emacs to open the file.

6. Within the file, add the following code:

#+BEGIN_SRC emacs-lisp

(+ 1 1)

#+END_SRC


7. Place the text cursor in the code block (between the line #+BEGIN_SRC and the line #+END_SRC).

8. Hit the Emacs command

C-c C-c


9. You will get the evaluation result:

#+RESULTS:
: 2


.

10. Hit the Emacs command:

M-x cider-jack-in


11. Within the file “my-stuff.org“, add the code:

#+BEGIN_SRC clojure :results value

(require '[sicmutils.env :as env])

#+END_SRC


12. Place the text cursor in the code block.

13. Hit the Emacs command

C-c C-c


.

#+BEGIN_SRC clojure :results value

(env/bootstrap-repl!)

#+END_SRC


15. Place the text cursor in the code block and then hit the Emacs command

C-c C-c


.


#+BEGIN_SRC clojure :results replace drawer

(->TeX (simplify ((D cube) 'x)))

#+END_SRC


17. Place the text cursor and then hit

C-c C-c


It will give you the $\LaTeX$ code

#+RESULTS:
:RESULTS:
"3\\,{x}^{2}"
:END:


— Me@2022-07-27 11:34:28 PM

.

.

# SICMUtils

A Clojure(script) implementation of the scmutils system for math and physics investigations in the Clojure and Clojurescript languages.

.

1. To install Clojure in Ubuntu, just this command is enough:

sudo apt-get install elpa-cider


Although the Clojure version you get is probably not the most updated one, that is not important, because you can specify which version you want in the config file of each project.

.

2. Then use this command to generate a new project named my-stuff:

lein new app my-stuff


.

3. Use Emacs to open the file:

~/my-stuff/project.clj


.

4. Replace the existing :dependencies line with this one

  :dependencies [[org.clojure/clojure "1.11.1"]
[sicmutils "0.22.0"]]


And make sure that both clojure and sicmutils have the most updated version numbers.

.

5. In Emacs, type the command

M-x cider-jack-in


.

6. In the clojure window (cider-repl), type

(clojure-version)


with enter at the end.

.

7. Type

(require '[sicmutils.env :as env])


.

8. Type

(env/bootstrap-repl!)


.

9. Code

((D cube) 'x)


will result

(+ (* x x) (* x (+ x x)))


.

10. Type the Emacs command

M-p


to access the last input. Then modify it into

(simplify ((D cube) 'x))


.

It will result

(* 3 (expt x 2))


.

11. Code

(->TeX (simplify ((D cube) 'x)))


will give the $LaTeX$ code

3\\,{x}^{2}


.

12. You can exit by the Emacs command

<C-c C-q>


.

For the time being, SICMUtils is not suitable for the book SICM (Structure and Interpretation of Classical Mechanics). In other words, SICMUtils cannot replace the scmutils library yet, because:

a. You would have to do the translation manually, from the scmutils code in the book to SICMUtils.

b. Although it can generate $LaTeX$ source code, it does NOT do the $LaTeX$ rendering.

c. It cannot plot graphs.

However, SICMUtils has one advantage over scmutils. It can generate $LaTeX$ source of an expression, but scmutils cannot. So I am planning to use both scmutils and SICMUtils.

Also, I will learn how to use SICMUtils with other Clojure libraries and the Jupyter Notebook. That would get $LaTeX$ rendering and graph plotting running.

— Me@2022-07-26 11:03:51 AM

.

.

# Quantum as potential

Realist view is wrong.

Before measurement, there are quantum potentials only.

quantum ~ potential

Note that it is NOT the “quantum potential” in the Bohm interpretation.

— Me@2016-08-21 06:13:49 PM

.

A wave function encodes the probabilities of different potential measurement results of a physical experiment. It is not a physical wave.

Quantum superposition is NOT a superposition of realities.

Physics should consider only measurement results and their probabilities. Only measurement results are realities.

No measurement result, aka physical phenomenon, is in a superposition.

For example, in the double-slit experiment, the measurement results are (the locations of) the dots on the final screen. Every dot location is not in a superposition.

— Me@2022-07-25 06:43:05 PM

.

.

# Inception 18

~ 潛移默化

— Me@2016-04-02 08:40:30 PM

.

.

# Presentation 基本原理 1.2.2

.

（安：雖然我不是從事教學工作，但是，在公司解釋東西給上司時，其實很多時也需要使用到，所謂的「教學技巧」。

.

Keep the Sheep Moving in the Same Direction – a lecture should have a clear and simple plot. Avoid anything that distracts from this. Don’t make too many points. Don’t be afraid to repeat yourself.

— How to Teach Stuff

Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away.

— Antoine de Saint-Exupéry

.

（假設每一節課，都是一小時以內。）

Every lecture should make only one main point.

The German philosopher G. W. F. Hegel wrote that any philosopher who uses the word “and” too often cannot be a good philosopher. I think he was right, at least insofar as lecturing goes. Every lecture should state one main point and repeat it over and over, like a theme with variations.

— Advice for the Young Scientist

— John Baez

.

1. 你將如何為公司賺錢？

2. 為何要選你，而不是其他應徵者？

.

（安：那是兩個重點，而不是一個。）

.

— Me@2022-07-24 04:41:17 PM

.

.

; sudo apt-get install sbcl

; sudo apt-get install slime

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

(setq inferior-lisp-program "sbcl")

(save-excursion (slime))

(delete-other-windows)
)

(defun prelude-start-slime ()
(unless (slime-connected-p)

(set-register ?f '(file . "/path_to/lisp_file.lisp"))

— Me@2022-07-23 05:20:32 PM

.

.

# Cyclic coordinate

A generalized coordinate component that does not appear explicitly in the Lagrangian is called a cyclic coordinate. The generalized momentum component conjugate to any cyclic coordinate is a constant of the motion.

— 1.8 Conserved Quantities

— Structure and Interpretation of Classical Mechanics

.

This is a special case of Noether’s theorem. Such coordinates are called “cyclic” or “ignorable”.

— Wikipedia on Lagrangian mechanics

.

If only the cyclic coordinate $\displaystyle{q(t)}$ varies with time (if it doesn’t, $\displaystyle{q}$ is superfluous), the Lagrangian, or the essential physical situation, doesn’t vary. Hence the initial value of $\displaystyle{q}$ doesn’t determine the path, which is only possible if the path is closed.

— edited Jul 28, 2014 at 15:55

— ACuriousMind

— answered Jul 28, 2014 at 15:50

— Pieter Kockx

— Why are they called “cyclic” coordinates?

— Physics Stack Exchange

.

.

2022.07.22 Friday ACHK

# Lectures On Computation

Feynman’s philosophy of learning and discovery comes through strongly in these lectures. He constantly points out the benefits of play around with concepts and working out solutions to problems on your own before looking at the back for the answers. As Feynman says in the lectures: “If you keep proving stuff that others have done, getting confidence, increasing the complexities of your solutions — for fun of it — then one day you’ll turn around and discovered that nobody actually did that one! And that’s the way, to become a computer scientist.” Imagine that you are explaining your ideas to your former smart but ignorant, self, at the beginning of your studies!

— Feynman[ Lectures on ]Computation

— 30[.]06[.]2003

.

.

2022.07.21 Thursday ACHK

# ENGG 2011

~~~

ENGG 2011 - Advanced Engineering Maths - Assignment 1

~~~

C++: function(...)
Many argument[s]

~~~

C++: mid-term test (31/10/2011)

~~~


.

.

# 機會再生論 1.2

「自力更生」的好處是，你的才能會越來越強。「他力更生」的壞處是，不一定有；即使有，你的財能會遇弱越弱。

「求之於己」的好處是，自己會越來越強，自己成自己的主人。「依賴他人」的壞處是，他人會越來越強，自己成了他人的奴隸。

.

.

— Me@2022-07-14 03:27:39 PM

.

.

# Quick Calculation 3.11

A First Course in String Theory

.

Since $\displaystyle{G^{(D)} \rho_m}$ has the same unit in all dimensions,

\displaystyle{ \begin{aligned} \left[ G^{(D)} {\rho_m}_D \right] &= \left[ G^{(D=4)} {\rho_m}_{D=4} \right] \\ \left[ G^{(D)} \right] \frac{M}{L^{D-1}} &= \left[ G \right] \frac{M}{L^3} \\ \left[ G^{(D)} \right] &= \left[ G \right] L^{D-4} \\ \end{aligned} }

.

Eq. (3.104):

\displaystyle{ \begin{aligned} [G] &= \frac{[c]^3 L^2}{[\hbar]} \\ \end{aligned}}

.

\displaystyle{\begin{aligned} \left[ G^{(D)} \right] &= \frac{[c]^3 L^{D-2}}{[\hbar]} \\ G^{(D)} &= \frac{c^3 \left(l_P^{(D)}\right)^{D-2}}{\hbar} \\ \left(l_P^{(D)}\right)^{D-2} &= G^{(D)} \frac{\hbar}{c^3} \\ \end{aligned}}

.

\displaystyle{\begin{aligned} \left(l_P^{(4)}\right)^{4-2} &= G^{(4)} \frac{\hbar}{c^3} \\ \left(l_P \right)^{2} &= G \frac{\hbar}{c^3} \\ \\ \left(l_P^{(D)}\right)^{D-2} &= \left(l_P \right)^{2} \frac{G^{(D)}}{ G } \\ \\ \end{aligned}}

— Me@2022-07-17 04:23:42 PM

.

.

# Functional programming jargon in plain English

mjburgess 11 days ago | next [–]

These definitions don’t really give you the idea, rather often just code examples..
“The ideas”, in my view:

Monoid = units that can be joined together
Functor = context for running a single-input function
Applicative = context for multi-input functions
Monad = context for sequence-dependent operations
Lifting = converting from one context to another
Sum type = something is either A or B or C…
Product type = a record
= something is both A and B and C
Partial application = defaulting an argument to a function
Currying = passing some arguments later
= rephrasing a function to return a functions of n-1 arguments when given 1, st. the final function will compute the desired result
EDIT: Context = compiler information that changes how the program will be interpreted (, executed, compiled,…)
Eg., context = run in the future, run across a list, redirect the i/o, …

— Functional programming jargon in plain English

— Hacker News

.

Currying and partial function application are often conflated. One of the significant differences between the two is that a call to a partially applied function returns the result right away, not another function down the currying chain; this distinction can be illustrated clearly for functions whose arity is greater than two.

.

Partial application can be seen as evaluating a curried function at a fixed point, e.g. given $\displaystyle{f\colon (X\times Y\times Z)\to N}$ and $\displaystyle{a\in X}$ then

$\displaystyle{{\text{curry}}({\text{partial}}(f)_{a})(y)(z)={\text{curry}}(f)(a)(y)(z)}$

or simply

$\displaystyle{{\text{partial}}(f)_{a}={\text{curry}}_{1}(f)(a)}$

where $\displaystyle{{\text{curry}}_{1}}$ curries $\displaystyle{f}$‘s first parameter.

— Wikipedia on Currying

.

.

2022.07.16 Saturday ACHK

# 浪漫傳說

[約會]是一件輕鬆愉快的事情，不是什麼山盟海誓的嚴肅使命。所以，兄弟們一定要注意，在追女生的時候，[要]給到女生輕鬆愉快的體驗；不要有太多的包袱，和太多的要求，出來約會。

— 楚兒戀愛說

.

— Me@2022-06-27 01:31:05 AM

.

.

# 機會再生論

.

.

.

— Me@2022-07-14 03:27:39 PM

.

.

# Cousin

— Me@2022-07-13 11:52:51 PM

.

.

# Matrix calculus

1.7 Evolution of Dynamical State, 2.3

Structure and Interpretation of Classical Mechanics

.

\displaystyle{ \begin{aligned} \partial_1 L \circ \Gamma[q] &= D ( \partial_2 L \circ \Gamma[q]) \\ \\ &= \partial_0 ( \partial_2 L \circ \Gamma[q]) Dt + \partial_1 ( \partial_2 L \circ \Gamma[q]) Dq + \partial_2 ( \partial_2 L \circ \Gamma[q]) Dv \\ \\ &= \partial_0 \partial_2 L \circ \Gamma[q] + ( \partial_1 \partial_2 L \circ \Gamma[q]) Dq + (\partial_2 \partial_2 L \circ \Gamma[q]) D^2 q \\ \\ \end{aligned}}

.

\displaystyle{ \begin{aligned} (\partial_2 \partial_2 L \circ \Gamma[q]) D^2 q &= \partial_1 L \circ \Gamma[q] - \partial_0 \partial_2 L \circ \Gamma[q] - (\partial_1 \partial_2 L \circ \Gamma[q]) Dq \\ \\ D^2 q &= \left[ \partial_2 \partial_2 L \circ \Gamma[q] \right]^{-1} \left\{ \partial_1 L \circ \Gamma[q] - \partial_0 \partial_2 L \circ \Gamma[q] - (\partial_1 \partial_2 L \circ \Gamma[q]) Dq \right\} \\ \\ \end{aligned}}

where $\displaystyle{\left[ \partial_2 \partial_2 L \circ \Gamma \right]}$ is a structure that can be represented by a symmetric square matrix, so we can compute its inverse.

~~~

[guess]

\displaystyle{ \begin{aligned} D \left( \frac{\partial}{\partial \dot q_1} L \circ \Gamma[\begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix}] \right) - \left(\frac{\partial}{\partial q_1} L \circ \Gamma[\begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix}]\right) &= 0 \\ D \left( \frac{\partial}{\partial \dot q_2} L \circ \Gamma[\begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix}] \right) - \left(\frac{\partial}{\partial q_2} L \circ \Gamma[\begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix}]\right) &= 0 \\ &\vdots \\ \end{aligned}}

.

\displaystyle{ \begin{aligned} D \left( \frac{\partial}{\partial \dot q_1} L \circ \Gamma[\vec q] \right) - \left(\frac{\partial}{\partial q_1} L \circ \Gamma[\vec q]\right) &= 0 \\ D \left( \frac{\partial}{\partial \dot q_2} L \circ \Gamma[\vec q] \right) - \left(\frac{\partial}{\partial q_2} L \circ \Gamma[\vec q]\right) &= 0 \\ &\vdots \\ \end{aligned}}

.

\displaystyle{ \begin{aligned} D \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) - \left(\vec \partial_1 L \circ \Gamma[\vec q]\right) &= 0 \\ \end{aligned}}

\displaystyle{ \begin{aligned} \partial_{\vec 1} = \frac{\partial}{\partial \vec q} &= \begin{bmatrix} \frac{\partial}{\partial q_1} & \frac{\partial}{\partial q_2} & ... \end{bmatrix} \\ \\ \partial_{\vec 2} = \frac{\partial}{\partial \vec{\dot q}} &= \begin{bmatrix} \frac{\partial}{\partial \dot q_1} & \frac{\partial}{\partial \dot q_2} & ... \end{bmatrix} \\ \end{aligned}}

\displaystyle{ \begin{aligned} \vec \partial_{1} = \left( \frac{\partial}{\partial \vec q} \right)^T &= \begin{bmatrix} \frac{\partial}{\partial q_1} \\ \frac{\partial}{\partial q_2} \\ \vdots \end{bmatrix} \\ \\ \vec \partial_{2} = \left( \frac{\partial}{\partial \vec{\dot q}} \right)^T &= \begin{bmatrix} \frac{\partial}{\partial \dot q_1} \\ \frac{\partial}{\partial \dot q_2} \\ \vdots \end{bmatrix} \\ \end{aligned}}

.

\displaystyle{ \begin{aligned} \vec \partial_1 L \circ \Gamma[\vec q] &= D \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) \\ \\ &= \partial_0 \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) Dt \\ &+ \partial_{q_1} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) Dq_1 + \partial_{\dot q_1} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D \dot q_1 \\ &+ \partial_{q_2} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) Dq_2 + \partial_{\dot q_2} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D \dot q_2 \\ &+ ... \\ \\ &= \partial_0 \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) \\ &+ \begin{bmatrix} \partial_{q_1} & \partial_{q_2} & ... \end{bmatrix} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D \begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix} \\ &+ \begin{bmatrix} \partial_{\dot q_1} & \partial_{\dot q_2} & ... \end{bmatrix} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D^2 \begin{bmatrix} q_1 \\ q_2 \\ \vdots \end{bmatrix} \\ \end{aligned}}

.

\displaystyle{\begin{aligned} \vec \partial_1 L \circ \Gamma[\vec q] &= \partial_0 \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) Dt + \frac{\partial}{\partial \vec q} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D \vec q + \frac{\partial}{\partial \vec {\dot q}} \left( \vec \partial_2 L \circ \Gamma[\vec q] \right) D^2 \vec q \\ \end{aligned}}

[guess]

— Me@2022-07-09 09:09:28 PM

.

.