[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math


View post   

File: 7 KB, 240x220, squidward revival.jpg [View same] [iqdb] [saucenao] [google]
11265378 No.11265378 [Reply] [Original]

Hello, /sci/! I have a question!
What is the hardest math field?

>> No.11265385

>>11265378
counting

>> No.11265388

triple integrals
quotient rule

>> No.11265389

>>11265378
Unemployment

>> No.11265398

>>11265385
This. Counting is some serious bullshit.

>> No.11265432

>>11265378
Dense Isomorphic Complex K-perfectoids

>> No.11265477

>>11265388
Lol

>> No.11265487

>>11265378
hardest what you moron? most difficult to learn?

>> No.11265622
File: 1.27 MB, 1366x768, yukari_sneer.png [View same] [iqdb] [saucenao] [google]
11265622

>>11265378
Physics.

>> No.11265740

>>11265378
>What is the hardest math field?
IUT

>> No.11265742
File: 54 KB, 667x1000, TIMESAND___mm6m57u56jhef422sxxxl2lxl2lxllpxk02kx0xk2f645g4211qrzfjgm8t24567u368t244tefwe6523568688.jpg [View same] [iqdb] [saucenao] [google]
11265742

Fractional distance might be the easiest, and I pride myself on that.

>> No.11265839

PDE

>> No.11265842

>>11265378
programming

>> No.11265865

Barnett Integration/Barnett Spaces

>> No.11265870

>>11265839
This is correct, to the extent that I am not familiar with anything harder.

>> No.11265880

>>11265385
Yep, fpbp, you need to have literally genius-level IQ in order to understand some modern combinatorics.

>> No.11266020

Someone post the iceberg graphic, I've lost it

>> No.11266055
File: 755 KB, 1200x3600, 1572572992711.jpg [View same] [iqdb] [saucenao] [google]
11266055

>>11266020

>> No.11266093

>>11265378
Unironically Inter Universal Teichmuller Theory

>> No.11266104

>>11266055
Thats the one! Thank you very much anon.

>>11265378
Op, you have your answer:
>Random Sequence Extrapolation

>> No.11266216

>>11265622
no

>> No.11266229

>>11266055
Funny how the hardest ones are from physics.

>> No.11266237

>>11266229
?

The hardest ones I see are from CS, which is even funnier

>> No.11266575

>>11265378
Macroeconomics has these bullshit convoluted equations that could fucking trick the Dalai Lama into making a small mistake somewhere and fucking the entire thing up.
It's fundamentally the surreal fact that multiplying one million digits by hand can be harder than proving the Riemann hypothesis.
>>11265622
>computations in local coordinates in general relativity
Please kill me. End my suffering.

>> No.11266756

>>11265378
Topology.

>> No.11266792

>>11266055
P=NP because any hyperoperation can be expressed by an infinite polynomial equation, retard

>> No.11266793

>>11266792
>infinite
>polynomial

>> No.11266869

Square roots by hand

>> No.11267090

>>11266869
Mclaurin expansions are the hardest math?

>> No.11267237
File: 445 KB, 746x676, yukari_smile.png [View same] [iqdb] [saucenao] [google]
11267237

>>11266575
Read Nakahara.

>> No.11267619

>>11266229
all of them are physics, just because basic math isnt BRANDED physics it still is bound to physics you brainlet, i thought you guys were smart?

>> No.11267642

>>11265880
Eh, it all has to do with where your talents lie. I'm sure there's plenty of people doing stuff with combinatorics who wouldn't dare stray into real analysis. Obviously not that they couldn't do it, but they'd be much slower at it than people who are inclined towards that school of mathematics.

>> No.11267649

>>11266869
Too hard to fold the paper for you?

>> No.11268107

>>11266055
Why aren't prime numbers on the bottom? Shit list.

>> No.11268208

>>11266055
Where is model theory

>> No.11268217
File: 64 KB, 544x619, TIMESAND___76218fff322224x842f6f33ff3f8gf2f24f4f21ff3f2tg2nnmgjzz24t24t24f24fgt6fng.png [View same] [iqdb] [saucenao] [google]
11268217

>>11266792
Here is some thing I don't understand about Clay's Millennium Prizes. For RH, they have a nice paper by Bombieri
>https://www.claymath.org/sites/default/files/official_problem_description.pdf
that clearly states in mathematical terms exactly what the problem is. However, they do not have such descriptions of the other five unsolved problems. I would like to work on P=NP but I am not sure what P or NP are, and Clay doesn't have any source material, and don't think I have ever come across the exact technical specifications. Same thing for Yang--Mills and Navier--Stokes which I think I've solved. I can't make a formal proof because I don't have a formal definition of the problem. For YM, it's pic related. For NS, I think it can't blow up in finite time because "finite time" means a natural number of time steps, and the time would have to enter the neighborhood of infinity before the solution could explode.

Pic from here:
The Golden Ratio in the Modified Cosmological Model
http://www.vixra.org/abs/1807.0136

>> No.11268225

>>11266055
I feel like anyone completing undegrad in math should be able reach the bottoms of "serious math"

>> No.11268226
File: 42 KB, 762x353, math IQ.png [View same] [iqdb] [saucenao] [google]
11268226

>>11265378
Inter-Universal Teichmüller Theory

https://www.unz.com/akarlin/intro-apollos-ascent/

>> No.11268243

>>11268217
Dear Arcón. Recommend me a complex analysis book!

>> No.11268249

>>11268243
My CA skills are pretty much barely par for an undergrad tier. When I need to remember something, I use these Orloff notes.
>https://math.mit.edu/~jorloff/18.04/notes/topic0.pdf
Just change the topic number to go forward.

>> No.11268251

>>11265378
Nothing that I work on, I'll assure you of that.

>> No.11268278
File: 15 KB, 333x499, 31rA1vomFdL._SX331_BO1,204,203,200_.jpg [View same] [iqdb] [saucenao] [google]
11268278

>>11265378
In terms of what? Hardest to learn? Hardest to publish in? You could give a lot of different answers, and it's hard to give one that isn't entirely subjective. At the research level, most math is more or less the same, and what you find difficult usually boils down to personal tastes.

If I had to pick something, I'd say topos theory, at least in terms of how much you need to learn in order to actually solve problems and how much context from other subjects you need in order to fully appreciate it.

>> No.11268289

>>11267619
>all of them are physics
>I'm not the brainlet, you are
kek

>> No.11268294

>>11265839
dis the rite answer

>> No.11268298

probably high level arithmetic/algebraic geometry or theoretical PDE

>> No.11270015

>>11267237
neck yourself.. , anime-watching subhuman.....

>> No.11270387
File: 255 KB, 534x534, Frogie.png [View same] [iqdb] [saucenao] [google]
11270387

>>11266055
>mfw am engineer and know everything above "serious math"

>> No.11270465

>>11265385
Great. I'm taking combinatorics along with real analysis 1 next semester. How screwed am I?

>> No.11270522

>>11265839
you do those in high school analysis class

>> No.11270539

>>11265432
Hey Peter Scholze, sup?

>> No.11270638
File: 786 KB, 922x1052, Screen Shot 2019-12-24 at 12.02.22 AM.png [View same] [iqdb] [saucenao] [google]
11270638

>>11270539
Nothing much man, just fapping to some anime girls. You want some IQ points buddy?

>> No.11270669

>>11270522
real pde, not "solve le heat equation with fourier transforms"
real pde is functional analysis + dynamics + geometry
read evans

>> No.11270675
File: 65 KB, 330x466, ccBHE.png [View same] [iqdb] [saucenao] [google]
11270675

>>11265378
Algebra.

>> No.11270836

>>11265432
Math isnt actually that hard

>> No.11270879

>>11268217
>I want to work on P=NP
>I am not sure what P or NP are

Wat. This is readily available information online. P is the set of computable problems solvable in polynomial time, NP is the set of computable problems that are (as of yet) not solvable in polynomial time. Mathematically,

[eqn]P=\{O(n) \mid \exists m \in \mathbb{Z} \text{ s.t } O(n)=c_0+c_1n+c_2n^2 + ... + c_mn^m\}[/eqn]
[eqn]NP=U-P[/eqn]
Where U is all computable problems. The goal is to show that [math]NP=\emptyset[/math]

Basically, prove every function can be expressed as a finite polynomial that's equivalent and you've got yourself a Fields medal.
Best of luck finding a polynomial function to model the TSP though

>> No.11271092

Arithmetic is unironically the hardest field of maths.

>> No.11271097
File: 939 KB, 1185x1526, Enabling_eCommerce-_Small_Enterprises,_Global_Players_(39008130265)_(cropped).jpg [View same] [iqdb] [saucenao] [google]
11271097

>>11270879
>np equals the set of non-polytime, computable problems
Keep pluggin away there champ, you're gonna solve this millennium problem in no time.

>> No.11271099

>>11270879
>NP is the set of computable problems that are (as of yet) not solvable in polynomial time.
No it isn't.
Even I know this much.

>> No.11271114

>>11271097
this image can't be real

>> No.11272672

>>11270539
Props for noticing, Anon.

>> No.11272813

>>11270879
that's not what NP is idiot
NP is nondeterministic polynomial time, which essentially says "polynomial with an oracle." an easier characterization is that a search problem (i.e, one which searches for a solution to a given input problem) is NP if you can verify whether or not some possible output is actually a solution in polynomial time. so if you give me a traveling salesman graph and a budget, i can give you a traversal of your graph, and you are able to check whether or not my traversal is within the budget you set and whether it's a traversal at all (very easy in polynomial time)
there are plenty of non-polynomial problems that are also probably not NP, though there's a whole complexity hierarchy which hasn't been resolved yet. for example, satisfiability of quantifier boolean languages is probably not NP. if i give you a set of variable assignments for a quantifier boolean expression, it isn't easy to tell whether or not it's true.

>> No.11272852

>>11266055
lol @ cohomology is genius level gap
undergrad category theorist gang

>> No.11273580

>>11266055
>""""strokes""""
>>11268208
a model of a logical statement is a set with corresponding functions that satisfy the logical statement.

for example, R=the real numbers equipped with its standard addition is a model of the abelian group statement("every number has additive inverse and commutative and blah blah")

when you take a logical statement, it's very illuminating to look at the class of models that satisfies the statement.

>> No.11273707

>>11272852
this.

>> No.11273710

>>11272852
Oh yeah? How about you compute the de-Rham cohomology of the real plane minus two distinct points with your category theory, you little bitch? Haha, it's always the mediocre undergrads that study category theory. Get real, faggot.

>> No.11274218

>>11273710
literally trivial you fucking pathetic moron