Questions tagged [proof]

The tag has no usage guidance.

7 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
13
votes
0answers
507 views

Proving (self) similarity with Mathematica - Reccurrence Plots, Similarity Plots etc

I posted this question in math.se but given the sheer tumultuous number of questions that keep appearing on math.se and also given that I am trying to accomplish this in Mathematica, I thought I'd ...
5
votes
0answers
178 views

Theorem Proving

It's a hard for me to write english so I'll try to go straight to my problem. There is abstract predicate f, that takes two parameters. There are also two other ...
5
votes
0answers
243 views

Can I define an axiomatic (Boolean algebra) system and prove theorems using Mathematica?

The general question is Can I define an axiomatic system and prove theorems using Mathematica? The more concrete one is about Boolean algebra. I consider this axiomatic Boolean algebra system (wiki)....
4
votes
0answers
96 views

How to use Resolve to prove ForAll function

I want to prove that ∀n ∈ N,Mod[9^n - 8 n - 1, 64] == 0 I think I should use Resolve to prove it ...
2
votes
0answers
84 views

How to prove subspaces of function spaces?

In teaching Linear Algebra, I would like to prove or disprove whether a nonempty subset of a vector space, is a subspace. For this, I would show that the subset is closed under both addition and ...
1
vote
0answers
80 views

FindEquationalProof with implications

Motivated by this question in mathematics, my Mathematica question is essentially this one, but alas the answer to that isn't quite adequate. I'm not interested in verifying that a proof is valid or ...
0
votes
0answers
37 views

What is the proper way to feed this function as input and test if my statement is true?

$f(S)$ = {$n∈N$: $n=m²$ for $m∈S$} $S$ = $1,2,3$ Square each element in S Now, $S= 1, 4, 9$ All elements in $S$ are counting from $1$ to $N$. In this case $N=3$ $f(S)$ = {$n∈N$: $n=m²$ for $m∈S$} ...