Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
関数方程式のあやしい世界
Search
Yoriyuki Yamagata
April 13, 2019
Science
840
0
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
関数方程式のあやしい世界
関数方程式の闇
Yoriyuki Yamagata
April 13, 2019
More Decks by Yoriyuki Yamagata
See All by Yoriyuki Yamagata
科学の虚構主義的解釈と祖先以前性の問題
yoriyuki
1
270
5分で分る直観主義数学
yoriyuki
0
600
算道 − 古代・中世日本の数学 -
yoriyuki
1
810
指数関数は存在しないという話
yoriyuki
0
420
Other Decks in Science
See All in Science
社内で活躍できるデータサイエンティストになるために
aikinohara
1
130
Kritische evaluatie van GenAI-output voor literatuuronderzoek
voginip
0
210
Testing the Longevity Bottleneck Hypothesis
chinson03
0
410
大黒市で発生した大規模インシデント の ポストモーテムから読み解く、 記憶媒体消去の大切さ
shucho0103
0
220
[NLP2026 参加報告会] AI for Science まとめ / NLP2026
lychee1223
0
2k
Massey Ratings for Match Outcome Prediction in Table Tennis: Evidence of Greater Stability than the ITTF World Ranking
konakalab
0
120
科学で迫る勝敗の法則-スポーツデータ分析の最前線 (刈谷市連携講座.2026年7月) / The principle of victory discovered by science. at Kariya City, 2027.07
konakalab
0
130
Bear-safety-running
akirun_run
0
190
J-STAGE全文XML登載必須化について
xspa2012
0
1.3k
因果推論と機械学習
sshimizu2006
1
1.3k
AkarengaLT vol.41
hashimoto_kei
1
160
(CVPR2026) Back to Basics: Let Denoising Generative Models Denoise
shumpei777
0
290
Featured
See All Featured
Between Models and Reality
mayunak
4
390
WENDY [Excerpt]
tessaabrams
11
39k
How to build an LLM SEO readiness audit: a practical framework
nmsamuel
1
860
[RailsConf 2023] Rails as a piece of cake
palkan
59
6.9k
Hiding What from Whom? A Critical Review of the History of Programming languages for Music
tomoyanonymous
3
1.1k
Leading Effective Engineering Teams in the AI Era
addyosmani
9
2.3k
Designing Experiences People Love
moore
143
24k
From π to Pie charts
rasagy
0
270
Being A Developer After 40
akosma
91
590k
Testing 201, or: Great Expectations
jmmastey
46
8.2k
The Organizational Zoo: Understanding Human Behavior Agility Through Metaphoric Constructive Conversations (based on the works of Arthur Shelley, Ph.D)
kimpetersen
PRO
0
410
Chasing Engaging Ingredients in Design
codingconduct
0
270
Transcript
͜ͷΑ͏ͳfΛͯ͢ٻΊΑ f(x) = x͕Ұͭͷղ͕ͩ… ؔํఔࣜ f(x + y) = f(x)
+ f(y) f(1) = 1
ղ ଞʹղʁ f(x) + f(y) = f(x + y +
2f(xy)) f: ℝ≥0 → ℝ≥0 f(x) = 0 and f(x) = x
ఆཧ f͕࿈ଓͳΒɺղ f(x) = 0 ·ͨ f(x) = x
ิ̍ f͕୯ࣹͳΒf(x)=√x f(x) + f(y) + f(1) = f(x +
y + 1 + 2f(y) + 2f(xy + x + 2xf(y)) f(x) + f(y) + f(1) = f(x + y + 1 + 2f(xy) + 2f(x) + 2f(y)) ূ໌ɿ f͕୯ࣹΑΓ f(xy + x + 2xf(y)) = f(xy) + f(x) = f(xy + x + 2f(x2y)) ∴ f(x2y) = xf(y) ∴ f(x) = f(1) x
ิ̎ f(x)x͕૿Ճͨ͠ͱ͖ݮগ͠ͳ͍ t ↦ t + 2f(xt) ҙͷਖ਼ͷ࣮Λͭ ূ໌ɿ Αͬͯy>xʹରͯ͋͠Δt͕ଘࡏͯ͠
f(y) = f(x + t + 2f(xt)) = f(x) + f(t) ≥ f(x)
ఆཧͷূ໌ ͋͠ΔaͰf(a) = 0ͳΒ f(2a) ≤ f(2a + 2f(a2)) =
2f(a) = 0 fݮগ͠ͳ͍͔Βɺf߃తʹ̌ɻ ͦ͏Ͱͳ͍ͱ͢Δɻิ̎ͷূ໌ͱಉ༷ʹ ҙͷy>xʹ͍ͭͯɺ͋Δt͕͋ͬͯy-x = t + f(tx) f(y) = f(x + t + f(tx)) = f(x) + f(t) > f(x) Αͬͯf୯ௐ૿େɻิ̍ΑΓ
ະղܾ f͕ҰൠͷؔͩͬͨΒʁ