 Oct 2023

www.reddit.com www.reddit.com

What is it with index cards ? .t3_17ck5la._2FCtqQzlfuNSwVMUZMM3 { postTitleVisitedLinkColor: #9b9b9b; postTitleLinkVisitedLinkColor: #9b9b9b; postBodyLinkVisitedLinkColor: #989898; } So I posted a while ago about my journey into the zettlekasten and I have to admit I still enjoy using this system for notes.I must say, I am an avid note taker for a long time. I write ideas, notes from books, novels, poems and so much more. I mainly used to use notebooks, struggle a while with note taking apps and now I mainly use two kind of things : index cards (A6) and an eink tablet (the supernote) for different purpose of course, the index cards for the zettelkasten and the eink tablet for organization and my work. To be honest I used to consider myself more a notebooks kind of person than an index cards one (and I am from France we don't use index cards but "fiche bristol" which are bigger than A6 notecards, closer to an A5 format)Still, there is something about index cards, I cannot tell what it is, but it feels something else to write on this, like my mind is at ease and I could write about ideas, life and so many stuff covering dozens of cards. I realize that after not touching my zettelkasten for a few week (lack of time) and coming back to it. It feels so much easier to write on notecards than on notebooks (or any other place) and I can't explain it.Anyone feeling the same thing ?
reply to u/SensitiveBinding at https://www.reddit.com/r/antinet/comments/17ck5la/what_is_it_with_index_cards/
Some of it may involve the difference in available space versus other forms of writing on larger pages of paper. Similarly, many find that there is less pressure to write something short on Twitter or similar social media platforms because there is less space in the user interface that your mind feels the need to fill up. One can become paralyzed by looking at the larger open space on a platform like WordPress with the need to feel like they should write more.
With index cards you fill one up easily enough, and if there's more, you just grab another card and repeat.
cross reference with Fermat's Last Theorem being easier to suggest in a margin than actually writing it out in full.

 Aug 2023

hub.jhu.edu hub.jhu.edu

"But there's a very famous theorem in topology called the Jordan curve theorem. You have a plane and on it a simple curve that doesn't intersect and closes—in other words, a loop. There's an inside and an outside to the loop." As Riehl draws this, it seems obvious enough, but here's the problem: No matter how much your intuition tells you that there must be an inside and an outside, it's very hard to prove mathematically that this holds true for any loop that can be drawn.
How does one concretely define "inside" and "outside"? This definition is part of the missing space between the intuition and the mathematical proof.

 May 2023


8.3.1. I NTEGRAL C ONVERGENCE T HEOREM
Integral of the limit of uniform converging function is the same as the integral of the lmit. Pay attention to conditions: 1. Closed and bounded interval \([a, b]\). 2. Sequence of CONTINUOUS functions. 3. Of course, converges uniformly.


Local file Local file

4.73 Uniform Boundedness Theorem.
A sequence of linear operator such that, pointwise the value of the linear operators are bounded is enough for the norm of the operator to be bounded for the limit of the sequence of linear operators.

4.41 Riesz's Theorem (Functionals on C[a, b]).
Every Bounded linear functionals on C[a, b] is Riemann Integrals.

4.84 Theorem (Strong and weak convergence).
Strong convergence, equivalences and converse.

4.33 Theorem (Bounded linear functionals).
Bounded Linear Functional Theorems in Banach Space.

4.32 HahnBanach Theorem (Normed spaces).
Hahn Banach Theorem in normed vector spaces

4.21 HahnBanach Theorem (Extension of linear functionals).

 Apr 2023


4.3.8. T HEOREM .
open set, closed complement and vice versa. In finite Euclidean space.


www.dl.behinehyab.com www.dl.behinehyab.com

Theorem 5.7.
Complexity of the Floyd warshall Algorithm.

Theorem 11.9 (Triangularity Property).
the incidence matrix of a spanning tree graph can be, lower triangular.

Theorem 11.2 (Spanning Tree Property).

Theorem 11.1 (Cycle Free Property).

Theorem 9.5 (Weak Duality Theorem)
(9.11) is literally the dual LP formulation of the min cost flow problem onthe network.

Theorem 9.4 (Complementary Slackness Optimality Conditions)
Some flow is optimal, if and only if, there is some potential, where, the reduced costs for the potential satisfies the complementary slackness conditions for the duality of the linear program of the min cos flow problem.


Local file Local file

2.104 Theorem (Dual space).
The dual spaces theorem

2.102 Theorem (Completeness)

2.101 Theorem (Space B(X, Y».

2.91 Theorem (Dimension of X*).
The space and the dual space is having the same dimension.

2.83 Theorem (Continuity and boundedness)
It's an example of theorem 2.79. A linear operator has boundedness and continuity being an equivalent conditions.

2.79 Theorem (Continuity and boundedness)
Let T be a linear mapping between 2 normed space, then:
 T is continous if and only if it's bounded.
 T is continous at a single point then it's continous.

2.78 Theorem (Finite dimension).
Linear operator, and bounded linear operators are equivalent when the vector space is finite dimensional.

2.69 Theorem (Range and null space).
 Range is a vector space.
 If the dim of the range is less than infinitely, then the dim of the range is \(\le\) dim of the domain.

2.56 Theorem (Continuous mapping)
Continuous mapping preserves compactness in finite dimensional spaces.

2.55 Theorem (Finite dimension)
Compact Closed unit ball in a normed spaces would mean that we have finite dimension.

2.53 Theorem (Compactness).
compactness is euivalent to closed and boundedness in finite dimensional spaces.


Local file Local file

18.1 Theorem.
extreme value theorem. A continuous function attains some type of minimum and maximum over an compact set in its domain.

11.4 Theorem.
Monotone Subsequence Theorem for real Sequences.


homepages.uc.edu homepages.uc.edu

heorem 6.5 (Sufficient Conditions for Differentiability).

Theorem 6.4.
A Necessary conditions for a function to he differentiable at a point.


Local file Local file

1.9 Theorem (attainment of a minimum)
The existence of a minimizer for functions.

 Mar 2023

Local file Local file

2.45 Theorem (Equivalent norms).
In a finite dimensional space, every norm is Equivalent

2.43 Theorem (Closedness)
Every finite dimensional Banach space is closed.

2.42 Theorem (Completeness).
Every finite dimension subspace of the normed space is complete, so are their subspace.

2.32 Theorem (Completion)
Alternative explanations from Walfram Math world: here.
In brief, you can use an isometry map from a banach space to another subspace in a different Banach space such that it's dense.

2.31 Theorem (Subspace of a Banach space).
Similar to 1.47


www.dl.behinehyab.com www.dl.behinehyab.com

Theorem 9.7.

Theorem 9.6 (Strong Duality Theorem)

Theorem 9.3 (Reduced Cost Optimality Conditions)

Theorem 9.1
no negative cycles optimal solutions min cost flow theorem

Theorem 9.10

Theorem 7.10

Theorem 5.3
The complexity of the FIFO label correcting algorithms.

Theorem 7.4

Theorem 3.5 (Flow Decomposition Theorem).
We implicitly assume that the flow is positive due to how the algorithm works.

Theorem 6.12.

Theorem 6.10 (Generalized MaxFlow MinCut Theorem).


localhost:4000 localhost:4000

THEOREM 23.8
Subgradient sum rules

THEOREM 23.7.
Normal cone of the non smooth level plot of a function.

 Feb 2023

www.dl.behinehyab.com www.dl.behinehyab.com

Theorem 6.6.
complexity of the max flow labeling algorithm.

Theorem 6.7.
Min cut capacity and the cardinality of maximum number of arc disjoint path from source to destination.

Theorem 6.3 (MaxFlow MinCut Theorem).

Theorem 6.4 (Augmenting Path Theorem).
Aug Path theorem

Theorem 6.5 (Integrality Theorem).
Network flow integers theorem.

Theorem 6.8

Theorem 5.1 (Shortest Path Optimality Conditions).
There is a linear programming interpretation via the network flow standard form and the reduction of shortest path to the network flow problem at the end of chapter 5.2.

Theorem 3.7 (Augmenting Cycle Theorem).
Given 2 feasible flow, \(x, x^\circ\), it's possible to construct \(x\) with at most m directed cycles on the residual graph \(G(x^\circ)\).

Theorem 3.8 (Negative Cycle Optimality Theorem).


Local file Local file

5.14 Theorem (Contraction on a ball)
Paculiar, I have no idea about the significant of this theorem and why it's stated here. How does this variation of the theorem even make inuitive sense?

5.12 Banach Fixed Point Theorem

1.47 Theorem (Complete subspace)
theorem

1.46 Theorem (Closure, closed set).


Local file Local fileBOOK1

Theorem 3.2.5
Characterization of a limit point of a set via a limit that occurs inside of the set.


royalsocietypublishing.org royalsocietypublishing.org

Bell’s theorem is aboutcorrelations (joint probabilities) of stochastic real variables and therefore doesnot apply to quantum theory, which neither describes stochastic motion nor usesrealvalued observables
strong statement, what do people think about this? is it accepted by anyone or dismissed?



Theorem 29
Theorem:
metric equivalences preserves sequential convergence and openedness of sets.

Theorem 24
A convergence sequence is a Cauchy sequence under a certain metric.

Theorem 27
sequential continuity of a mapping in the metric space.

Theorem 13
For an accumulation point in a subset \(M\) of space \(X\), any epsilon balls with central isolation has ifninitely many points and there is a sequence in such epsilon ball such that it converges to the singularity but never really being on the singularity.
Singularity: \(x_0\) as described in the proof.

Theorem 25
The equivalence of the sequential closedness of a set and the epsilon ball closedness of a set.

 Nov 2022

en.wikipedia.org en.wikipedia.org

it became clear that Fermat's Last Theorem could be proven as a corollary of a limited form of the modularity theorem (unproven at the time and then known as the "Taniyama–Shimura–Weil conjecture"). The modularity theorem involved elliptic curves, which was also Wiles's own specialist area.[15][16]
Elliptical curves are also use in Ed25519 which are purportedly more robust to side channel attacks. Could there been some useful insight from Wiles and the modularity theorem?

 Jan 2022

towardsdatascience.com towardsdatascience.com

Central Limit Theorem
the Central Limit Theorem tells us the sampling distribution of X̄ is closely approximated to a normal distribution.

 May 2021

twitter.com twitter.com

🔥 Kareem Carr 🔥 on Twitter. (n.d.). Twitter. Retrieved 1 May 2021, from https://twitter.com/kareem_carr/status/1383925269132582912

 Jun 2019

mitpressonpubpub.mitpress.mit.edu mitpressonpubpub.mitpress.mit.edu

Or do you recall jotting down formulae for molecules and compounds in the margins of your chemistry textbook?
I can't help but think of one of the biggest and longest standing puzzles in mathematics in Fermat's Last Theorem. He famously wrote in the margin of a book that he had a proof. but that it was too large to fit in the margin.

 Jun 2017